Nuprl Lemma : Girard-theorem-extract
¬(Type ∈ Type)
Proof
Definitions occuring in Statement :
not: ¬A,
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
member: t ∈ T,
Maximal_order_type: Maximal_order_type(),
spreadn: spread4,
pi1: fst(t),
pi2: snd(t),
Girard-theorem,
DCC-order-type-less-ext,
order-type-less-maximal-ext,
max-WFTO: max-WFTO{i:l}()
Lemmas referenced :
Girard-theorem,
DCC-order-type-less-ext,
order-type-less-maximal-ext
Rules used in proof :
introduction,
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
cut,
instantiate,
extract_by_obid,
hypothesis,
sqequalRule,
thin,
sqequalHypSubstitution,
equalityTransitivity,
equalitySymmetry
Latex:
\mneg{}(Type \mmember{} Type)
Date html generated:
2018_05_21-PM-07_15_43
Last ObjectModification:
2018_05_19-PM-04_45_58
Theory : general
Home
Index