Nuprl Lemma : lifting-strict-atom_eq1
∀[F:Base]. ∀[p,q,r:Top].
∀[a,b,c,d:Top]. (F[if a=1 b then c else d;p;q;r] ~ if a=1 b then F[c;p;q;r] else F[d;p;q;r])
supposing strict4(λx,y,z,w. F[x;y;z;w])
Proof
Definitions occuring in Statement :
strict4: strict4(F),
atom_eq: atomeqn def,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
top: Top,
so_apply: x[s1;s2;s3;s4],
lambda: λx.A[x],
base: Base,
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
strict4: strict4(F),
and: P ∧ Q,
cand: A c∧ B,
all: ∀x:A. B[x],
implies: P ⇒ Q,
has-value: (a)↓,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
bfalse: ff,
exists: ∃x:A. B[x],
prop: ℙ,
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
ifthenelse: if b then t else f fi ,
assert: ↑b,
false: False,
iff: P ⇐⇒ Q,
not: ¬A,
rev_implies: P ⇐ Q,
squash: ↓T
Lemmas referenced :
eq_atom_wf1,
bool_wf,
eqtt_to_assert,
assert_of_eq_atom1,
has-value_wf_base,
is-exception_wf,
eqff_to_assert,
equal_wf,
bool_cases_sqequal,
subtype_base_sq,
bool_subtype_base,
iff_transitivity,
assert_wf,
bnot_wf,
not_wf,
equal-wf-base,
iff_weakening_uiff,
assert_of_bnot,
top_wf,
strict4_wf,
base_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalSqle,
sqleRule,
thin,
divergentSqle,
sqequalHypSubstitution,
sqequalRule,
productElimination,
hypothesis,
dependent_functionElimination,
baseApply,
closedConclusion,
baseClosed,
hypothesisEquality,
independent_functionElimination,
callbyvalueAtomnEq,
extract_by_obid,
isectElimination,
lambdaFormation,
unionElimination,
equalityElimination,
because_Cache,
independent_isectElimination,
equalityTransitivity,
equalitySymmetry,
atomn_eqReduceTrueSq,
sqleReflexivity,
dependent_pairFormation,
promote_hyp,
instantiate,
cumulativity,
voidElimination,
atomnEquality,
independent_pairFormation,
impliesFunctionality,
atomn_eqReduceFalseSq,
imageElimination,
axiomSqleEquality,
atom1_eqExceptionCases,
exceptionSqequal,
sqequalAxiom,
isect_memberEquality,
exceptionAtomeq1
Latex:
\mforall{}[F:Base]. \mforall{}[p,q,r:Top].
\mforall{}[a,b,c,d:Top]. (F[if a=1 b then c else d;p;q;r] \msim{} if a=1 b then F[c;p;q;r] else F[d;p;q;r])
supposing strict4(\mlambda{}x,y,z,w. F[x;y;z;w])
Date html generated:
2017_04_14-AM-07_20_49
Last ObjectModification:
2017_02_27-PM-02_54_26
Theory : computation
Home
Index