Nuprl Lemma : per-quotient-isect-base
∀[T:Type]. ∀[E:T ⟶ T ⟶ ℙ]. x,y:T/per/E[x;y] ⋂ Base ≡ T ⋂ Base supposing EquivRel(T;x,y.E[x;y])
Proof
Definitions occuring in Statement :
per-quotient: x,y:T/per/E[x; y],
equiv_rel: EquivRel(T;x,y.E[x; y]),
isect2: T1 ⋂ T2,
ext-eq: A ≡ B,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
prop: ℙ,
so_apply: x[s1;s2],
function: x:A ⟶ B[x],
base: Base,
universe: Type
Definitions unfolded in proof :
per-quotient: x,y:T/per/E[x; y],
quotient: x,y:A//B[x; y]
Lemmas referenced :
quotient-isect-base
Rules used in proof :
cut,
introduction,
extract_by_obid,
sqequalRule,
sqequalReflexivity,
sqequalSubstitution,
sqequalTransitivity,
computationStep,
hypothesis
Latex:
\mforall{}[T:Type]. \mforall{}[E:T {}\mrightarrow{} T {}\mrightarrow{} \mBbbP{}]. x,y:T/per/E[x;y] \mcap{} Base \mequiv{} T \mcap{} Base supposing EquivRel(T;x,y.E[x;y])
Date html generated:
2019_06_20-PM-00_33_35
Last ObjectModification:
2018_08_21-PM-10_54_13
Theory : per-quotient
Home
Index