Theorem bina3 276

Description: Pavicic binary logic ax-a3 analog.

Assertion

Ref	Expression
bina3	(a →3 (a ∪ b)) = 1

Proof of Theorem bina3

Step	Hyp	Ref	Expression
1		leo 150	. 2 a ≤ (a ∪ b)
2	1	lei3 238	1 (a →3 (a ∪ b)) = 1

Syntax hints:   = wb 1   ∪ wo 6  1wt 9   →₃ wi3 15

This theorem is referenced by:  i31 502  i3ror 514  i3th3 527

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