let Al be QC-alphabet ; :: thesis: for A being non empty set
for p, q, t being Element of CQC-WFF Al
for J being interpretation of Al,A holds J |= (p => q) => (('not' (q '&' t)) => ('not' (p '&' t)))
let A be non empty set ; :: thesis: for p, q, t being Element of CQC-WFF Al
for J being interpretation of Al,A holds J |= (p => q) => (('not' (q '&' t)) => ('not' (p '&' t)))
let p, q, t be Element of CQC-WFF Al; :: thesis: for J being interpretation of Al,A holds J |= (p => q) => (('not' (q '&' t)) => ('not' (p '&' t)))
let J be interpretation of Al,A; :: thesis: J |= (p => q) => (('not' (q '&' t)) => ('not' (p '&' t)))
let v be Element of Valuations_in (Al,A); :: according to VALUAT_1:def 8 :: thesis: J,v |= (p => q) => (('not' (q '&' t)) => ('not' (p '&' t)))
thus J,v |= (p => q) => (('not' (q '&' t)) => ('not' (p '&' t))) by Th36; :: thesis: verum