Theorem u5lem3 753

Description: Lemma for unified implication study. (Contributed by NM, 17-Dec-1997.)

Assertion

Ref	Expression
u5lem3	(a →5 (b →5 a)) = (a⊥ ∪ ((a ∩ b) ∪ (a ∩ b⊥ )))

Proof of Theorem u5lem3

Step	Hyp	Ref	Expression
1		u5lemc1b 685	. . 3 a C (b →5 a)
2	1	u5lemc4 705	. 2 (a →5 (b →5 a)) = (a⊥ ∪ (b →5 a))
3		ax-a2 31	. . 3 (a⊥ ∪ (b →5 a)) = ((b →5 a) ∪ a⊥ )
4		u5lemonb 639	. . . 4 ((b →5 a) ∪ a⊥ ) = (((b ∩ a) ∪ (b⊥ ∩ a)) ∪ a⊥ )
5		ancom 74	. . . . . . 7 (b ∩ a) = (a ∩ b)
6		ancom 74	. . . . . . 7 (b⊥ ∩ a) = (a ∩ b⊥ )
7	5, 6	2or 72	. . . . . 6 ((b ∩ a) ∪ (b⊥ ∩ a)) = ((a ∩ b) ∪ (a ∩ b⊥ ))
8	7	ax-r5 38	. . . . 5 (((b ∩ a) ∪ (b⊥ ∩ a)) ∪ a⊥ ) = (((a ∩ b) ∪ (a ∩ b⊥ )) ∪ a⊥ )
9		ax-a2 31	. . . . 5 (((a ∩ b) ∪ (a ∩ b⊥ )) ∪ a⊥ ) = (a⊥ ∪ ((a ∩ b) ∪ (a ∩ b⊥ )))
10	8, 9	ax-r2 36	. . . 4 (((b ∩ a) ∪ (b⊥ ∩ a)) ∪ a⊥ ) = (a⊥ ∪ ((a ∩ b) ∪ (a ∩ b⊥ )))
11	4, 10	ax-r2 36	. . 3 ((b →5 a) ∪ a⊥ ) = (a⊥ ∪ ((a ∩ b) ∪ (a ∩ b⊥ )))
12	3, 11	ax-r2 36	. 2 (a⊥ ∪ (b →5 a)) = (a⊥ ∪ ((a ∩ b) ∪ (a ∩ b⊥ )))
13	2, 12	ax-r2 36	1 (a →5 (b →5 a)) = (a⊥ ∪ ((a ∩ b) ∪ (a ∩ b⊥ )))

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

This proof depends on axioms:  ax-a1 30  ax-a2 31  ax-a3 32  ax-a4 33  ax-a5 34  ax-r1 35  ax-r2 36  ax-r4 37  ax-r5 38  ax-r3 439

This proof depends on definitions:  df-b 39  df-a 40  df-t 41  df-f 42  df-i5 48  df-le1 130  df-le2 131  df-c1 132  df-c2 133

This theorem is used by:  u5lem3n  756  u5lem4  760