Nuprl Lemma : dlattice-order-free-dl-meet

X:Type. ∀a1,b1,as,b2:X List List.  (a1  b1  as  b2  free-dl-meet(a1;as)  free-dl-meet(b1;b2))


Proof




Definitions occuring in Statement :  free-dl-meet: free-dl-meet(as;bs) dlattice-order: as  bs list: List all: x:A. B[x] implies:  Q universe: Type
Definitions unfolded in proof :  all: x:A. B[x] implies:  Q dlattice-order: as  bs member: t ∈ T prop: uall: [x:A]. B[x] so_lambda: λ2x.t[x] so_apply: x[s] iff: ⇐⇒ Q and: P ∧ Q rev_implies:  Q exists: x:A. B[x] cand: c∧ B squash: T true: True subtype_rel: A ⊆B uimplies: supposing a guard: {T} l_subset: l_subset(T;as;bs) or: P ∨ Q
Lemmas referenced :  dlattice-order_wf list_wf l_all_iff l_exists_wf l_contains_wf l_member_wf free-dl-meet_wf_list l_exists_iff exists_wf equal_wf append_wf member-free-dl-meet all_wf squash_wf true_wf iff_weakening_equal l_subset-l_contains l_subset_wf l_subset_append member_append
Rules used in proof :  sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity lambdaFormation sqequalHypSubstitution cut introduction extract_by_obid isectElimination thin cumulativity hypothesisEquality hypothesis universeEquality dependent_functionElimination sqequalRule lambdaEquality setElimination rename setEquality productElimination independent_functionElimination allFunctionality because_Cache promote_hyp productEquality addLevel impliesFunctionality existsFunctionality independent_pairFormation andLevelFunctionality functionEquality dependent_pairFormation applyEquality imageElimination equalityTransitivity equalitySymmetry natural_numberEquality imageMemberEquality baseClosed independent_isectElimination inlFormation inrFormation

Latex:
\mforall{}X:Type.  \mforall{}a1,b1,as,b2:X  List  List.
    (a1  {}\mRightarrow{}  b1  {}\mRightarrow{}  as  {}\mRightarrow{}  b2  {}\mRightarrow{}  free-dl-meet(a1;as)  {}\mRightarrow{}  free-dl-meet(b1;b2))



Date html generated: 2020_05_20-AM-08_27_03
Last ObjectModification: 2017_07_28-AM-09_13_25

Theory : lattices


Home Index