[Lattice L46-7]Home PageHome Quantum Logic Explorer < Previous   Next >
Related theorems
Unicode version

Theorem wle1 371
Description: Anything is l.e. 1.
Assertion
Ref Expression
wle1 (a =<2 1) = 1

Proof of Theorem wle1
StepHypRef Expression
1 or1 96 . . 3 (a v 1) = 1
21bi1 110 . 2 ((a v 1) == 1) = 1
32wdf-le1 360 1 (a =<2 1) = 1
Colors of variables: term
Syntax hints:   = wb 1   v wo 6  1wt 9   =<2 wle2 11
This theorem was proved from axioms:  ax-a1 29  ax-a2 30  ax-a4 32  ax-a5 33  ax-r1 34  ax-r2 35  ax-r4 36  ax-r5 37
This theorem depends on definitions:  df-b 38  df-a 39  df-t 40  df-f 41  df-le 121
metamath.org