Theorem ud3lem1 552

Description: Lemma for unified disjunction.

Assertion

Ref	Expression
ud3lem1	((a ->3 b) ->3 (b ->3 a)) = (a v (a_|_ ^ b_|_))

Proof of Theorem ud3lem1

Step	Hyp	Ref	Expression
1		df-i3 45	. 2 ((a ->3 b) ->3 (b ->3 a)) = ((((a ->3 b)_|_ ^ (b ->3 a)) v ((a ->3 b)_|_ ^ (b ->3 a)_|_)) v ((a ->3 b) ^ ((a ->3 b)_|_ v (b ->3 a))))
2		ud3lem1a 548	. . . . . 6 ((a ->3 b)_|_ ^ (b ->3 a)) = (a ^ b_|_)
3		ud3lem1b 549	. . . . . 6 ((a ->3 b)_|_ ^ (b ->3 a)_|_) = 0
4	2, 3	2or 67	. . . . 5 (((a ->3 b)_|_ ^ (b ->3 a)) v ((a ->3 b)_|_ ^ (b ->3 a)_|_)) = ((a ^ b_|_) v 0)
5		or0 94	. . . . 5 ((a ^ b_|_) v 0) = (a ^ b_|_)
6	4, 5	ax-r2 35	. . . 4 (((a ->3 b)_|_ ^ (b ->3 a)) v ((a ->3 b)_|_ ^ (b ->3 a)_|_)) = (a ^ b_|_)
7		ud3lem1d 551	. . . 4 ((a ->3 b) ^ ((a ->3 b)_|_ v (b ->3 a))) = ((a_|_ ^ b_|_) v (a ^ (a_|_ v b)))
8	6, 7	2or 67	. . 3 ((((a ->3 b)_|_ ^ (b ->3 a)) v ((a ->3 b)_|_ ^ (b ->3 a)_|_)) v ((a ->3 b) ^ ((a ->3 b)_|_ v (b ->3 a)))) = ((a ^ b_|_) v ((a_|_ ^ b_|_) v (a ^ (a_|_ v b))))
9		coman1 177	. . . . . . 7 (a ^ b_|_) C a
10	9	comcom2 175	. . . . . . . 8 (a ^ b_|_) C a_|_
11		coman2 178	. . . . . . . . 9 (a ^ b_|_) C b_|_
12	11	comcom7 442	. . . . . . . 8 (a ^ b_|_) C b
13	10, 12	com2or 465	. . . . . . 7 (a ^ b_|_) C (a_|_ v b)
14	9, 13	fh3 453	. . . . . 6 ((a ^ b_|_) v (a ^ (a_|_ v b))) = (((a ^ b_|_) v a) ^ ((a ^ b_|_) v (a_|_ v b)))
15		ax-a2 30	. . . . . . . . 9 ((a ^ b_|_) v a) = (a v (a ^ b_|_))
16		a5b 112	. . . . . . . . 9 (a v (a ^ b_|_)) = a
17	15, 16	ax-r2 35	. . . . . . . 8 ((a ^ b_|_) v a) = a
18		ax-a2 30	. . . . . . . . 9 ((a ^ b_|_) v (a_|_ v b)) = ((a_|_ v b) v (a ^ b_|_))
19		anor1 80	. . . . . . . . . . 11 (a ^ b_|_) = (a_|_ v b)_|_
20	19	lor 66	. . . . . . . . . 10 ((a_|_ v b) v (a ^ b_|_)) = ((a_|_ v b) v (a_|_ v b)_|_)
21		df-t 40	. . . . . . . . . . 11 1 = ((a_|_ v b) v (a_|_ v b)_|_)
22	21	ax-r1 34	. . . . . . . . . 10 ((a_|_ v b) v (a_|_ v b)_|_) = 1
23	20, 22	ax-r2 35	. . . . . . . . 9 ((a_|_ v b) v (a ^ b_|_)) = 1
24	18, 23	ax-r2 35	. . . . . . . 8 ((a ^ b_|_) v (a_|_ v b)) = 1
25	17, 24	2an 72	. . . . . . 7 (((a ^ b_|_) v a) ^ ((a ^ b_|_) v (a_|_ v b))) = (a ^ 1)
26		an1 98	. . . . . . 7 (a ^ 1) = a
27	25, 26	ax-r2 35	. . . . . 6 (((a ^ b_|_) v a) ^ ((a ^ b_|_) v (a_|_ v b))) = a
28	14, 27	ax-r2 35	. . . . 5 ((a ^ b_|_) v (a ^ (a_|_ v b))) = a
29	28	lor 66	. . . 4 ((a_|_ ^ b_|_) v ((a ^ b_|_) v (a ^ (a_|_ v b)))) = ((a_|_ ^ b_|_) v a)
30		or12 73	. . . 4 ((a ^ b_|_) v ((a_|_ ^ b_|_) v (a ^ (a_|_ v b)))) = ((a_|_ ^ b_|_) v ((a ^ b_|_) v (a ^ (a_|_ v b))))
31		ax-a2 30	. . . 4 (a v (a_|_ ^ b_|_)) = ((a_|_ ^ b_|_) v a)
32	29, 30, 31	3tr1 60	. . 3 ((a ^ b_|_) v ((a_|_ ^ b_|_) v (a ^ (a_|_ v b)))) = (a v (a_|_ ^ b_|_))
33	8, 32	ax-r2 35	. 2 ((((a ->3 b)_|_ ^ (b ->3 a)) v ((a ->3 b)_|_ ^ (b ->3 a)_|_)) v ((a ->3 b) ^ ((a ->3 b)_|_ v (b ->3 a)))) = (a v (a_|_ ^ b_|_))
34	1, 33	ax-r2 35	1 ((a ->3 b) ->3 (b ->3 a)) = (a v (a_|_ ^ b_|_))

Syntax hints:   = wb 1  _|_wn 4   v wo 6   ^ wa 7  1wt 9  0wf 10   ->3 wi3 15

This theorem is referenced by:  ud3 579  u3lem11a 769

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-i3 45  df-le1 122  df-le2 123  df-c1 124  df-c2 125

metamath.org