sticksstones14 - Mathbox for metakunt

	Mathbox for metakunt		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > sticksstones14		Structured version Visualization version GIF version

Theorem sticksstones14 42955

Description: Sticks and stones with definitions as hypotheses. (Contributed by metakunt, 7-Oct-2024.)

**Hypotheses**
Ref	Expression
sticksstones14.1	⊢ (𝜑 → 𝑁 ∈ ℕ₀)
sticksstones14.2	⊢ (𝜑 → 𝐾 ∈ ℕ₀)
sticksstones14.3	⊢ 𝐹 = (𝑎 ∈ 𝐴 ↦ (𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙))))
sticksstones14.4	⊢ 𝐺 = (𝑏 ∈ 𝐵 ↦ if(𝐾 = 0, {⟨1, 𝑁⟩}, (𝑘 ∈ (1...(𝐾 + 1)) ↦ if(𝑘 = (𝐾 + 1), ((𝑁 + 𝐾) − (𝑏‘𝐾)), if(𝑘 = 1, ((𝑏‘1) − 1), (((𝑏‘𝑘) − (𝑏‘(𝑘 − 1))) − 1))))))
sticksstones14.5	⊢ 𝐴 = {𝑔 ∣ (𝑔:(1...(𝐾 + 1))⟶ℕ₀ ∧ Σ𝑖 ∈ (1...(𝐾 + 1))(𝑔‘𝑖) = 𝑁)}
sticksstones14.6	⊢ 𝐵 = {𝑓 ∣ (𝑓:(1...𝐾)⟶(1...(𝑁 + 𝐾)) ∧ ∀𝑥 ∈ (1...𝐾)∀𝑦 ∈ (1...𝐾)(𝑥 < 𝑦 → (𝑓‘𝑥) < (𝑓‘𝑦)))}

**Assertion**
Ref	Expression
sticksstones14	⊢ (𝜑 → (♯‘𝐴) = ((𝑁 + 𝐾)C𝐾))

Distinct variable groups: 𝐴,𝑎,𝑖,𝑘,𝑙 𝐴,𝑏,𝑖,𝑘,𝑙 𝐴,𝑗,𝑥,𝑦,𝑎,𝑘,𝑙 𝐵,𝑎,𝑓,𝑗,𝑙 𝐵,𝑏,𝑓,𝑗 𝐵,𝑖,𝑘 𝐹,𝑏,𝑖,𝑘 𝐾,𝑎,𝑓,𝑗,𝑙,𝑥,𝑦 𝐾,𝑏,𝑥,𝑦 𝑔,𝐾,𝑖,𝑘,𝑎 𝑁,𝑎,𝑓,𝑗,𝑙,𝑥,𝑦 𝑁,𝑏,𝑔,𝑖,𝑘 𝜑,𝑎,𝑓,𝑗,𝑙,𝑥,𝑦 𝑔,𝑏,𝜑,𝑖,𝑘 Allowed substitution hints: 𝐴(𝑓, 𝑔) 𝐵(𝑥, 𝑦, 𝑔) 𝐹(𝑥, 𝑦, 𝑓, 𝑔, 𝑗, 𝑎, 𝑙) 𝐺(𝑥, 𝑦, 𝑓, 𝑔, 𝑖, 𝑗, 𝑘, 𝑎, 𝑏, 𝑙)

