Theorem u4lem3n 737

Description: Lemma for unified implication study.

Assertion

Ref	Expression
u4lem3n	(a ->4 (b ->4 a))_|_ = (a ^ ((a_|_ v b) ^ (a_|_ v b_|_)))

Proof of Theorem u4lem3n

Step	Hyp	Ref	Expression
1		u4lem3 734	. . 3 (a ->4 (b ->4 a)) = (a_|_ v ((a ^ b) v (a ^ b_|_)))
2		ax-a2 30	. . . . . 6 ((a ^ b) v (a ^ b_|_)) = ((a ^ b_|_) v (a ^ b))
3		anor1 80	. . . . . . . 8 (a ^ b_|_) = (a_|_ v b)_|_
4		df-a 39	. . . . . . . 8 (a ^ b) = (a_|_ v b_|_)_|_
5	3, 4	2or 67	. . . . . . 7 ((a ^ b_|_) v (a ^ b)) = ((a_|_ v b)_|_ v (a_|_ v b_|_)_|_)
6		oran3 85	. . . . . . 7 ((a_|_ v b)_|_ v (a_|_ v b_|_)_|_) = ((a_|_ v b) ^ (a_|_ v b_|_))_|_
7	5, 6	ax-r2 35	. . . . . 6 ((a ^ b_|_) v (a ^ b)) = ((a_|_ v b) ^ (a_|_ v b_|_))_|_
8	2, 7	ax-r2 35	. . . . 5 ((a ^ b) v (a ^ b_|_)) = ((a_|_ v b) ^ (a_|_ v b_|_))_|_
9	8	lor 66	. . . 4 (a_|_ v ((a ^ b) v (a ^ b_|_))) = (a_|_ v ((a_|_ v b) ^ (a_|_ v b_|_))_|_)
10		oran3 85	. . . 4 (a_|_ v ((a_|_ v b) ^ (a_|_ v b_|_))_|_) = (a ^ ((a_|_ v b) ^ (a_|_ v b_|_)))_|_
11	9, 10	ax-r2 35	. . 3 (a_|_ v ((a ^ b) v (a ^ b_|_))) = (a ^ ((a_|_ v b) ^ (a_|_ v b_|_)))_|_
12	1, 11	ax-r2 35	. 2 (a ->4 (b ->4 a)) = (a ^ ((a_|_ v b) ^ (a_|_ v b_|_)))_|_
13	12	con2 64	1 (a ->4 (b ->4 a))_|_ = (a ^ ((a_|_ v b) ^ (a_|_ v b_|_)))

Syntax hints:   = wb 1  _|_wn 4   v wo 6   ^ wa 7   ->4 wi4 16

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

metamath.org