Theorem sticksstones4 43016

Description: Equinumerosity lemma for sticks and stones. (Contributed by metakunt, 28-Sep-2024.)

Hypotheses

Ref	Expression
sticksstones4.1	⊢ (𝜑 → 𝑁 ∈ ℕ0)
sticksstones4.2	⊢ (𝜑 → 𝐾 ∈ ℕ0)
sticksstones4.3	⊢ 𝐵 = {𝑎 ∈ 𝒫 (1...𝑁) ∣ (♯‘𝑎) = 𝐾}
sticksstones4.4	⊢ 𝐴 = {𝑓 ∣ (𝑓:(1...𝐾)⟶(1...𝑁) ∧ ∀𝑥 ∈ (1...𝐾)∀𝑦 ∈ (1...𝐾)(𝑥 < 𝑦 → (𝑓‘𝑥) < (𝑓‘𝑦)))}

Assertion

Ref	Expression
sticksstones4	⊢ (𝜑 → 𝐴 ≈ 𝐵)

Distinct variable groups:   𝐴,𝑎   𝐴,𝑓   𝑥,𝐵,𝑦   𝐾,𝑎,𝑥,𝑦   𝑓,𝐾,𝑥,𝑦   𝑁,𝑎   𝑓,𝑁   𝜑,𝑎,𝑥,𝑦   𝜑,𝑓

Allowed substitution hints:   𝐴(𝑥, 𝑦)   𝐵(𝑓, 𝑎)   𝑁(𝑥, 𝑦)

Proof of Theorem sticksstones4

