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

Theorem sucdom2 9108
Description: Strict dominance of a set over another set implies dominance over its successor. (Contributed by Mario Carneiro, 12-Jan-2013.) (Proof shortened by Mario Carneiro, 27-Apr-2015.) Avoid ax-pow 5318. (Revised by BTernaryTau, 4-Dec-2024.)
Assertion
Ref Expression
sucdom2 (𝐴𝐵 → suc 𝐴𝐵)

Proof of Theorem sucdom2
Dummy variables 𝑓 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 sdomdom 8878 . . 3 (𝐴𝐵𝐴𝐵)
2 brdomi 8856 . . 3 (𝐴𝐵 → ∃𝑓 𝑓:𝐴1-1𝐵)
31, 2syl 17 . 2 (𝐴𝐵 → ∃𝑓 𝑓:𝐴1-1𝐵)
4 vex 3447 . . . . 5 𝑓 ∈ V
54rnex 7841 . . . . 5 ran 𝑓 ∈ V
6 f1f1orn 6792 . . . . . . 7 (𝑓:𝐴1-1𝐵𝑓:𝐴1-1-onto→ran 𝑓)
76adantl 482 . . . . . 6 ((𝐴𝐵𝑓:𝐴1-1𝐵) → 𝑓:𝐴1-1-onto→ran 𝑓)
8 f1of1 6780 . . . . . 6 (𝑓:𝐴1-1-onto→ran 𝑓𝑓:𝐴1-1→ran 𝑓)
97, 8syl 17 . . . . 5 ((𝐴𝐵𝑓:𝐴1-1𝐵) → 𝑓:𝐴1-1→ran 𝑓)
10 f1dom3g 8865 . . . . 5 ((𝑓 ∈ V ∧ ran 𝑓 ∈ V ∧ 𝑓:𝐴1-1→ran 𝑓) → 𝐴 ≼ ran 𝑓)
114, 5, 9, 10mp3an12i 1465 . . . 4 ((𝐴𝐵𝑓:𝐴1-1𝐵) → 𝐴 ≼ ran 𝑓)
12 sdomnen 8879 . . . . . . . 8 (𝐴𝐵 → ¬ 𝐴𝐵)
1312adantr 481 . . . . . . 7 ((𝐴𝐵𝑓:𝐴1-1𝐵) → ¬ 𝐴𝐵)
14 ssdif0 4321 . . . . . . . 8 (𝐵 ⊆ ran 𝑓 ↔ (𝐵 ∖ ran 𝑓) = ∅)
15 simplr 767 . . . . . . . . . . 11 (((𝐴𝐵𝑓:𝐴1-1𝐵) ∧ 𝐵 ⊆ ran 𝑓) → 𝑓:𝐴1-1𝐵)
16 f1f 6735 . . . . . . . . . . . . . 14 (𝑓:𝐴1-1𝐵𝑓:𝐴𝐵)
1716frnd 6673 . . . . . . . . . . . . 13 (𝑓:𝐴1-1𝐵 → ran 𝑓𝐵)
1815, 17syl 17 . . . . . . . . . . . 12 (((𝐴𝐵𝑓:𝐴1-1𝐵) ∧ 𝐵 ⊆ ran 𝑓) → ran 𝑓𝐵)
19 simpr 485 . . . . . . . . . . . 12 (((𝐴𝐵𝑓:𝐴1-1𝐵) ∧ 𝐵 ⊆ ran 𝑓) → 𝐵 ⊆ ran 𝑓)
2018, 19eqssd 3959 . . . . . . . . . . 11 (((𝐴𝐵𝑓:𝐴1-1𝐵) ∧ 𝐵 ⊆ ran 𝑓) → ran 𝑓 = 𝐵)
21 dff1o5 6790 . . . . . . . . . . 11 (𝑓:𝐴1-1-onto𝐵 ↔ (𝑓:𝐴1-1𝐵 ∧ ran 𝑓 = 𝐵))
2215, 20, 21sylanbrc 583 . . . . . . . . . 10 (((𝐴𝐵𝑓:𝐴1-1𝐵) ∧ 𝐵 ⊆ ran 𝑓) → 𝑓:𝐴1-1-onto𝐵)
23 f1oen3g 8864 . . . . . . . . . 10 ((𝑓 ∈ V ∧ 𝑓:𝐴1-1-onto𝐵) → 𝐴𝐵)
244, 22, 23sylancr 587 . . . . . . . . 9 (((𝐴𝐵𝑓:𝐴1-1𝐵) ∧ 𝐵 ⊆ ran 𝑓) → 𝐴𝐵)
2524ex 413 . . . . . . . 8 ((𝐴𝐵𝑓:𝐴1-1𝐵) → (𝐵 ⊆ ran 𝑓𝐴𝐵))
2614, 25biimtrrid 242 . . . . . . 7 ((𝐴𝐵𝑓:𝐴1-1𝐵) → ((𝐵 ∖ ran 𝑓) = ∅ → 𝐴𝐵))
2713, 26mtod 197 . . . . . 6 ((𝐴𝐵𝑓:𝐴1-1𝐵) → ¬ (𝐵 ∖ ran 𝑓) = ∅)
28 neq0 4303 . . . . . 6 (¬ (𝐵 ∖ ran 𝑓) = ∅ ↔ ∃𝑤 𝑤 ∈ (𝐵 ∖ ran 𝑓))
2927, 28sylib 217 . . . . 5 ((𝐴𝐵𝑓:𝐴1-1𝐵) → ∃𝑤 𝑤 ∈ (𝐵 ∖ ran 𝑓))
30 snssi 4766 . . . . . . 7 (𝑤 ∈ (𝐵 ∖ ran 𝑓) → {𝑤} ⊆ (𝐵 ∖ ran 𝑓))
31 relsdom 8848 . . . . . . . . . . 11 Rel ≺
3231brrelex1i 5686 . . . . . . . . . 10 (𝐴𝐵𝐴 ∈ V)
3332adantr 481 . . . . . . . . 9 ((𝐴𝐵𝑓:𝐴1-1𝐵) → 𝐴 ∈ V)
34 vex 3447 . . . . . . . . 9 𝑤 ∈ V
35 en2sn 8943 . . . . . . . . 9 ((𝐴 ∈ V ∧ 𝑤 ∈ V) → {𝐴} ≈ {𝑤})
3633, 34, 35sylancl 586 . . . . . . . 8 ((𝐴𝐵𝑓:𝐴1-1𝐵) → {𝐴} ≈ {𝑤})
3731brrelex2i 5687 . . . . . . . . . 10 (𝐴𝐵𝐵 ∈ V)
3837adantr 481 . . . . . . . . 9 ((𝐴𝐵𝑓:𝐴1-1𝐵) → 𝐵 ∈ V)
39 difexg 5282 . . . . . . . . 9 (𝐵 ∈ V → (𝐵 ∖ ran 𝑓) ∈ V)
40 snfi 8946 . . . . . . . . . . 11 {𝑤} ∈ Fin
41 ssdomfi2 9102 . . . . . . . . . . 11 (({𝑤} ∈ Fin ∧ (𝐵 ∖ ran 𝑓) ∈ V ∧ {𝑤} ⊆ (𝐵 ∖ ran 𝑓)) → {𝑤} ≼ (𝐵 ∖ ran 𝑓))
4240, 41mp3an1 1448 . . . . . . . . . 10 (((𝐵 ∖ ran 𝑓) ∈ V ∧ {𝑤} ⊆ (𝐵 ∖ ran 𝑓)) → {𝑤} ≼ (𝐵 ∖ ran 𝑓))
4342ex 413 . . . . . . . . 9 ((𝐵 ∖ ran 𝑓) ∈ V → ({𝑤} ⊆ (𝐵 ∖ ran 𝑓) → {𝑤} ≼ (𝐵 ∖ ran 𝑓)))
4438, 39, 433syl 18 . . . . . . . 8 ((𝐴𝐵𝑓:𝐴1-1𝐵) → ({𝑤} ⊆ (𝐵 ∖ ran 𝑓) → {𝑤} ≼ (𝐵 ∖ ran 𝑓)))
45 endom 8877 . . . . . . . . 9 ({𝐴} ≈ {𝑤} → {𝐴} ≼ {𝑤})
46 domtrfi 9098 . . . . . . . . . 10 (({𝑤} ∈ Fin ∧ {𝐴} ≼ {𝑤} ∧ {𝑤} ≼ (𝐵 ∖ ran 𝑓)) → {𝐴} ≼ (𝐵 ∖ ran 𝑓))
4740, 46mp3an1 1448 . . . . . . . . 9 (({𝐴} ≼ {𝑤} ∧ {𝑤} ≼ (𝐵 ∖ ran 𝑓)) → {𝐴} ≼ (𝐵 ∖ ran 𝑓))
4845, 47sylan 580 . . . . . . . 8 (({𝐴} ≈ {𝑤} ∧ {𝑤} ≼ (𝐵 ∖ ran 𝑓)) → {𝐴} ≼ (𝐵 ∖ ran 𝑓))
4936, 44, 48syl6an 682 . . . . . . 7 ((𝐴𝐵𝑓:𝐴1-1𝐵) → ({𝑤} ⊆ (𝐵 ∖ ran 𝑓) → {𝐴} ≼ (𝐵 ∖ ran 𝑓)))
5030, 49syl5 34 . . . . . 6 ((𝐴𝐵𝑓:𝐴1-1𝐵) → (𝑤 ∈ (𝐵 ∖ ran 𝑓) → {𝐴} ≼ (𝐵 ∖ ran 𝑓)))
5150exlimdv 1936 . . . . 5 ((𝐴𝐵𝑓:𝐴1-1𝐵) → (∃𝑤 𝑤 ∈ (𝐵 ∖ ran 𝑓) → {𝐴} ≼ (𝐵 ∖ ran 𝑓)))
5229, 51mpd 15 . . . 4 ((𝐴𝐵𝑓:𝐴1-1𝐵) → {𝐴} ≼ (𝐵 ∖ ran 𝑓))
53 disjdif 4429 . . . . 5 (ran 𝑓 ∩ (𝐵 ∖ ran 𝑓)) = ∅
5453a1i 11 . . . 4 ((𝐴𝐵𝑓:𝐴1-1𝐵) → (ran 𝑓 ∩ (𝐵 ∖ ran 𝑓)) = ∅)
55 undom 8961 . . . 4 (((𝐴 ≼ ran 𝑓 ∧ {𝐴} ≼ (𝐵 ∖ ran 𝑓)) ∧ (ran 𝑓 ∩ (𝐵 ∖ ran 𝑓)) = ∅) → (𝐴 ∪ {𝐴}) ≼ (ran 𝑓 ∪ (𝐵 ∖ ran 𝑓)))
5611, 52, 54, 55syl21anc 836 . . 3 ((𝐴𝐵𝑓:𝐴1-1𝐵) → (𝐴 ∪ {𝐴}) ≼ (ran 𝑓 ∪ (𝐵 ∖ ran 𝑓)))
57 df-suc 6321 . . . 4 suc 𝐴 = (𝐴 ∪ {𝐴})
5857a1i 11 . . 3 ((𝐴𝐵𝑓:𝐴1-1𝐵) → suc 𝐴 = (𝐴 ∪ {𝐴}))
59 undif2 4434 . . . 4 (ran 𝑓 ∪ (𝐵 ∖ ran 𝑓)) = (ran 𝑓𝐵)
6017adantl 482 . . . . 5 ((𝐴𝐵𝑓:𝐴1-1𝐵) → ran 𝑓𝐵)
61 ssequn1 4138 . . . . 5 (ran 𝑓𝐵 ↔ (ran 𝑓𝐵) = 𝐵)
6260, 61sylib 217 . . . 4 ((𝐴𝐵𝑓:𝐴1-1𝐵) → (ran 𝑓𝐵) = 𝐵)
6359, 62eqtr2id 2790 . . 3 ((𝐴𝐵𝑓:𝐴1-1𝐵) → 𝐵 = (ran 𝑓 ∪ (𝐵 ∖ ran 𝑓)))
6456, 58, 633brtr4d 5135 . 2 ((𝐴𝐵𝑓:𝐴1-1𝐵) → suc 𝐴𝐵)
653, 64exlimddv 1938 1 (𝐴𝐵 → suc 𝐴𝐵)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 396   = wceq 1541  wex 1781  wcel 2106  Vcvv 3443  cdif 3905  cun 3906  cin 3907  wss 3908  c0 4280  {csn 4584   class class class wbr 5103  ran crn 5632  suc csuc 6317  1-1wf1 6490  1-1-ontowf1o 6492  cen 8838  cdom 8839  csdm 8840  Fincfn 8841
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2708  ax-sep 5254  ax-nul 5261  ax-pr 5382  ax-un 7664
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2815  df-nfc 2887  df-ne 2942  df-ral 3063  df-rex 3072  df-reu 3352  df-rab 3406  df-v 3445  df-sbc 3738  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3927  df-nul 4281  df-if 4485  df-pw 4560  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4864  df-br 5104  df-opab 5166  df-tr 5221  df-id 5529  df-eprel 5535  df-po 5543  df-so 5544  df-fr 5586  df-we 5588  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-ord 6318  df-on 6319  df-lim 6320  df-suc 6321  df-iota 6445  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-om 7795  df-1o 8404  df-en 8842  df-dom 8843  df-sdom 8844  df-fin 8845
This theorem is referenced by:  sucdom  9137  sucdomOLD  9138  card2inf  9449
  Copyright terms: Public domain W3C validator