Theorem u3lem14mp 776

Description: Used to prove ->1 modus ponens rule in ->3 system.

Assertion

Ref	Expression
u3lem14mp	((a ->3 b_|_)_|_ ->3 (a ->3 (a ->3 b))) = 1

Proof of Theorem u3lem14mp

Step	Hyp	Ref	Expression
1		lear 153	. . . 4 (((a v b_|__|_) ^ (a v b_|_)) ^ (a_|_ v (a ^ b_|__|_))) =< (a_|_ v (a ^ b_|__|_))
2		lear 153	. . . . . 6 (a ^ b_|__|_) =< b_|__|_
3		ax-a1 29	. . . . . . 7 b = b_|__|_
4	3	ax-r1 34	. . . . . 6 b_|__|_ = b
5	2, 4	lbtr 131	. . . . 5 (a ^ b_|__|_) =< b
6	5	lelor 158	. . . 4 (a_|_ v (a ^ b_|__|_)) =< (a_|_ v b)
7	1, 6	letr 129	. . 3 (((a v b_|__|_) ^ (a v b_|_)) ^ (a_|_ v (a ^ b_|__|_))) =< (a_|_ v b)
8		ud3lem0c 271	. . 3 (a ->3 b_|_)_|_ = (((a v b_|__|_) ^ (a v b_|_)) ^ (a_|_ v (a ^ b_|__|_)))
9		u3lem5 745	. . 3 (a ->3 (a ->3 b)) = (a_|_ v b)
10	7, 8, 9	le3tr1 132	. 2 (a ->3 b_|_)_|_ =< (a ->3 (a ->3 b))
11	10	u3lemle1 694	1 ((a ->3 b_|_)_|_ ->3 (a ->3 (a ->3 b))) = 1

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

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