**Proof of Theorem sticksstones14**
Step	Hyp	Ref	Expression
1		sticksstones14.5	. . . . 5 ⊢ 𝐴 = {𝑔 ∣ (𝑔:(1...(𝐾 + 1))⟶ℕ₀ ∧ Σ𝑖 ∈ (1...(𝐾 + 1))(𝑔‘𝑖) = 𝑁)}
2	1	a1i 11	. . . 4 ⊢ (𝜑 → 𝐴 = {𝑔 ∣ (𝑔:(1...(𝐾 + 1))⟶ℕ₀ ∧ Σ𝑖 ∈ (1...(𝐾 + 1))(𝑔‘𝑖) = 𝑁)})
3		simpl 487	. . . . . . 7 ⊢ ((𝑔:(1...(𝐾 + 1))⟶ℕ₀ ∧ Σ𝑖 ∈ (1...(𝐾 + 1))(𝑔‘𝑖) = 𝑁) → 𝑔:(1...(𝐾 + 1))⟶ℕ₀)
4	3	a1i 11	. . . . . 6 ⊢ (𝜑 → ((𝑔:(1...(𝐾 + 1))⟶ℕ₀ ∧ Σ𝑖 ∈ (1...(𝐾 + 1))(𝑔‘𝑖) = 𝑁) → 𝑔:(1...(𝐾 + 1))⟶ℕ₀))
5	4	ss2abdv 4018	. . . . 5 ⊢ (𝜑 → {𝑔 ∣ (𝑔:(1...(𝐾 + 1))⟶ℕ₀ ∧ Σ𝑖 ∈ (1...(𝐾 + 1))(𝑔‘𝑖) = 𝑁)} ⊆ {𝑔 ∣ 𝑔:(1...(𝐾 + 1))⟶ℕ₀})
6		fzfid 14016	. . . . . 6 ⊢ (𝜑 → (1...(𝐾 + 1)) ∈ Fin)
7		nn0ex 12516	. . . . . . 7 ⊢ ℕ₀ ∈ V
8	7	a1i 11	. . . . . 6 ⊢ (𝜑 → ℕ₀ ∈ V)
9		mapex 7935	. . . . . 6 ⊢ (((1...(𝐾 + 1)) ∈ Fin ∧ ℕ₀ ∈ V) → {𝑔 ∣ 𝑔:(1...(𝐾 + 1))⟶ℕ₀} ∈ V)
10	6, 8, 9	syl2anc 595	. . . . 5 ⊢ (𝜑 → {𝑔 ∣ 𝑔:(1...(𝐾 + 1))⟶ℕ₀} ∈ V)
11		ssexg 5289	. . . . 5 ⊢ (({𝑔 ∣ (𝑔:(1...(𝐾 + 1))⟶ℕ₀ ∧ Σ𝑖 ∈ (1...(𝐾 + 1))(𝑔‘𝑖) = 𝑁)} ⊆ {𝑔 ∣ 𝑔:(1...(𝐾 + 1))⟶ℕ₀} ∧ {𝑔 ∣ 𝑔:(1...(𝐾 + 1))⟶ℕ₀} ∈ V) → {𝑔 ∣ (𝑔:(1...(𝐾 + 1))⟶ℕ₀ ∧ Σ𝑖 ∈ (1...(𝐾 + 1))(𝑔‘𝑖) = 𝑁)} ∈ V)
12	5, 10, 11	syl2anc 595	. . . 4 ⊢ (𝜑 → {𝑔 ∣ (𝑔:(1...(𝐾 + 1))⟶ℕ₀ ∧ Σ𝑖 ∈ (1...(𝐾 + 1))(𝑔‘𝑖) = 𝑁)} ∈ V)
13	2, 12	eqeltrd 2862	. . 3 ⊢ (𝜑 → 𝐴 ∈ V)
14		sticksstones14.1	. . . 4 ⊢ (𝜑 → 𝑁 ∈ ℕ₀)
15		sticksstones14.2	. . . 4 ⊢ (𝜑 → 𝐾 ∈ ℕ₀)
16		sticksstones14.3	. . . 4 ⊢ 𝐹 = (𝑎 ∈ 𝐴 ↦ (𝑗 ∈ (1...𝐾) ↦ (𝑗 + Σ𝑙 ∈ (1...𝑗)(𝑎‘𝑙))))
17		sticksstones14.4	. . . 4 ⊢ 𝐺 = (𝑏 ∈ 𝐵 ↦ if(𝐾 = 0, {⟨1, 𝑁⟩}, (𝑘 ∈ (1...(𝐾 + 1)) ↦ if(𝑘 = (𝐾 + 1), ((𝑁 + 𝐾) − (𝑏‘𝐾)), if(𝑘 = 1, ((𝑏‘1) − 1), (((𝑏‘𝑘) − (𝑏‘(𝑘 − 1))) − 1))))))
18		sticksstones14.6	. . . 4 ⊢ 𝐵 = {𝑓 ∣ (𝑓:(1...𝐾)⟶(1...(𝑁 + 𝐾)) ∧ ∀𝑥 ∈ (1...𝐾)∀𝑦 ∈ (1...𝐾)(𝑥 < 𝑦 → (𝑓‘𝑥) < (𝑓‘𝑦)))}
19	14, 15, 16, 17, 1, 18	sticksstones13 42954	. . 3 ⊢ (𝜑 → 𝐹:𝐴–1-1-onto→𝐵)
20	13, 19	hasheqf1od 14396	. 2 ⊢ (𝜑 → (♯‘𝐴) = (♯‘𝐵))
21	14, 15	nn0addcld 12575	. . 3 ⊢ (𝜑 → (𝑁 + 𝐾) ∈ ℕ₀)
22	21, 15, 18	sticksstones5 42945	. 2 ⊢ (𝜑 → (♯‘𝐵) = ((𝑁 + 𝐾)C𝐾))
23	20, 22	eqtrd 2797	1 ⊢ (𝜑 → (♯‘𝐴) = ((𝑁 + 𝐾)C𝐾))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 400 = wceq 1569 ∈ wcel 2142 {cab 2740 ∀wral 3078 Vcvv 3454 ⊆ wss 3904 ifcif 4486 {csn 4588 ⟨cop 4594 class class class wbr 5108 ↦ cmpt 5191 ⟶wf 6532 ‘cfv 6536 (class class class)co 7412 Fincfn 8941 0cc0 11106 1c1 11107 + caddc 11109 < clt 11249 − cmin 11447 ℕ₀cn0 12510 ...cfz 13541 Ccbc 14345 ♯chash 14373 Σcsu 15744

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-inf2 9608 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 ax-pre-sup 11184

This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-int 4912 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5555 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-se 5614 df-we 5615 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-isom 6545 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7861 df-1st 7984 df-2nd 7985 df-frecs 8276 df-wrecs 8307 df-recs 8356 df-rdg 8395 df-1o 8451 df-oadd 8455 df-er 8692 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-sup 9400 df-inf 9401 df-oi 9470 df-dju 9894 df-card 9932 df-pnf 11251 df-mnf 11252 df-xr 11253 df-ltxr 11254 df-le 11255 df-sub 11449 df-neg 11450 df-div 11878 df-nn 12240 df-2 12309 df-3 12310 df-n0 12511 df-z 12598 df-uz 12869 df-rp 13023 df-ico 13384 df-fz 13542 df-fzo 13690 df-seq 14045 df-exp 14105 df-fac 14317 df-bc 14346 df-hash 14374 df-cj 15157 df-re 15158 df-im 15159 df-sqrt 15293 df-abs 15294 df-clim 15546 df-sum 15745

This theorem is used by: sticksstones15 42956

W3C validator