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

Theorem u1lemn1b 712
Description: This theorem continues the line of proofs such as u1lemnaa 622, ud1lem0b 248, u1lemnanb 637, etc. (Contributed by Josiah Burroughs 26-May-04.)
Assertion
Ref Expression
u1lemn1b (a ->1 b) = ((a ->1 b)_|_ ->1 b)

Proof of Theorem u1lemn1b
StepHypRef Expression
1 ax-a1 29 . . 3 (a ->1 b) = (a ->1 b)_|__|_
2 u1lemnab 632 . . . 4 ((a ->1 b)_|_ ^ b) = 0
32ax-r1 34 . . 3 0 = ((a ->1 b)_|_ ^ b)
41, 32or 67 . 2 ((a ->1 b) v 0) = ((a ->1 b)_|__|_ v ((a ->1 b)_|_ ^ b))
5 or0 94 . . 3 ((a ->1 b) v 0) = (a ->1 b)
65ax-r1 34 . 2 (a ->1 b) = ((a ->1 b) v 0)
7 df-i1 43 . 2 ((a ->1 b)_|_ ->1 b) = ((a ->1 b)_|__|_ v ((a ->1 b)_|_ ^ b))
84, 6, 73tr1 60 1 (a ->1 b) = ((a ->1 b)_|_ ->1 b)
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   v wo 6   ^ wa 7  0wf 10   ->1 wi1 13
This theorem is referenced by:  u1lem3var1 713
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
metamath.org