[Lattice L46-7]Home PageHome Quantum Logic Explorer < Previous   Next >
Related theorems
Unicode version

Theorem u4lemc2 671
Description: Commutation theorem for non-tollens implication.
Hypotheses
Ref Expression
ulemc2.1 a C b
ulemc2.2 a C c
Assertion
Ref Expression
u4lemc2 a C (b ->4 c)

Proof of Theorem u4lemc2
StepHypRef Expression
1 ulemc2.1 . . . . 5 a C b
2 ulemc2.2 . . . . 5 a C c
31, 2com2an 466 . . . 4 a C (b ^ c)
41comcom2 175 . . . . 5 a C b_|_
54, 2com2an 466 . . . 4 a C (b_|_ ^ c)
63, 5com2or 465 . . 3 a C ((b ^ c) v (b_|_ ^ c))
74, 2com2or 465 . . . 4 a C (b_|_ v c)
82comcom2 175 . . . 4 a C c_|_
97, 8com2an 466 . . 3 a C ((b_|_ v c) ^ c_|_)
106, 9com2or 465 . 2 a C (((b ^ c) v (b_|_ ^ c)) v ((b_|_ v c) ^ c_|_))
11 df-i4 46 . . 3 (b ->4 c) = (((b ^ c) v (b_|_ ^ c)) v ((b_|_ v c) ^ c_|_))
1211ax-r1 34 . 2 (((b ^ c) v (b_|_ ^ c)) v ((b_|_ v c) ^ c_|_)) = (b ->4 c)
1310, 12cbtr 174 1 a C (b ->4 c)
Colors of variables: term
Syntax hints:   C wc 3  _|_wn 4   v wo 6   ^ wa 7   ->4 wi4 16
This theorem is referenced by:  u4lemc5 681
This theorem was proved from axioms:  ax-a1 29  ax-a2 30  ax-a3 31  ax-a4 32  ax-a5 33  ax-r1 34  ax-r2 35  ax-r4 36  ax-r5 37  ax-r3 421
This theorem depends on definitions:  df-b 38  df-a 39  df-t 40  df-f 41  df-i4 46  df-le1 122  df-le2 123  df-c1 124  df-c2 125
metamath.org