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

Theorem sticksstones4 43467
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.
StepHypRef 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 2766 . . . . . 6 (𝑝 ∈ 𝐴 ↦ ran 𝑝) = (𝑝 ∈ 𝐴 ↦ ran 𝑝)
61, 2, 3, 4, 5sticksstones2 43465 . . . . 5 (𝜑 → (𝑝 ∈ 𝐴 ↦ ran 𝑝):𝐴⟶1-1𝐵)
71, 2, 3, 4, 5sticksstones3 43466 . . . . 5 (𝜑 → (𝑝 ∈ 𝐴 ↦ ran 𝑝):𝐴⟶onto𝐵)
86, 7jca 521 . . . 4 (𝜑 → ((𝑝 ∈ 𝐴 ↦ ran 𝑝):𝐴⟶1-1𝐵 ∧ (𝑝 ∈ 𝐴 ↦ ran 𝑝):𝐴⟶onto𝐵))
9 df-f1o 6572 . . . 4 ((𝑝 ∈ 𝐴 ↦ ran 𝑝):𝐴⟶1-1onto𝐵 ↔ ((𝑝 ∈ 𝐴 ↦ ran 𝑝):𝐴⟶1-1𝐵 ∧ (𝑝 ∈ 𝐴 ↦ ran 𝑝):𝐴⟶onto𝐵))
108, 9sylibr 237 . . 3 (𝜑 → (𝑝 ∈ 𝐴 ↦ ran 𝑝):𝐴⟶1-1onto𝐵)
11 simpl 488 . . . . . . . . 9 ((𝑓:(1...𝐾)⟶(1...𝑁) ∧ ∀𝑥 ∈ (1...𝐾)∀𝑦 ∈ (1...𝐾)(𝑥 < 𝑦 → (𝑓‘𝑥) < (𝑓‘𝑦))) → 𝑓:(1...𝐾)⟶(1...𝑁))
1211a1i 11 . . . . . . . 8 (𝜑 → ((𝑓:(1...𝐾)⟶(1...𝑁) ∧ ∀𝑥 ∈ (1...𝐾)∀𝑦 ∈ (1...𝐾)(𝑥 < 𝑦 → (𝑓‘𝑥) < (𝑓‘𝑦))) → 𝑓:(1...𝐾)⟶(1...𝑁)))
1312ss2abdv 3992 . . . . . . 7 (𝜑 → {𝑓 ∣ (𝑓:(1...𝐾)⟶(1...𝑁) ∧ ∀𝑥 ∈ (1...𝐾)∀𝑦 ∈ (1...𝐾)(𝑥 < 𝑦 → (𝑓‘𝑥) < (𝑓‘𝑦)))} ⊆ {𝑓 ∣ 𝑓:(1...𝐾)⟶(1...𝑁)})
14 fzfid 14155 . . . . . . . 8 (𝜑 → (1...𝐾) ∈ Fin)
15 fzfid 14155 . . . . . . . 8 (𝜑 → (1...𝑁) ∈ Fin)
16 mapex 7985 . . . . . . . 8 (((1...𝐾) ∈ Fin ∧ (1...𝑁) ∈ Fin) → {𝑓 ∣ 𝑓:(1...𝐾)⟶(1...𝑁)} ∈ V)
1714, 15, 16syl2anc 596 . . . . . . 7 (𝜑 → {𝑓 ∣ 𝑓:(1...𝐾)⟶(1...𝑁)} ∈ V)
18 ssexg 5287 . . . . . . 7 (({𝑓 ∣ (𝑓:(1...𝐾)⟶(1...𝑁) ∧ ∀𝑥 ∈ (1...𝐾)∀𝑦 ∈ (1...𝐾)(𝑥 < 𝑦 → (𝑓‘𝑥) < (𝑓‘𝑦)))} ⊆ {𝑓 ∣ 𝑓:(1...𝐾)⟶(1...𝑁)} ∧ {𝑓 ∣ 𝑓:(1...𝐾)⟶(1...𝑁)} ∈ V) → {𝑓 ∣ (𝑓:(1...𝐾)⟶(1...𝑁) ∧ ∀𝑥 ∈ (1...𝐾)∀𝑦 ∈ (1...𝐾)(𝑥 < 𝑦 → (𝑓‘𝑥) < (𝑓‘𝑦)))} ∈ V)
1913, 17, 18syl2anc 596 . . . . . 6 (𝜑 → {𝑓 ∣ (𝑓:(1...𝐾)⟶(1...𝑁) ∧ ∀𝑥 ∈ (1...𝐾)∀𝑦 ∈ (1...𝐾)(𝑥 < 𝑦 → (𝑓‘𝑥) < (𝑓‘𝑦)))} ∈ V)
204eleq1i 2858 . . . . . 6 (𝐴 ∈ V ↔ {𝑓 ∣ (𝑓:(1...𝐾)⟶(1...𝑁) ∧ ∀𝑥 ∈ (1...𝐾)∀𝑦 ∈ (1...𝐾)(𝑥 < 𝑦 → (𝑓‘𝑥) < (𝑓‘𝑦)))} ∈ V)
2119, 20sylibr 237 . . . . 5 (𝜑 → 𝐴 ∈ V)
2221mptexd 7260 . . . 4 (𝜑 → (𝑝 ∈ 𝐴 ↦ ran 𝑝) ∈ V)
23 f1oeq1 6841 . . . . . 6 (𝑔 = (𝑝 ∈ 𝐴 ↦ ran 𝑝) → (𝑔:𝐴⟶1-1onto𝐵 ↔ (𝑝 ∈ 𝐴 ↦ ran 𝑝):𝐴⟶1-1onto𝐵))
2423biimprd 251 . . . . 5 (𝑔 = (𝑝 ∈ 𝐴 ↦ ran 𝑝) → ((𝑝 ∈ 𝐴 ↦ ran 𝑝):𝐴⟶1-1onto𝐵 → 𝑔:𝐴⟶1-1onto𝐵))
2524adantl 487 . . . 4 ((𝜑 ∧ 𝑔 = (𝑝 ∈ 𝐴 ↦ ran 𝑝)) → ((𝑝 ∈ 𝐴 ↦ ran 𝑝):𝐴⟶1-1onto𝐵 → 𝑔:𝐴⟶1-1onto𝐵))
2622, 25spcimedv 3552 . . 3 (𝜑 → ((𝑝 ∈ 𝐴 ↦ ran 𝑝):𝐴⟶1-1onto𝐵 → ∃𝑔 𝑔:𝐴⟶1-1onto𝐵))
2710, 26mpd 16 . 2 (𝜑 → ∃𝑔 𝑔:𝐴⟶1-1onto𝐵)
28 bren 9020 . 2 (𝐴 ≈ 𝐵 ↔ ∃𝑔 𝑔:𝐴⟶1-1onto𝐵)
2927, 28sylibr 237 1 (𝜑 → 𝐴 ≈ 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1572  ∃wex 1814   ∈ wcel 2150  {cab 2744  ∀wral 3083  {crab 3415  Vcvv 3453   ⊆ wss 3899  𝒫 cpw 4559   class class class wbr 5107   ↦ cmpt 5191  ran crn 5658  ⟶wf 6561  ⟶1-1wf1 6562  ⟶ontowfo 6563  ⟶1-1ontowf1o 6564  ‘cfv 6565  (class class class)co 7450   ≈ cen 9007  Fincfn 9010  1c1 11239   < clt 11381  ℕ0cn0 12645  ...cfz 13678  ♯chash 14514
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782  ax-cnex 11294  ax-resscn 11295  ax-1cn 11296  ax-icn 11297  ax-addcl 11298  ax-addrcl 11299  ax-mulcl 11300  ax-mulrcl 11301  ax-mulcom 11302  ax-addass 11303  ax-mulass 11304  ax-distr 11305  ax-i2m1 11306  ax-1ne0 11307  ax-1rid 11308  ax-rnegex 11309  ax-rrecex 11310  ax-cnre 11311  ax-pre-lttri 11312  ax-pre-lttrn 11313  ax-pre-ltadd 11314  ax-pre-mulgt0 11315  ax-pre-sup 11316
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-nel 3069  df-ral 3084  df-rex 3094  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-int 4912  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-se 5611  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-pred 6329  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-isom 6574  df-riota 7407  df-ov 7453  df-oprab 7454  df-mpo 7455  df-om 7911  df-1st 8034  df-2nd 8035  df-frecs 8336  df-wrecs 8367  df-recs 8416  df-rdg 8455  df-1o 8513  df-er 8754  df-en 9011  df-dom 9012  df-sdom 9013  df-fin 9014  df-sup 9470  df-inf 9471  df-oi 9540  df-card 10056  df-pnf 11383  df-mnf 11384  df-xr 11385  df-ltxr 11386  df-le 11387  df-sub 11581  df-neg 11582  df-nn 12375  df-n0 12646  df-z 12733  df-uz 13005  df-fz 13679  df-hash 14515
This theorem is used by:  sticksstones5  43468
  Copyright terms: Public domain W3C validator