MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  phplem4 Structured version   Visualization version   GIF version

Theorem phplem4 8693
Description: Lemma for Pigeonhole Principle. Equinumerosity of successors implies equinumerosity of the original natural numbers. (Contributed by NM, 28-May-1998.) (Revised by Mario Carneiro, 24-Jun-2015.)
Hypotheses
Ref Expression
phplem2.1 𝐴 ∈ V
phplem2.2 𝐵 ∈ V
Assertion
Ref Expression
phplem4 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (suc 𝐴 ≈ suc 𝐵𝐴𝐵))

Proof of Theorem phplem4
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 bren 8512 . 2 (suc 𝐴 ≈ suc 𝐵 ↔ ∃𝑓 𝑓:suc 𝐴1-1-onto→suc 𝐵)
2 f1of1 6608 . . . . . . . . . 10 (𝑓:suc 𝐴1-1-onto→suc 𝐵𝑓:suc 𝐴1-1→suc 𝐵)
32adantl 484 . . . . . . . . 9 ((𝐴 ∈ ω ∧ 𝑓:suc 𝐴1-1-onto→suc 𝐵) → 𝑓:suc 𝐴1-1→suc 𝐵)
4 phplem2.2 . . . . . . . . . 10 𝐵 ∈ V
54sucex 7520 . . . . . . . . 9 suc 𝐵 ∈ V
6 sssucid 6262 . . . . . . . . . 10 𝐴 ⊆ suc 𝐴
7 phplem2.1 . . . . . . . . . 10 𝐴 ∈ V
8 f1imaen2g 8564 . . . . . . . . . 10 (((𝑓:suc 𝐴1-1→suc 𝐵 ∧ suc 𝐵 ∈ V) ∧ (𝐴 ⊆ suc 𝐴𝐴 ∈ V)) → (𝑓𝐴) ≈ 𝐴)
96, 7, 8mpanr12 703 . . . . . . . . 9 ((𝑓:suc 𝐴1-1→suc 𝐵 ∧ suc 𝐵 ∈ V) → (𝑓𝐴) ≈ 𝐴)
103, 5, 9sylancl 588 . . . . . . . 8 ((𝐴 ∈ ω ∧ 𝑓:suc 𝐴1-1-onto→suc 𝐵) → (𝑓𝐴) ≈ 𝐴)
1110ensymd 8554 . . . . . . 7 ((𝐴 ∈ ω ∧ 𝑓:suc 𝐴1-1-onto→suc 𝐵) → 𝐴 ≈ (𝑓𝐴))
12 nnord 7582 . . . . . . . . . 10 (𝐴 ∈ ω → Ord 𝐴)
13 orddif 6278 . . . . . . . . . 10 (Ord 𝐴𝐴 = (suc 𝐴 ∖ {𝐴}))
1412, 13syl 17 . . . . . . . . 9 (𝐴 ∈ ω → 𝐴 = (suc 𝐴 ∖ {𝐴}))
1514imaeq2d 5923 . . . . . . . 8 (𝐴 ∈ ω → (𝑓𝐴) = (𝑓 “ (suc 𝐴 ∖ {𝐴})))
16 f1ofn 6610 . . . . . . . . . . 11 (𝑓:suc 𝐴1-1-onto→suc 𝐵𝑓 Fn suc 𝐴)
177sucid 6264 . . . . . . . . . . 11 𝐴 ∈ suc 𝐴
18 fnsnfv 6737 . . . . . . . . . . 11 ((𝑓 Fn suc 𝐴𝐴 ∈ suc 𝐴) → {(𝑓𝐴)} = (𝑓 “ {𝐴}))
1916, 17, 18sylancl 588 . . . . . . . . . 10 (𝑓:suc 𝐴1-1-onto→suc 𝐵 → {(𝑓𝐴)} = (𝑓 “ {𝐴}))
2019difeq2d 4098 . . . . . . . . 9 (𝑓:suc 𝐴1-1-onto→suc 𝐵 → ((𝑓 “ suc 𝐴) ∖ {(𝑓𝐴)}) = ((𝑓 “ suc 𝐴) ∖ (𝑓 “ {𝐴})))
21 imadmrn 5933 . . . . . . . . . . . 12 (𝑓 “ dom 𝑓) = ran 𝑓
2221eqcomi 2830 . . . . . . . . . . 11 ran 𝑓 = (𝑓 “ dom 𝑓)
23 f1ofo 6616 . . . . . . . . . . . 12 (𝑓:suc 𝐴1-1-onto→suc 𝐵𝑓:suc 𝐴onto→suc 𝐵)
24 forn 6587 . . . . . . . . . . . 12 (𝑓:suc 𝐴onto→suc 𝐵 → ran 𝑓 = suc 𝐵)
2523, 24syl 17 . . . . . . . . . . 11 (𝑓:suc 𝐴1-1-onto→suc 𝐵 → ran 𝑓 = suc 𝐵)
26 f1odm 6613 . . . . . . . . . . . 12 (𝑓:suc 𝐴1-1-onto→suc 𝐵 → dom 𝑓 = suc 𝐴)
2726imaeq2d 5923 . . . . . . . . . . 11 (𝑓:suc 𝐴1-1-onto→suc 𝐵 → (𝑓 “ dom 𝑓) = (𝑓 “ suc 𝐴))
2822, 25, 273eqtr3a 2880 . . . . . . . . . 10 (𝑓:suc 𝐴1-1-onto→suc 𝐵 → suc 𝐵 = (𝑓 “ suc 𝐴))
2928difeq1d 4097 . . . . . . . . 9 (𝑓:suc 𝐴1-1-onto→suc 𝐵 → (suc 𝐵 ∖ {(𝑓𝐴)}) = ((𝑓 “ suc 𝐴) ∖ {(𝑓𝐴)}))
30 dff1o3 6615 . . . . . . . . . 10 (𝑓:suc 𝐴1-1-onto→suc 𝐵 ↔ (𝑓:suc 𝐴onto→suc 𝐵 ∧ Fun 𝑓))
31 imadif 6432 . . . . . . . . . 10 (Fun 𝑓 → (𝑓 “ (suc 𝐴 ∖ {𝐴})) = ((𝑓 “ suc 𝐴) ∖ (𝑓 “ {𝐴})))
3230, 31simplbiim 507 . . . . . . . . 9 (𝑓:suc 𝐴1-1-onto→suc 𝐵 → (𝑓 “ (suc 𝐴 ∖ {𝐴})) = ((𝑓 “ suc 𝐴) ∖ (𝑓 “ {𝐴})))
3320, 29, 323eqtr4rd 2867 . . . . . . . 8 (𝑓:suc 𝐴1-1-onto→suc 𝐵 → (𝑓 “ (suc 𝐴 ∖ {𝐴})) = (suc 𝐵 ∖ {(𝑓𝐴)}))
3415, 33sylan9eq 2876 . . . . . . 7 ((𝐴 ∈ ω ∧ 𝑓:suc 𝐴1-1-onto→suc 𝐵) → (𝑓𝐴) = (suc 𝐵 ∖ {(𝑓𝐴)}))
3511, 34breqtrd 5084 . . . . . 6 ((𝐴 ∈ ω ∧ 𝑓:suc 𝐴1-1-onto→suc 𝐵) → 𝐴 ≈ (suc 𝐵 ∖ {(𝑓𝐴)}))
36 fnfvelrn 6842 . . . . . . . . . 10 ((𝑓 Fn suc 𝐴𝐴 ∈ suc 𝐴) → (𝑓𝐴) ∈ ran 𝑓)
3716, 17, 36sylancl 588 . . . . . . . . 9 (𝑓:suc 𝐴1-1-onto→suc 𝐵 → (𝑓𝐴) ∈ ran 𝑓)
3824eleq2d 2898 . . . . . . . . . 10 (𝑓:suc 𝐴onto→suc 𝐵 → ((𝑓𝐴) ∈ ran 𝑓 ↔ (𝑓𝐴) ∈ suc 𝐵))
3923, 38syl 17 . . . . . . . . 9 (𝑓:suc 𝐴1-1-onto→suc 𝐵 → ((𝑓𝐴) ∈ ran 𝑓 ↔ (𝑓𝐴) ∈ suc 𝐵))
4037, 39mpbid 234 . . . . . . . 8 (𝑓:suc 𝐴1-1-onto→suc 𝐵 → (𝑓𝐴) ∈ suc 𝐵)
41 fvex 6677 . . . . . . . . 9 (𝑓𝐴) ∈ V
424, 41phplem3 8692 . . . . . . . 8 ((𝐵 ∈ ω ∧ (𝑓𝐴) ∈ suc 𝐵) → 𝐵 ≈ (suc 𝐵 ∖ {(𝑓𝐴)}))
4340, 42sylan2 594 . . . . . . 7 ((𝐵 ∈ ω ∧ 𝑓:suc 𝐴1-1-onto→suc 𝐵) → 𝐵 ≈ (suc 𝐵 ∖ {(𝑓𝐴)}))
4443ensymd 8554 . . . . . 6 ((𝐵 ∈ ω ∧ 𝑓:suc 𝐴1-1-onto→suc 𝐵) → (suc 𝐵 ∖ {(𝑓𝐴)}) ≈ 𝐵)
45 entr 8555 . . . . . 6 ((𝐴 ≈ (suc 𝐵 ∖ {(𝑓𝐴)}) ∧ (suc 𝐵 ∖ {(𝑓𝐴)}) ≈ 𝐵) → 𝐴𝐵)
4635, 44, 45syl2an 597 . . . . 5 (((𝐴 ∈ ω ∧ 𝑓:suc 𝐴1-1-onto→suc 𝐵) ∧ (𝐵 ∈ ω ∧ 𝑓:suc 𝐴1-1-onto→suc 𝐵)) → 𝐴𝐵)
4746anandirs 677 . . . 4 (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝑓:suc 𝐴1-1-onto→suc 𝐵) → 𝐴𝐵)
4847ex 415 . . 3 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝑓:suc 𝐴1-1-onto→suc 𝐵𝐴𝐵))
4948exlimdv 1930 . 2 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (∃𝑓 𝑓:suc 𝐴1-1-onto→suc 𝐵𝐴𝐵))
501, 49syl5bi 244 1 ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (suc 𝐴 ≈ suc 𝐵𝐴𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398   = wceq 1533  wex 1776  wcel 2110  Vcvv 3494  cdif 3932  wss 3935  {csn 4560   class class class wbr 5058  ccnv 5548  dom cdm 5549  ran crn 5550  cima 5552  Ord word 6184  suc csuc 6187  Fun wfun 6343   Fn wfn 6344  1-1wf1 6346  ontowfo 6347  1-1-ontowf1o 6348  cfv 6349  ωcom 7574  cen 8500
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5195  ax-nul 5202  ax-pow 5258  ax-pr 5321  ax-un 7455
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3772  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-pss 3953  df-nul 4291  df-if 4467  df-pw 4540  df-sn 4561  df-pr 4563  df-tp 4565  df-op 4567  df-uni 4832  df-br 5059  df-opab 5121  df-tr 5165  df-id 5454  df-eprel 5459  df-po 5468  df-so 5469  df-fr 5508  df-we 5510  df-xp 5555  df-rel 5556  df-cnv 5557  df-co 5558  df-dm 5559  df-rn 5560  df-res 5561  df-ima 5562  df-ord 6188  df-on 6189  df-lim 6190  df-suc 6191  df-iota 6308  df-fun 6351  df-fn 6352  df-f 6353  df-f1 6354  df-fo 6355  df-f1o 6356  df-fv 6357  df-om 7575  df-er 8283  df-en 8504
This theorem is referenced by:  nneneq  8694
  Copyright terms: Public domain W3C validator