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

Theorem u21lembi 709
Description: Dishkant/Sasaki implication and biconditional.
Assertion
Ref Expression
u21lembi ((a ->2 b) ^ (b ->1 a)) = (a == b)

Proof of Theorem u21lembi
StepHypRef Expression
1 u2lemc1 663 . . . . 5 b C (a ->2 b)
21comcom3 436 . . . 4 b_|_ C (a ->2 b)
3 comanr1 446 . . . . 5 b C (b ^ a)
43comcom3 436 . . . 4 b_|_ C (b ^ a)
52, 4fh2 452 . . 3 ((a ->2 b) ^ (b_|_ v (b ^ a))) = (((a ->2 b) ^ b_|_) v ((a ->2 b) ^ (b ^ a)))
6 u2lemanb 598 . . . 4 ((a ->2 b) ^ b_|_) = (a_|_ ^ b_|_)
7 u2lemab 593 . . . . . 6 ((a ->2 b) ^ b) = b
87ran 71 . . . . 5 (((a ->2 b) ^ b) ^ a) = (b ^ a)
9 anass 69 . . . . 5 (((a ->2 b) ^ b) ^ a) = ((a ->2 b) ^ (b ^ a))
10 ancom 68 . . . . 5 (b ^ a) = (a ^ b)
118, 9, 103tr2 61 . . . 4 ((a ->2 b) ^ (b ^ a)) = (a ^ b)
126, 112or 67 . . 3 (((a ->2 b) ^ b_|_) v ((a ->2 b) ^ (b ^ a))) = ((a_|_ ^ b_|_) v (a ^ b))
13 ax-a2 30 . . 3 ((a_|_ ^ b_|_) v (a ^ b)) = ((a ^ b) v (a_|_ ^ b_|_))
145, 12, 133tr 62 . 2 ((a ->2 b) ^ (b_|_ v (b ^ a))) = ((a ^ b) v (a_|_ ^ b_|_))
15 df-i1 43 . . 3 (b ->1 a) = (b_|_ v (b ^ a))
1615lan 70 . 2 ((a ->2 b) ^ (b ->1 a)) = ((a ->2 b) ^ (b_|_ v (b ^ a)))
17 dfb 86 . 2 (a == b) = ((a ^ b) v (a_|_ ^ b_|_))
1814, 16, 173tr1 60 1 ((a ->2 b) ^ (b ->1 a)) = (a == b)
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   == tb 5   v wo 6   ^ wa 7   ->1 wi1 13   ->2 wi2 14
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-i1 43  df-i2 44  df-le1 122  df-le2 123  df-c1 124  df-c2 125
metamath.org