Dummy variables 𝑝 𝑔 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		sticksstones4.1	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ℕ0)
2		sticksstones4.2	. . . . . 6 ⊢ (𝜑 → 𝐾 ∈ ℕ0)
3		sticksstones4.3	. . . . . 6 ⊢ 𝐵 = {𝑎 ∈ 𝒫 (1...𝑁) ∣ (♯‘𝑎) = 𝐾}
4		sticksstones4.4	. . . . . 6 ⊢ 𝐴 = {𝑓 ∣ (𝑓:(1...𝐾)⟶(1...𝑁) ∧ ∀𝑥 ∈ (1...𝐾)∀𝑦 ∈ (1...𝐾)(𝑥 < 𝑦 → (𝑓‘𝑥) < (𝑓‘𝑦)))}
5		eqid 2760	. . . . . 6 ⊢ (𝑝 ∈ 𝐴 ↦ ran 𝑝) = (𝑝 ∈ 𝐴 ↦ ran 𝑝)
6	1, 2, 3, 4, 5	sticksstones2 43014	. . . . 5 ⊢ (𝜑 → (𝑝 ∈ 𝐴 ↦ ran 𝑝):𝐴–1-1→𝐵)
7	1, 2, 3, 4, 5	sticksstones3 43015	. . . . 5 ⊢ (𝜑 → (𝑝 ∈ 𝐴 ↦ ran 𝑝):𝐴–onto→𝐵)
8	6, 7	jca 521	. . . 4 ⊢ (𝜑 → ((𝑝 ∈ 𝐴 ↦ ran 𝑝):𝐴–1-1→𝐵 ∧ (𝑝 ∈ 𝐴 ↦ ran 𝑝):𝐴–onto→𝐵))
9		df-f1o 6540	. . . 4 ⊢ ((𝑝 ∈ 𝐴 ↦ ran 𝑝):𝐴–1-1-onto→𝐵 ↔ ((𝑝 ∈ 𝐴 ↦ ran 𝑝):𝐴–1-1→𝐵 ∧ (𝑝 ∈ 𝐴 ↦ ran 𝑝):𝐴–onto→𝐵))
10	8, 9	sylibr 237	. . 3 ⊢ (𝜑 → (𝑝 ∈ 𝐴 ↦ ran 𝑝):𝐴–1-1-onto→𝐵)
11		simpl 488	. . . . . . . . 9 ⊢ ((𝑓:(1...𝐾)⟶(1...𝑁) ∧ ∀𝑥 ∈ (1...𝐾)∀𝑦 ∈ (1...𝐾)(𝑥 < 𝑦 → (𝑓‘𝑥) < (𝑓‘𝑦))) → 𝑓:(1...𝐾)⟶(1...𝑁))
12	11	a1i 11	. . . . . . . 8 ⊢ (𝜑 → ((𝑓:(1...𝐾)⟶(1...𝑁) ∧ ∀𝑥 ∈ (1...𝐾)∀𝑦 ∈ (1...𝐾)(𝑥 < 𝑦 → (𝑓‘𝑥) < (𝑓‘𝑦))) → 𝑓:(1...𝐾)⟶(1...𝑁)))
13	12	ss2abdv 4013	. . . . . . 7 ⊢ (𝜑 → {𝑓 ∣ (𝑓:(1...𝐾)⟶(1...𝑁) ∧ ∀𝑥 ∈ (1...𝐾)∀𝑦 ∈ (1...𝐾)(𝑥 < 𝑦 → (𝑓‘𝑥) < (𝑓‘𝑦)))} ⊆ {𝑓 ∣ 𝑓:(1...𝐾)⟶(1...𝑁)})
14		fzfid 14038	. . . . . . . 8 ⊢ (𝜑 → (1...𝐾) ∈ Fin)
15		fzfid 14038	. . . . . . . 8 ⊢ (𝜑 → (1...𝑁) ∈ Fin)
16		mapex 7938	. . . . . . . 8 ⊢ (((1...𝐾) ∈ Fin ∧ (1...𝑁) ∈ Fin) → {𝑓 ∣ 𝑓:(1...𝐾)⟶(1...𝑁)} ∈ V)
17	14, 15, 16	syl2anc 596	. . . . . . 7 ⊢ (𝜑 → {𝑓 ∣ 𝑓:(1...𝐾)⟶(1...𝑁)} ∈ V)
18		ssexg 5284	. . . . . . 7 ⊢ (({𝑓 ∣ (𝑓:(1...𝐾)⟶(1...𝑁) ∧ ∀𝑥 ∈ (1...𝐾)∀𝑦 ∈ (1...𝐾)(𝑥 < 𝑦 → (𝑓‘𝑥) < (𝑓‘𝑦)))} ⊆ {𝑓 ∣ 𝑓:(1...𝐾)⟶(1...𝑁)} ∧ {𝑓 ∣ 𝑓:(1...𝐾)⟶(1...𝑁)} ∈ V) → {𝑓 ∣ (𝑓:(1...𝐾)⟶(1...𝑁) ∧ ∀𝑥 ∈ (1...𝐾)∀𝑦 ∈ (1...𝐾)(𝑥 < 𝑦 → (𝑓‘𝑥) < (𝑓‘𝑦)))} ∈ V)
19	13, 17, 18	syl2anc 596	. . . . . 6 ⊢ (𝜑 → {𝑓 ∣ (𝑓:(1...𝐾)⟶(1...𝑁) ∧ ∀𝑥 ∈ (1...𝐾)∀𝑦 ∈ (1...𝐾)(𝑥 < 𝑦 → (𝑓‘𝑥) < (𝑓‘𝑦)))} ∈ V)
20	4	eleq1i 2851	. . . . . 6 ⊢ (𝐴 ∈ V ↔ {𝑓 ∣ (𝑓:(1...𝐾)⟶(1...𝑁) ∧ ∀𝑥 ∈ (1...𝐾)∀𝑦 ∈ (1...𝐾)(𝑥 < 𝑦 → (𝑓‘𝑥) < (𝑓‘𝑦)))} ∈ V)
21	19, 20	sylibr 237	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ V)
22	21	mptexd 7224	. . . 4 ⊢ (𝜑 → (𝑝 ∈ 𝐴 ↦ ran 𝑝) ∈ V)
23		f1oeq1 6806	. . . . . 6 ⊢ (𝑔 = (𝑝 ∈ 𝐴 ↦ ran 𝑝) → (𝑔:𝐴–1-1-onto→𝐵 ↔ (𝑝 ∈ 𝐴 ↦ ran 𝑝):𝐴–1-1-onto→𝐵))
24	23	biimprd 251	. . . . 5 ⊢ (𝑔 = (𝑝 ∈ 𝐴 ↦ ran 𝑝) → ((𝑝 ∈ 𝐴 ↦ ran 𝑝):𝐴–1-1-onto→𝐵 → 𝑔:𝐴–1-1-onto→𝐵))
25	24	adantl 487	. . . 4 ⊢ ((𝜑 ∧ 𝑔 = (𝑝 ∈ 𝐴 ↦ ran 𝑝)) → ((𝑝 ∈ 𝐴 ↦ ran 𝑝):𝐴–1-1-onto→𝐵 → 𝑔:𝐴–1-1-onto→𝐵))
26	22, 25	spcimedv 3549	. . 3 ⊢ (𝜑 → ((𝑝 ∈ 𝐴 ↦ ran 𝑝):𝐴–1-1-onto→𝐵 → ∃𝑔 𝑔:𝐴–1-1-onto→𝐵))
27	10, 26	mpd 16	. 2 ⊢ (𝜑 → ∃𝑔 𝑔:𝐴–1-1-onto→𝐵)
28		bren 8963	. 2 ⊢ (𝐴 ≈ 𝐵 ↔ ∃𝑔 𝑔:𝐴–1-1-onto→𝐵)
29	27, 28	sylibr 237	1 ⊢ (𝜑 → 𝐴 ≈ 𝐵)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145  {cab 2738  ∀wral 3076  {crab 3412  Vcvv 3450   ⊆ wss 3899  𝒫 cpw 4557   class class class wbr 5103   ↦ cmpt 5186  ran crn 5656  ⟶wf 6529  –1-1→wf1 6530  –onto→wfo 6531  –1-1-onto→wf1o 6532  ‘cfv 6533  (class class class)co 7414   ≈ cen 8950  Fincfn 8953  1c1 11126   < clt 11268  ℕ₀cn0 12529  ...cfz 13562  ♯chash 14395

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737  ax-cnex 11181  ax-resscn 11182  ax-1cn 11183  ax-icn 11184  ax-addcl 11185  ax-addrcl 11186  ax-mulcl 11187  ax-mulrcl 11188  ax-mulcom 11189  ax-addass 11190  ax-mulass 11191  ax-distr 11192  ax-i2m1 11193  ax-1ne0 11194  ax-1rid 11195  ax-rnegex 11196  ax-rrecex 11197  ax-cnre 11198  ax-pre-lttri 11199  ax-pre-lttrn 11200  ax-pre-ltadd 11201  ax-pre-mulgt0 11202  ax-pre-sup 11203

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-se 5609  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6299  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-isom 6542  df-riota 7371  df-ov 7417  df-oprab 7418  df-mpo 7419  df-om 7864  df-1st 7987  df-2nd 7988  df-frecs 8281  df-wrecs 8312  df-recs 8361  df-rdg 8400  df-1o 8456  df-er 8697  df-en 8954  df-dom 8955  df-sdom 8956  df-fin 8957  df-sup 9413  df-inf 9414  df-oi 9483  df-card 9945  df-pnf 11270  df-mnf 11271  df-xr 11272  df-ltxr 11273  df-le 11274  df-sub 11468  df-neg 11469  df-nn 12259  df-n0 12530  df-z 12617  df-uz 12889  df-fz 13563  df-hash 14396

This theorem is used by:  sticksstones5  43017