Nuprl Lemma : fps-zero-slice

[X:Type]. ∀[r:CRng]. ∀[n:ℤ].  ([0]_n 0 ∈ PowerSeries(X;r))


Proof




Definitions occuring in Statement :  fps-slice: [f]_n fps-zero: 0 power-series: PowerSeries(X;r) uall: [x:A]. B[x] int: universe: Type equal: t ∈ T crng: CRng
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T uiff: uiff(P;Q) and: P ∧ Q uimplies: supposing a all: x:A. B[x] fps-zero: 0 fps-coeff: f[b] fps-slice: [f]_n subtype_rel: A ⊆B implies:  Q bool: 𝔹 unit: Unit it: btrue: tt nat: ifthenelse: if then else fi  crng: CRng rng: Rng bfalse: ff exists: x:A. B[x] prop: or: P ∨ Q sq_type: SQType(T) guard: {T} bnot: ¬bb assert: b false: False
Lemmas referenced :  fps-ext fps-slice_wf fps-zero_wf eq_int_wf bag-size_wf bool_wf eqtt_to_assert assert_of_eq_int nat_wf rng_zero_wf eqff_to_assert equal_wf bool_cases_sqequal subtype_base_sq bool_subtype_base assert-bnot neg_assert_of_eq_int bag_wf crng_wf
Rules used in proof :  sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity isect_memberFormation introduction cut extract_by_obid sqequalHypSubstitution isectElimination thin hypothesisEquality cumulativity hypothesis productElimination independent_isectElimination lambdaFormation sqequalRule applyEquality because_Cache unionElimination equalityElimination equalityTransitivity equalitySymmetry lambdaEquality setElimination rename dependent_pairFormation promote_hyp dependent_functionElimination instantiate independent_functionElimination voidElimination intEquality isect_memberEquality axiomEquality universeEquality

Latex:
\mforall{}[X:Type].  \mforall{}[r:CRng].  \mforall{}[n:\mBbbZ{}].    ([0]\_n  =  0)



Date html generated: 2018_05_21-PM-09_55_58
Last ObjectModification: 2017_07_26-PM-06_32_50

Theory : power!series


Home Index