∀ A B, A ∧ B ⇒ A

Theorem proj1 : forall (A:Prop), forall (B:Prop), (connectives.And A B) -> A.

theorem proj1 : \forall (A:Prop). \forall (B:Prop). ((And) A B) -> A.

theorem proj1 : forall (A:Prop) , forall (B:Prop) , ((((connectives.And) ) (A)) (B)) -> A.

proj1 : LEMMA (FORALL(A:bool):(FORALL(B:bool):(connectives_sttfa_th.sttfa_And(A)(B) => A)))

Printing for OpenTheory is not working at the moment.