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

Theorem ud4lem0a 254
Description: Introduce ->4 to the left.
Hypothesis
Ref Expression
ud4lem0a.1 a = b
Assertion
Ref Expression
ud4lem0a (c ->4 a) = (c ->4 b)

Proof of Theorem ud4lem0a
StepHypRef Expression
1 ud4lem0a.1 . . . . 5 a = b
21lan 70 . . . 4 (c ^ a) = (c ^ b)
31lan 70 . . . 4 (c_|_ ^ a) = (c_|_ ^ b)
42, 32or 67 . . 3 ((c ^ a) v (c_|_ ^ a)) = ((c ^ b) v (c_|_ ^ b))
51lor 66 . . . 4 (c_|_ v a) = (c_|_ v b)
61ax-r4 36 . . . 4 a_|_ = b_|_
75, 62an 72 . . 3 ((c_|_ v a) ^ a_|_) = ((c_|_ v b) ^ b_|_)
84, 72or 67 . 2 (((c ^ a) v (c_|_ ^ a)) v ((c_|_ v a) ^ a_|_)) = (((c ^ b) v (c_|_ ^ b)) v ((c_|_ v b) ^ b_|_))
9 df-i4 46 . 2 (c ->4 a) = (((c ^ a) v (c_|_ ^ a)) v ((c_|_ v a) ^ a_|_))
10 df-i4 46 . 2 (c ->4 b) = (((c ^ b) v (c_|_ ^ b)) v ((c_|_ v b) ^ b_|_))
118, 9, 103tr1 60 1 (c ->4 a) = (c ->4 b)
Colors of variables: term
Syntax hints:   = wb 1  _|_wn 4   v wo 6   ^ wa 7   ->4 wi4 16
This theorem is referenced by:  i4i3 263  nom43 320  ud4 580
This theorem was proved from axioms:  ax-a2 30  ax-r1 34  ax-r2 35  ax-r4 36  ax-r5 37
This theorem depends on definitions:  df-a 39  df-i4 46
metamath.org