Theorem ud5lem0b 265

Description: Introduce →₅ to the right. (Contributed by NM, 23-Nov-1997.)

Hypothesis

Ref	Expression
ud5lem0a.1	a = b

Assertion

Ref	Expression
ud5lem0b	(a →5 c) = (b →5 c)

Proof of Theorem ud5lem0b

Step	Hyp	Ref	Expression
1		ud5lem0a.1	. . . . 5 a = b
2	1	ran 78	. . . 4 (a ∩ c) = (b ∩ c)
3	1	ax-r4 37	. . . . 5 a⊥ = b⊥
4	3	ran 78	. . . 4 (a⊥ ∩ c) = (b⊥ ∩ c)
5	2, 4	2or 72	. . 3 ((a ∩ c) ∪ (a⊥ ∩ c)) = ((b ∩ c) ∪ (b⊥ ∩ c))
6	3	ran 78	. . 3 (a⊥ ∩ c⊥ ) = (b⊥ ∩ c⊥ )
7	5, 6	2or 72	. 2 (((a ∩ c) ∪ (a⊥ ∩ c)) ∪ (a⊥ ∩ c⊥ )) = (((b ∩ c) ∪ (b⊥ ∩ c)) ∪ (b⊥ ∩ c⊥ ))
8		df-i5 48	. 2 (a →5 c) = (((a ∩ c) ∪ (a⊥ ∩ c)) ∪ (a⊥ ∩ c⊥ ))
9		df-i5 48	. 2 (b →5 c) = (((b ∩ c) ∪ (b⊥ ∩ c)) ∪ (b⊥ ∩ c⊥ ))
10	7, 8, 9	3tr1 63	1 (a →5 c) = (b →5 c)

This proof depends on syntax axioms:   = wb 1  ^⊥ wn 4   ∪ wo 6   ∩ wa 7   →₅ wi5 16

This proof depends on axioms:  ax-a2 31  ax-r1 35  ax-r2 36  ax-r4 37  ax-r5 38

This proof depends on definitions:  df-a 40  df-i5 48

This theorem is used by:  ud5  599