Nuprl Lemma : or_assoc
∀[A,B,C:ℙ]. (A ∨ B ∨ C ⇐⇒ (A ∨ B) ∨ C)
Proof
Definitions occuring in Statement :
uall: ∀[x:A]. B[x],
prop: ℙ,
iff: P ⇐⇒ Q,
or: P ∨ Q
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
iff: P ⇐⇒ Q,
and: P ∧ Q,
implies: P ⇒ Q,
or: P ∨ Q,
member: t ∈ T,
prop: ℙ,
guard: {T},
rev_implies: P ⇐ Q
Lemmas referenced :
or_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
Error :isect_memberFormation_alt,
independent_pairFormation,
lambdaFormation,
sqequalHypSubstitution,
unionElimination,
thin,
inlFormation,
hypothesis,
hypothesisEquality,
sqequalRule,
cut,
inrFormation,
introduction,
extract_by_obid,
isectElimination,
because_Cache,
Error :inhabitedIsType,
Error :universeIsType,
universeEquality
Latex:
\mforall{}[A,B,C:\mBbbP{}]. (A \mvee{} B \mvee{} C \mLeftarrow{}{}\mRightarrow{} (A \mvee{} B) \mvee{} C)
Date html generated:
2019_06_20-AM-11_15_59
Last ObjectModification:
2018_09_26-AM-10_23_52
Theory : core_2
Home
Index