let Al be QC-alphabet ; :: thesis: for A being non empty set
for v being Element of Valuations_in (Al,A)
for p, q being Element of CQC-WFF Al
for J being interpretation of Al,A holds J,v |= p => (('not' p) => q)
let A be non empty set ; :: thesis: for v being Element of Valuations_in (Al,A)
for p, q being Element of CQC-WFF Al
for J being interpretation of Al,A holds J,v |= p => (('not' p) => q)
let v be Element of Valuations_in (Al,A); :: thesis: for p, q being Element of CQC-WFF Al
for J being interpretation of Al,A holds J,v |= p => (('not' p) => q)
let p, q be Element of CQC-WFF Al; :: thesis: for J being interpretation of Al,A holds J,v |= p => (('not' p) => q)
let J be interpretation of Al,A; :: thesis: J,v |= p => (('not' p) => q)
('not' p) => q = 'not' (('not' p) '&' ('not' q)) by QC_LANG2:def 2;
then A1: (Valid ((p => (('not' p) => q)),J)) . v = (Valid (('not' (p '&' ('not' ('not' (('not' p) '&' ('not' q)))))),J)) . v by QC_LANG2:def 2
.= 'not' ((Valid ((p '&' ('not' ('not' (('not' p) '&' ('not' q))))),J)) . v) by Th10
.= 'not' (((Valid (p,J)) . v) '&' ((Valid (('not' ('not' (('not' p) '&' ('not' q)))),J)) . v)) by Th12 ;
(Valid (('not' ('not' (('not' p) '&' ('not' q)))),J)) . v = 'not' ((Valid (('not' (('not' p) '&' ('not' q))),J)) . v) by Th10
.= 'not' ('not' ((Valid ((('not' p) '&' ('not' q)),J)) . v)) by Th10
.= ((Valid (('not' p),J)) . v) '&' ((Valid (('not' q),J)) . v) by Th12
.= ('not' ((Valid (p,J)) . v)) '&' ((Valid (('not' q),J)) . v) by Th10
.= ('not' ((Valid (p,J)) . v)) '&' ('not' ((Valid (q,J)) . v)) by Th10 ;
then A2: (Valid ((p => (('not' p) => q)),J)) . v = 'not' ((((Valid (p,J)) . v) '&' ('not' ((Valid (p,J)) . v))) '&' ('not' ((Valid (q,J)) . v))) by A1, MARGREL1:16
.= 'not' (FALSE '&' ('not' ((Valid (q,J)) . v))) by XBOOLEAN:138 ;
FALSE '&' ('not' ((Valid (q,J)) . v)) = FALSE by MARGREL1:13;
hence (Valid ((p => (('not' p) => q)),J)) . v = TRUE by A2, MARGREL1:11; :: according to VALUAT_1:def 7 :: thesis: verum