Nuprl Lemma : unsquashed-weak-continuity-false
¬unsquashed-WCP
Proof
Definitions occuring in Statement :
unsquashed-WCP: unsquashed-WCP,
not: ¬A
Definitions unfolded in proof :
so_apply: x[s],
so_lambda: λ2x.t[x],
rev_implies: P ⇐ Q,
iff: P ⇐⇒ Q,
guard: {T},
uimplies: b supposing a,
true: True,
subtype_rel: A ⊆r B,
squash: ↓T,
uall: ∀[x:A]. B[x],
less_than': less_than'(a;b),
and: P ∧ Q,
le: A ≤ B,
nat: ℕ,
exists: ∃x:A. B[x],
unsquashed-WCP: unsquashed-WCP,
all: ∀x:A. B[x],
prop: ℙ,
false: False,
member: t ∈ T,
implies: P ⇒ Q,
not: ¬A
Lemmas referenced :
int_seg_subtype_nat,
equal-wf-T-base,
all_wf,
int_seg_wf,
iff_weakening_equal,
equal_wf,
nat_wf,
le_wf,
false_wf,
unsquashed-WCP_wf,
Escardo-Xu
Rules used in proof :
rename,
setElimination,
independent_isectElimination,
equalitySymmetry,
equalityTransitivity,
baseClosed,
imageMemberEquality,
intEquality,
imageElimination,
because_Cache,
functionEquality,
functionExtensionality,
applyEquality,
dependent_pairFormation,
isectElimination,
independent_pairFormation,
sqequalRule,
natural_numberEquality,
dependent_set_memberEquality,
lambdaEquality,
productElimination,
hypothesisEquality,
dependent_functionElimination,
hypothesis,
voidElimination,
thin,
independent_functionElimination,
sqequalHypSubstitution,
lambdaFormation,
sqequalReflexivity,
computationStep,
sqequalTransitivity,
sqequalSubstitution,
extract_by_obid,
introduction,
cut
Latex:
\mneg{}unsquashed-WCP
Date html generated:
2017_09_29-PM-06_05_03
Last ObjectModification:
2017_09_22-PM-04_48_01
Theory : fan-theorem
Home
Index