Theorem ud1 577

Description: Unified disjunction for Sasaki implication.

Assertion

Ref	Expression
ud1	(a ∪ b) = ((a →1 b) →1 (((a →1 b) →1 (b →1 a)) →1 a))

Proof of Theorem ud1

Step	Hyp	Ref	Expression
1		ud1lem1 542	. . . . . 6 ((a →1 b) →1 (b →1 a)) = (a ∪ (a⊥ ∩ b⊥ ))
2	1	ud1lem0b 248	. . . . 5 (((a →1 b) →1 (b →1 a)) →1 a) = ((a ∪ (a⊥ ∩ b⊥ )) →1 a)
3		ud1lem2 543	. . . . 5 ((a ∪ (a⊥ ∩ b⊥ )) →1 a) = (a ∪ b)
4	2, 3	ax-r2 35	. . . 4 (((a →1 b) →1 (b →1 a)) →1 a) = (a ∪ b)
5	4	ud1lem0a 247	. . 3 ((a →1 b) →1 (((a →1 b) →1 (b →1 a)) →1 a)) = ((a →1 b) →1 (a ∪ b))
6		ud1lem3 544	. . 3 ((a →1 b) →1 (a ∪ b)) = (a ∪ b)
7	5, 6	ax-r2 35	. 2 ((a →1 b) →1 (((a →1 b) →1 (b →1 a)) →1 a)) = (a ∪ b)
8	7	ax-r1 34	1 (a ∪ b) = ((a →1 b) →1 (((a →1 b) →1 (b →1 a)) →1 a))

Syntax hints:   = wb 1  ^⊥ wn 4   ∪ wo 6   ∩ wa 7   →₁ wi1 13

This theorem was proved from axioms:  ax-a1 29  ax-a2 30  ax-a3 31  ax-a4 32  ax-a5 33  ax-r1 34  ax-r2 35  ax-r4 36  ax-r5 37  ax-r3 421

This theorem depends on definitions:  df-b 38  df-a 39  df-t 40  df-f 41  df-i1 43  df-le1 122  df-le2 123  df-c1 124  df-c2 125

metamath.org