Nuprl Lemma : lmax_assoc
∀s:DSet. ∀as,bs,cs:|s| List.  (lmax(s;as;lmax(s;bs;cs)) ≡(|s|) lmax(s;lmax(s;as;bs);cs))
Proof
Definitions occuring in Statement : 
lmax: lmax(s;as;bs)
, 
permr: as ≡(T) bs
, 
list: T List
, 
all: ∀x:A. B[x]
, 
dset: DSet
, 
set_car: |p|
Definitions unfolded in proof : 
all: ∀x:A. B[x]
, 
member: t ∈ T
, 
iff: P 
⇐⇒ Q
, 
and: P ∧ Q
, 
rev_implies: P 
⇐ Q
, 
implies: P 
⇒ Q
, 
uall: ∀[x:A]. B[x]
, 
dset: DSet
, 
true: True
, 
squash: ↓T
, 
prop: ℙ
, 
subtype_rel: A ⊆r B
, 
uimplies: b supposing a
, 
guard: {T}
Lemmas referenced : 
permr_iff_eq_counts, 
lmax_wf, 
set_car_wf, 
list_wf, 
dset_wf, 
count_wf, 
imax_assoc, 
equal_wf, 
squash_wf, 
true_wf, 
istype-universe, 
count_lmax, 
subtype_rel_self, 
imax_wf, 
istype-int, 
iff_weakening_equal
Rules used in proof : 
sqequalSubstitution, 
sqequalTransitivity, 
computationStep, 
sqequalReflexivity, 
lambdaFormation_alt, 
cut, 
introduction, 
extract_by_obid, 
sqequalHypSubstitution, 
dependent_functionElimination, 
thin, 
hypothesisEquality, 
hypothesis, 
productElimination, 
independent_functionElimination, 
universeIsType, 
isectElimination, 
setElimination, 
rename, 
inhabitedIsType, 
intEquality, 
natural_numberEquality, 
because_Cache, 
applyEquality, 
lambdaEquality_alt, 
imageElimination, 
equalityTransitivity, 
equalitySymmetry, 
universeEquality, 
sqequalRule, 
imageMemberEquality, 
baseClosed, 
instantiate, 
independent_isectElimination
Latex:
\mforall{}s:DSet.  \mforall{}as,bs,cs:|s|  List.    (lmax(s;as;lmax(s;bs;cs))  \mequiv{}(|s|)  lmax(s;lmax(s;as;bs);cs))
Date html generated:
2019_10_16-PM-01_04_55
Last ObjectModification:
2018_10_08-AM-10_24_57
Theory : list_2
Home
Index