Theorem u3lem14aa 792

Description: Used to prove →₁ "add antecedent" rule in →₃ system. (Contributed by NM, 19-Jan-1998.)

Assertion

Ref	Expression
u3lem14aa	(a →3 (a →3 ((b →3 a⊥ ) →3 b⊥ ))) = 1

Proof of Theorem u3lem14aa

Step	Hyp	Ref	Expression
1		u3lem14a 791	. . 3 (a →3 ((b →3 a⊥ ) →3 b⊥ )) = (a →3 (b →3 a))
2	1	ud3lem0a 260	. 2 (a →3 (a →3 ((b →3 a⊥ ) →3 b⊥ ))) = (a →3 (a →3 (b →3 a)))
3		i3th1 543	. 2 (a →3 (a →3 (b →3 a))) = 1
4	2, 3	ax-r2 36	1 (a →3 (a →3 ((b →3 a⊥ ) →3 b⊥ ))) = 1

Syntax hints:   = wb 1  ^⊥ wn 4  1wt 8   →₃ wi3 14

This theorem was proved from 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 theorem depends on definitions:  df-b 39  df-a 40  df-t 41  df-f 42  df-i1 44  df-i3 46  df-le1 130  df-le2 131  df-c1 132  df-c2 133

This theorem is referenced by:  u3lem14aa2  793