Theorem ud2lem0a 250

Description: Introduce →₂ to the left.

Hypothesis

Ref	Expression
ud2lem0a.1	a = b

Assertion

Ref	Expression
ud2lem0a	(c →2 a) = (c →2 b)

Proof of Theorem ud2lem0a

Step	Hyp	Ref	Expression
1		ud2lem0a.1	. . 3 a = b
2	1	ax-r4 36	. . . 4 a⊥ = b⊥
3	2	lan 70	. . 3 (c⊥ ∩ a⊥ ) = (c⊥ ∩ b⊥ )
4	1, 3	2or 67	. 2 (a ∪ (c⊥ ∩ a⊥ )) = (b ∪ (c⊥ ∩ b⊥ ))
5		df-i2 44	. 2 (c →2 a) = (a ∪ (c⊥ ∩ a⊥ ))
6		df-i2 44	. 2 (c →2 b) = (b ∪ (c⊥ ∩ b⊥ ))
7	4, 5, 6	3tr1 60	1 (c →2 a) = (c →2 b)

Syntax hints:   = wb 1  ^⊥ wn 4   ∪ wo 6   ∩ wa 7   →₂ wi2 14

This theorem is referenced by:  i2i1 259  i1i2con2 261  nom41 318  ud2 578  3vth6 791  2oath1i1 809  1oath1i1u 810

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-i2 44

metamath.org