Nuprl Lemma : fpf-cap-subtype_functionality_wrt_sub

[A:Type]. ∀[d1,d2,d4:EqDecider(A)]. ∀[f,g:a:A fp-> Type]. ∀[x:A].  {g(x)?Top ⊆f(x)?Top supposing f ⊆ g}


Proof




Definitions occuring in Statement :  fpf-sub: f ⊆ g fpf-cap: f(x)?z fpf: a:A fp-> B[a] deq: EqDecider(T) uimplies: supposing a subtype_rel: A ⊆B uall: [x:A]. B[x] top: Top guard: {T} universe: Type
Definitions unfolded in proof :  guard: {T} uall: [x:A]. B[x] member: t ∈ T uimplies: supposing a all: x:A. B[x] subtype_rel: A ⊆B so_lambda: λ2x.t[x] so_apply: x[s] top: Top decidable: Dec(P) or: P ∨ Q prop: fpf-cap: f(x)?z implies:  Q bool: 𝔹 unit: Unit it: btrue: tt uiff: uiff(P;Q) and: P ∧ Q ifthenelse: if then else fi  bfalse: ff not: ¬A false: False
Lemmas referenced :  decidable__assert fpf-dom_wf subtype-fpf2 top_wf fpf-sub_wf fpf_wf deq_wf subtype_rel_self fpf-cap_wf subtype_rel_wf fpf-cap_functionality_wrt_sub bool_wf equal-wf-T-base assert_wf bnot_wf not_wf eqtt_to_assert uiff_transitivity eqff_to_assert assert_of_bnot equal_wf fpf-dom_functionality2
Rules used in proof :  sqequalSubstitution sqequalRule sqequalReflexivity sqequalTransitivity computationStep isect_memberFormation introduction cut extract_by_obid sqequalHypSubstitution dependent_functionElimination thin isectElimination cumulativity hypothesisEquality applyEquality instantiate because_Cache lambdaEquality universeEquality hypothesis independent_isectElimination lambdaFormation isect_memberEquality voidElimination voidEquality unionElimination axiomEquality equalityTransitivity equalitySymmetry hyp_replacement applyLambdaEquality baseClosed equalityElimination productElimination independent_functionElimination

Latex:
\mforall{}[A:Type].  \mforall{}[d1,d2,d4:EqDecider(A)].  \mforall{}[f,g:a:A  fp->  Type].  \mforall{}[x:A].
    \{g(x)?Top  \msubseteq{}r  f(x)?Top  supposing  f  \msubseteq{}  g\}



Date html generated: 2018_05_21-PM-09_19_42
Last ObjectModification: 2018_02_09-AM-10_17_41

Theory : finite!partial!functions


Home Index