Nuprl Lemma : Konig_wf

[k:ℕ]. (Konig(k) ∈ ℙ)


Proof




Definitions occuring in Statement :  Konig: Konig(k) nat: uall: [x:A]. B[x] prop: member: t ∈ T
Definitions unfolded in proof :  Konig: Konig(k) uall: [x:A]. B[x] member: t ∈ T nat: so_lambda: λ2x.t[x] implies:  Q prop: subtype_rel: A ⊆B so_apply: x[s] uimplies: supposing a and: P ∧ Q le: A ≤ B less_than': less_than'(a;b) false: False not: ¬A all: x:A. B[x] exists: x:A. B[x]
Lemmas referenced :  all_wf nat_wf int_seg_wf bool_wf le_wf assert_wf subtype_rel_dep_function int_seg_subtype false_wf subtype_rel_self not_wf exists_wf int_seg_subtype_nat
Rules used in proof :  sqequalSubstitution sqequalRule sqequalReflexivity sqequalTransitivity computationStep isect_memberFormation introduction cut lemma_by_obid sqequalHypSubstitution isectElimination thin functionEquality productEquality hypothesis natural_numberEquality setElimination rename hypothesisEquality because_Cache lambdaEquality applyEquality dependent_pairEquality independent_isectElimination independent_pairFormation lambdaFormation axiomEquality equalityTransitivity equalitySymmetry

Latex:
\mforall{}[k:\mBbbN{}].  (Konig(k)  \mmember{}  \mBbbP{})



Date html generated: 2016_05_15-PM-11_50_04
Last ObjectModification: 2015_12_28-PM-07_14_52

Theory : randomness


Home Index