Nuprl Lemma : biject_wf
∀[A,B:Type]. ∀[f:A ⟶ B]. (Bij(A;B;f) ∈ ℙ)
Proof
Definitions occuring in Statement :
biject: Bij(A;B;f),
uall: ∀[x:A]. B[x],
prop: ℙ,
member: t ∈ T,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
biject: Bij(A;B;f),
prop: ℙ,
and: P ∧ Q
Lemmas referenced :
inject_wf,
surject_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
Error :isect_memberFormation_alt,
introduction,
cut,
sqequalRule,
productEquality,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
hypothesis,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
Error :functionIsType,
Error :universeIsType,
isect_memberEquality,
functionEquality,
Error :inhabitedIsType,
because_Cache,
universeEquality
Latex:
\mforall{}[A,B:Type]. \mforall{}[f:A {}\mrightarrow{} B]. (Bij(A;B;f) \mmember{} \mBbbP{})
Date html generated:
2019_06_20-PM-00_26_25
Last ObjectModification:
2018_09_26-AM-11_48_21
Theory : fun_1
Home
Index