let n be non empty Nat; :: thesis: for S being non empty non void n PC-correct PCLangSignature

for L being language MSAlgebra over S

for F being PC-theory of L

for B, C being Formula of L holds (B \or (C \and (\not C))) \imp B in F

let S be non empty non void n PC-correct PCLangSignature ; :: thesis: for L being language MSAlgebra over S

for F being PC-theory of L

for B, C being Formula of L holds (B \or (C \and (\not C))) \imp B in F

let L be language MSAlgebra over S; :: thesis: for F being PC-theory of L

for B, C being Formula of L holds (B \or (C \and (\not C))) \imp B in F

let F be PC-theory of L; :: thesis: for B, C being Formula of L holds (B \or (C \and (\not C))) \imp B in F

let B, C be Formula of L; :: thesis: (B \or (C \and (\not C))) \imp B in F

( (C \and (\not C)) \imp B in F & B \imp B in F ) by Th34, Def38;

then ( (B \or (C \and (\not C))) \imp (B \or B) in F & (B \or B) \imp B in F ) by Th59, Th52;

hence (B \or (C \and (\not C))) \imp B in F by Th45; :: thesis: verum

for L being language MSAlgebra over S

for F being PC-theory of L

for B, C being Formula of L holds (B \or (C \and (\not C))) \imp B in F

let S be non empty non void n PC-correct PCLangSignature ; :: thesis: for L being language MSAlgebra over S

for F being PC-theory of L

for B, C being Formula of L holds (B \or (C \and (\not C))) \imp B in F

let L be language MSAlgebra over S; :: thesis: for F being PC-theory of L

for B, C being Formula of L holds (B \or (C \and (\not C))) \imp B in F

let F be PC-theory of L; :: thesis: for B, C being Formula of L holds (B \or (C \and (\not C))) \imp B in F

let B, C be Formula of L; :: thesis: (B \or (C \and (\not C))) \imp B in F

( (C \and (\not C)) \imp B in F & B \imp B in F ) by Th34, Def38;

then ( (B \or (C \and (\not C))) \imp (B \or B) in F & (B \or B) \imp B in F ) by Th59, Th52;

hence (B \or (C \and (\not C))) \imp B in F by Th45; :: thesis: verum