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

Theorem u5lemc1 666
Description: Commutation theorem for relevance implication.
Assertion
Ref Expression
u5lemc1 a C (a ->5 b)

Proof of Theorem u5lemc1
StepHypRef Expression
1 comanr1 446 . . . 4 a C (a ^ b)
2 comanr1 446 . . . . 5 a_|_ C (a_|_ ^ b)
32comcom6 441 . . . 4 a C (a_|_ ^ b)
41, 3com2or 465 . . 3 a C ((a ^ b) v (a_|_ ^ b))
5 comanr1 446 . . . 4 a_|_ C (a_|_ ^ b_|_)
65comcom6 441 . . 3 a C (a_|_ ^ b_|_)
74, 6com2or 465 . 2 a C (((a ^ b) v (a_|_ ^ b)) v (a_|_ ^ b_|_))
8 df-i5 47 . . 3 (a ->5 b) = (((a ^ b) v (a_|_ ^ b)) v (a_|_ ^ b_|_))
98ax-r1 34 . 2 (((a ^ b) v (a_|_ ^ b)) v (a_|_ ^ b_|_)) = (a ->5 b)
107, 9cbtr 174 1 a C (a ->5 b)
Colors of variables: term
Syntax hints:   C wc 3  _|_wn 4   v wo 6   ^ wa 7   ->5 wi5 17
This theorem is referenced by:  u5lemc5 682  u5lembi 707  u5lem1 720  u5lem4 742  u5lem5 747  u5lem6 751
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-i5 47  df-le1 122  df-le2 123  df-c1 124  df-c2 125
metamath.org