### Nuprl Lemma : ni-max-identity

`∀[x:ℕ∞]. (ni-max(x;∞) = ∞ ∈ ℕ∞)`

Proof

Definitions occuring in Statement :  ni-max: `ni-max(f;g)` nat-inf-infinity: `∞` nat-inf: `ℕ∞` uall: `∀[x:A]. B[x]` equal: `s = t ∈ T`
Definitions unfolded in proof :  uall: `∀[x:A]. B[x]` member: `t ∈ T` nat-inf: `ℕ∞` squash: `↓T` so_lambda: `λ2x.t[x]` implies: `P `` Q` prop: `ℙ` nat: `ℕ` ge: `i ≥ j ` all: `∀x:A. B[x]` decidable: `Dec(P)` or: `P ∨ Q` uimplies: `b supposing a` satisfiable_int_formula: `satisfiable_int_formula(fmla)` exists: `∃x:A. B[x]` false: `False` not: `¬A` top: `Top` and: `P ∧ Q` so_apply: `x[s]` nat-inf-infinity: `∞` ni-max: `ni-max(f;g)` bool: `𝔹` unit: `Unit` it: `⋅` btrue: `tt` uiff: `uiff(P;Q)` bor: `p ∨bq` ifthenelse: `if b then t else f fi ` bfalse: `ff` sq_type: `SQType(T)` guard: `{T}` bnot: `¬bb` assert: `↑b`
Lemmas referenced :  ni-max_wf nat-inf-infinity_wf all_wf nat_wf assert_wf nat_properties decidable__le satisfiable-full-omega-tt intformand_wf intformnot_wf intformle_wf itermConstant_wf itermAdd_wf itermVar_wf int_formula_prop_and_lemma int_formula_prop_not_lemma int_formula_prop_le_lemma int_term_value_constant_lemma int_term_value_add_lemma int_term_value_var_lemma int_formula_prop_wf le_wf nat-inf_wf bool_wf eqtt_to_assert btrue_wf eqff_to_assert equal_wf bool_cases_sqequal subtype_base_sq bool_subtype_base assert-bnot
Rules used in proof :  sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity isect_memberFormation cut introduction extract_by_obid sqequalHypSubstitution isectElimination thin hypothesisEquality hypothesis applyLambdaEquality setElimination rename sqequalRule imageMemberEquality baseClosed imageElimination dependent_set_memberEquality lambdaEquality functionEquality applyEquality functionExtensionality addEquality natural_numberEquality dependent_functionElimination unionElimination independent_isectElimination dependent_pairFormation int_eqEquality intEquality isect_memberEquality voidElimination voidEquality independent_pairFormation computeAll because_Cache lambdaFormation equalityElimination equalityTransitivity equalitySymmetry productElimination promote_hyp instantiate cumulativity independent_functionElimination

Latex:
\mforall{}[x:\mBbbN{}\minfty{}].  (ni-max(x;\minfty{})  =  \minfty{})

Date html generated: 2017_10_01-AM-08_29_54
Last ObjectModification: 2017_07_26-PM-04_24_13

Theory : basic

Home Index