Nuprl Lemma : comb_for_mon_nat_op_wf
λg,n,e,z. (n ⋅ e) ∈ g:IMonoid ⟶ n:ℕ ⟶ e:|g| ⟶ (↓True) ⟶ |g|
Proof
Definitions occuring in Statement :
mon_nat_op: n ⋅ e,
imon: IMonoid,
grp_car: |g|,
nat: ℕ,
squash: ↓T,
true: True,
member: t ∈ T,
lambda: λx.A[x],
function: x:A ⟶ B[x]
Definitions unfolded in proof :
member: t ∈ T,
squash: ↓T,
uall: ∀[x:A]. B[x],
prop: ℙ,
imon: IMonoid
Lemmas referenced :
mon_nat_op_wf,
squash_wf,
true_wf,
grp_car_wf,
nat_wf,
imon_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaEquality,
sqequalHypSubstitution,
imageElimination,
cut,
lemma_by_obid,
isectElimination,
thin,
hypothesisEquality,
equalityTransitivity,
hypothesis,
equalitySymmetry,
setElimination,
rename
Latex:
\mlambda{}g,n,e,z. (n \mcdot{} e) \mmember{} g:IMonoid {}\mrightarrow{} n:\mBbbN{} {}\mrightarrow{} e:|g| {}\mrightarrow{} (\mdownarrow{}True) {}\mrightarrow{} |g|
Date html generated:
2016_05_15-PM-00_16_30
Last ObjectModification:
2015_12_26-PM-11_39_36
Theory : groups_1
Home
Index