Nuprl Lemma : and_comm
∀[A,B:ℙ]. (A ∧ B ⇐⇒ B ∧ A)
Proof
Definitions occuring in Statement :
uall: ∀[x:A]. B[x],
prop: ℙ,
iff: P ⇐⇒ Q,
and: P ∧ Q
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
iff: P ⇐⇒ Q,
and: P ∧ Q,
implies: P ⇒ Q,
member: t ∈ T,
prop: ℙ,
rev_implies: P ⇐ Q
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
Error :isect_memberFormation_alt,
independent_pairFormation,
lambdaFormation,
sqequalHypSubstitution,
productElimination,
thin,
hypothesis,
productEquality,
cumulativity,
hypothesisEquality,
Error :inhabitedIsType,
Error :universeIsType,
universeEquality
Latex:
\mforall{}[A,B:\mBbbP{}]. (A \mwedge{} B \mLeftarrow{}{}\mRightarrow{} B \mwedge{} A)
Date html generated:
2019_06_20-AM-11_15_57
Last ObjectModification:
2018_09_26-AM-10_23_54
Theory : core_2
Home
Index