Nuprl Lemma : comb_for_absval_wf
λx,z. |x| ∈ x:ℤ ⟶ (↓True) ⟶ ℕ
Proof
Definitions occuring in Statement :
absval: |i|,
nat: ℕ,
squash: ↓T,
true: True,
member: t ∈ T,
lambda: λx.A[x],
function: x:A ⟶ B[x],
int: ℤ
Definitions unfolded in proof :
member: t ∈ T,
squash: ↓T,
uall: ∀[x:A]. B[x],
prop: ℙ
Lemmas referenced :
absval_wf,
squash_wf,
true_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
Error :lambdaEquality_alt,
sqequalHypSubstitution,
imageElimination,
cut,
introduction,
extract_by_obid,
isectElimination,
thin,
hypothesisEquality,
equalityTransitivity,
hypothesis,
equalitySymmetry,
Error :universeIsType,
intEquality
Latex:
\mlambda{}x,z. |x| \mmember{} x:\mBbbZ{} {}\mrightarrow{} (\mdownarrow{}True) {}\mrightarrow{} \mBbbN{}
Date html generated:
2019_06_20-AM-11_24_27
Last ObjectModification:
2018_09_28-PM-00_55_14
Theory : arithmetic
Home
Index