Theorem bina5 278

Description: Pavicic binary logic ax-a5 analog.

Assertion

Ref	Expression
bina5	(b →3 (a ∪ a⊥ )) = 1

Proof of Theorem bina5

Step	Hyp	Ref	Expression
1		le1 138	. . 3 b ≤ 1
2		df-t 40	. . 3 1 = (a ∪ a⊥ )
3	1, 2	lbtr 131	. 2 b ≤ (a ∪ a⊥ )
4	3	lei3 238	1 (b →3 (a ∪ a⊥ )) = 1

Syntax hints:   = wb 1  ^⊥ wn 4   ∪ wo 6  1wt 9   →₃ 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

This theorem depends on definitions:  df-a 39  df-t 40  df-f 41  df-i3 45  df-le1 122  df-le2 123

metamath.org