∀ n m, (leb n m) = true ⇒ n ≤ m

Theorem leb_true_to_le : forall (n:nat), forall (m:nat), (logic.eq (bool.bool) (leb n m) bool.true) -> le n m.

theorem leb_true_to_le : \forall (n:nat). \forall (m:nat). ((eq) (bool) ((leb) n m) (true) ) -> (le) n m.

theorem leb_true_to_le : forall (n:nat.nat) , forall (m:nat.nat) , ((((logic.eq_) (bool.bool)) ((((nat.leb) ) (n)) (m))) ((bool.true) )) -> (((nat.le_) ) (n)) (m).

leb_true_to_le : LEMMA (FORALL(n:nat_sttfa.sttfa_nat):(FORALL(m:nat_sttfa.sttfa_nat):(logic_sttfa_th.eq[bool_sttfa_th.sttfa_bool](nat_sttfa.leb(n)(m))(bool_sttfa_th.sttfa_true) => nat_sttfa.le(n)(m))))

Printing for OpenTheory is not working at the moment.