let f, g be FinSequence of CQC-WFF ; :: thesis: ( Ant f = Ant g & Ant f |= Suc f & Ant g |= Suc g implies Ant f |= (Suc f) '&' (Suc g) )
assume A1: ( Ant f = Ant g & Ant f |= Suc f & Ant g |= Suc g ) ; :: thesis: Ant f |= (Suc f) '&' (Suc g)
let A be non empty set ; :: according to CALCUL_1:def 15 :: thesis: for J being interpretation of A
for v being Element of Valuations_in A st J,v |= Ant f holds
J,v |= (Suc f) '&' (Suc g)
let J be interpretation of A; :: thesis: for v being Element of Valuations_in A st J,v |= Ant f holds
J,v |= (Suc f) '&' (Suc g)
let v be Element of Valuations_in A; :: thesis: ( J,v |= Ant f implies J,v |= (Suc f) '&' (Suc g) )
assume A2: J,v |= Ant f ; :: thesis: J,v |= (Suc f) '&' (Suc g)
( J,v |= Suc f & J,v |= Suc g ) by A1, A2, Def15;
hence J,v |= (Suc f) '&' (Suc g) by VALUAT_1:29; :: thesis: verum