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

Theorem i2i1i1 782
Description: Equivalence to ->2.
Assertion
Ref Expression
i2i1i1 (a ->2 b) = ((a ->1 (a v b)) ^ ((a v b) ->1 b))

Proof of Theorem i2i1i1
StepHypRef Expression
1 an1r 99 . . 3 (1 ^ (b v (a_|_ ^ b_|_))) = (b v (a_|_ ^ b_|_))
21ax-r1 34 . 2 (b v (a_|_ ^ b_|_)) = (1 ^ (b v (a_|_ ^ b_|_)))
3 df-i2 44 . 2 (a ->2 b) = (b v (a_|_ ^ b_|_))
4 a5c 113 . . . . . 6 (a ^ (a v b)) = a
54lor 66 . . . . 5 (a_|_ v (a ^ (a v b))) = (a_|_ v a)
6 ax-a2 30 . . . . 5 (a_|_ v a) = (a v a_|_)
75, 6ax-r2 35 . . . 4 (a_|_ v (a ^ (a v b))) = (a v a_|_)
8 df-i1 43 . . . 4 (a ->1 (a v b)) = (a_|_ v (a ^ (a v b)))
9 df-t 40 . . . 4 1 = (a v a_|_)
107, 8, 93tr1 60 . . 3 (a ->1 (a v b)) = 1
11 df-i1 43 . . . 4 ((a v b) ->1 b) = ((a v b)_|_ v ((a v b) ^ b))
12 anor3 82 . . . . . 6 (a_|_ ^ b_|_) = (a v b)_|_
13 leor 151 . . . . . . . 8 b =< (a v b)
14 leid 140 . . . . . . . 8 b =< b
1513, 14ler2an 165 . . . . . . 7 b =< ((a v b) ^ b)
16 lear 153 . . . . . . 7 ((a v b) ^ b) =< b
1715, 16lebi 137 . . . . . 6 b = ((a v b) ^ b)
1812, 172or 67 . . . . 5 ((a_|_ ^ b_|_) v b) = ((a v b)_|_ v ((a v b) ^ b))
1918ax-r1 34 . . . 4 ((a v b)_|_ v ((a v b) ^ b)) = ((a_|_ ^ b_|_) v b)
20 ax-a2 30 . . . 4 ((a_|_ ^ b_|_) v b) = (b v (a_|_ ^ b_|_))
2111, 19, 203tr 62 . . 3 ((a v b) ->1 b) = (b v (a_|_ ^ b_|_))
2210, 212an 72 . 2 ((a ->1 (a v b)) ^ ((a v b) ->1 b)) = (1 ^ (b v (a_|_ ^ b_|_)))
232, 3, 223tr1 60 1 (a ->2 b) = ((a ->1 (a v b)) ^ ((a v b) ->1 b))
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   v wo 6   ^ wa 7  1wt 9   ->1 wi1 13   ->2 wi2 14
This theorem is referenced by:  mlaconj 827
This theorem was proved from axioms:  ax-a1 29  ax-a2 30  ax-a3 31  ax-a5 33  ax-r1 34  ax-r2 35  ax-r4 36  ax-r5 37
This theorem depends on definitions:  df-a 39  df-t 40  df-f 41  df-i1 43  df-i2 44  df-le1 122  df-le2 123
metamath.org