Nuprl Lemma : guarded_permutation_wf
∀[T:Type]. ∀[P:L:(T List) ⟶ ℕ||L|| - 1 ⟶ ℙ]. (guarded_permutation(T;P) ∈ (T List) ⟶ (T List) ⟶ ℙ)
Proof
Definitions occuring in Statement :
guarded_permutation: guarded_permutation(T;P),
length: ||as||,
list: T List,
int_seg: {i..j-},
uall: ∀[x:A]. B[x],
prop: ℙ,
member: t ∈ T,
function: x:A ⟶ B[x],
subtract: n - m,
natural_number: $n,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
guarded_permutation: guarded_permutation(T;P),
so_lambda: λ2x.t[x],
prop: ℙ,
and: P ∧ Q,
subtype_rel: A ⊆r B,
int_seg: {i..j-},
lelt: i ≤ j < k,
all: ∀x:A. B[x],
decidable: Dec(P),
or: P ∨ Q,
false: False,
less_than: a < b,
squash: ↓T,
uiff: uiff(P;Q),
uimplies: b supposing a,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
implies: P ⇒ Q,
not: ¬A,
top: Top,
subtract: n - m,
so_apply: x[s]
Lemmas referenced :
rel_star_wf,
list_wf,
exists_wf,
int_seg_wf,
subtract_wf,
length_wf,
equal_wf,
swap_wf,
decidable__lt,
subtract-is-int-iff,
satisfiable-full-omega-tt,
intformand_wf,
intformnot_wf,
intformless_wf,
itermVar_wf,
itermSubtract_wf,
itermConstant_wf,
int_formula_prop_and_lemma,
int_formula_prop_not_lemma,
int_formula_prop_less_lemma,
int_term_value_var_lemma,
int_term_value_subtract_lemma,
int_term_value_constant_lemma,
int_formula_prop_wf,
false_wf,
lelt_wf,
add-member-int_seg2,
decidable__le,
intformle_wf,
int_formula_prop_le_lemma
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
cumulativity,
hypothesisEquality,
hypothesis,
lambdaEquality,
natural_numberEquality,
because_Cache,
productEquality,
applyEquality,
functionExtensionality,
setElimination,
rename,
dependent_set_memberEquality,
productElimination,
independent_pairFormation,
dependent_functionElimination,
unionElimination,
pointwiseFunctionality,
equalityTransitivity,
equalitySymmetry,
promote_hyp,
imageElimination,
baseApply,
closedConclusion,
baseClosed,
independent_isectElimination,
dependent_pairFormation,
int_eqEquality,
intEquality,
isect_memberEquality,
voidElimination,
voidEquality,
computeAll,
axiomEquality,
functionEquality,
universeEquality
Latex:
\mforall{}[T:Type]. \mforall{}[P:L:(T List) {}\mrightarrow{} \mBbbN{}||L|| - 1 {}\mrightarrow{} \mBbbP{}].
(guarded\_permutation(T;P) \mmember{} (T List) {}\mrightarrow{} (T List) {}\mrightarrow{} \mBbbP{})
Date html generated:
2017_10_01-AM-08_38_32
Last ObjectModification:
2017_07_26-PM-04_27_03
Theory : list!
Home
Index