Nuprl Lemma : names-hom_wf
∀[I,J:fset(ℕ)]. (I ⟶ J ∈ Type)
Proof
Definitions occuring in Statement :
names-hom: I ⟶ J,
fset: fset(T),
nat: ℕ,
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
names-hom: I ⟶ J,
subtype_rel: A ⊆r B,
DeMorgan-algebra: DeMorganAlgebra,
so_lambda: λ2x.t[x],
prop: ℙ,
and: P ∧ Q,
guard: {T},
uimplies: b supposing a,
so_apply: x[s]
Lemmas referenced :
names_wf,
lattice-point_wf,
dM_wf,
subtype_rel_set,
DeMorgan-algebra-structure_wf,
lattice-structure_wf,
lattice-axioms_wf,
bounded-lattice-structure-subtype,
DeMorgan-algebra-structure-subtype,
subtype_rel_transitivity,
bounded-lattice-structure_wf,
bounded-lattice-axioms_wf,
uall_wf,
equal_wf,
lattice-meet_wf,
lattice-join_wf,
DeMorgan-algebra-axioms_wf,
fset_wf,
nat_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
functionEquality,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
hypothesis,
applyEquality,
instantiate,
lambdaEquality,
productEquality,
independent_isectElimination,
cumulativity,
universeEquality,
because_Cache,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
isect_memberEquality
Latex:
\mforall{}[I,J:fset(\mBbbN{})]. (I {}\mrightarrow{} J \mmember{} Type)
Date html generated:
2016_05_18-AM-11_57_43
Last ObjectModification:
2015_12_28-PM-03_08_15
Theory : cubical!type!theory
Home
Index