Nuprl Lemma : order-type-less-maximal-ext
∀x:WFTRO{i:l}(). (x order-type-less() max-WO{i:l}())
Proof
Definitions occuring in Statement :
max-WO: max-WO{i:l}(),
WFTRO: WFTRO{i:l}(),
order-type-less: order-type-less(),
infix_ap: x f y,
all: ∀x:A. B[x]
Definitions unfolded in proof :
member: t ∈ T,
infix_ap: x f y,
pi1: fst(t),
spreadn: spread4,
pi2: snd(t),
Maximal_order_type: Maximal_order_type(),
order-type-less-maximal
Lemmas referenced :
order-type-less-maximal
Rules used in proof :
introduction,
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
cut,
instantiate,
extract_by_obid,
hypothesis,
sqequalRule,
thin,
sqequalHypSubstitution,
equalityTransitivity,
equalitySymmetry
Latex:
\mforall{}x:WFTRO\{i:l\}(). (x order-type-less() max-WO\{i:l\}())
Date html generated:
2018_05_21-PM-07_15_19
Last ObjectModification:
2018_05_18-AM-08_15_18
Theory : general
Home
Index