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

Theorem u5lem2 730
Description: Lemma for unified implication study.
Assertion
Ref Expression
u5lem2 (((a ->5 b) ->5 a) ->5 a) = (a v ((a_|_ ^ b) v (a_|_ ^ b_|_)))

Proof of Theorem u5lem2
StepHypRef Expression
1 u5lemc1b 667 . . . 4 a C ((a ->5 b) ->5 a)
21comcom 435 . . 3 ((a ->5 b) ->5 a) C a
32u5lemc4 687 . 2 (((a ->5 b) ->5 a) ->5 a) = (((a ->5 b) ->5 a)_|_ v a)
4 u5lem1n 725 . . . 4 ((a ->5 b) ->5 a)_|_ = ((a_|_ ^ b) v (a_|_ ^ b_|_))
54ax-r5 37 . . 3 (((a ->5 b) ->5 a)_|_ v a) = (((a_|_ ^ b) v (a_|_ ^ b_|_)) v a)
6 ax-a2 30 . . 3 (((a_|_ ^ b) v (a_|_ ^ b_|_)) v a) = (a v ((a_|_ ^ b) v (a_|_ ^ b_|_)))
75, 6ax-r2 35 . 2 (((a ->5 b) ->5 a)_|_ v a) = (a v ((a_|_ ^ b) v (a_|_ ^ b_|_)))
83, 7ax-r2 35 1 (((a ->5 b) ->5 a) ->5 a) = (a v ((a_|_ ^ b) v (a_|_ ^ b_|_)))
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   v wo 6   ^ wa 7   ->5 wi5 17
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