Nuprl Lemma : l_disjoint_append2
∀[T:Type]. ∀[a,b,c:T List]. uiff(l_disjoint(T;b @ c;a);l_disjoint(T;b;a) ∧ l_disjoint(T;c;a))
Proof
Definitions occuring in Statement :
l_disjoint: l_disjoint(T;l1;l2),
append: as @ bs,
list: T List,
uiff: uiff(P;Q),
uall: ∀[x:A]. B[x],
and: P ∧ Q,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
l_disjoint: l_disjoint(T;l1;l2),
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
member: t ∈ T,
all: ∀x:A. B[x],
not: ¬A,
implies: P ⇒ Q,
false: False,
cand: A c∧ B,
or: P ∨ Q,
prop: ℙ,
guard: {T},
so_lambda: λ2x.t[x],
so_apply: x[s],
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q
Lemmas referenced :
l_member_wf,
all_wf,
not_wf,
or_wf,
member_append,
append_wf,
uiff_wf,
list_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
cut,
independent_pairFormation,
introduction,
lambdaFormation,
thin,
hypothesis,
sqequalHypSubstitution,
dependent_functionElimination,
hypothesisEquality,
productElimination,
independent_functionElimination,
inlFormation,
extract_by_obid,
isectElimination,
productEquality,
voidElimination,
because_Cache,
sqequalRule,
inrFormation,
independent_pairEquality,
lambdaEquality,
addLevel,
independent_isectElimination,
cumulativity,
universeEquality,
unionElimination
Latex:
\mforall{}[T:Type]. \mforall{}[a,b,c:T List]. uiff(l\_disjoint(T;b @ c;a);l\_disjoint(T;b;a) \mwedge{} l\_disjoint(T;c;a))
Date html generated:
2019_06_20-PM-01_27_12
Last ObjectModification:
2018_08_24-PM-11_25_43
Theory : list_1
Home
Index