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

Theorem sucdom2 9256
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 5334. (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 9045 . . 3 (𝐴 ≺ 𝐵 → 𝐴 ≼ 𝐵)
2 brdomi 9024 . . 3 (𝐴 ≼ 𝐵 → ∃𝑓 𝑓:𝐴⟶1-1𝐵)
31, 2syl 18 . 2 (𝐴 ≺ 𝐵 → ∃𝑓 𝑓:𝐴⟶1-1𝐵)
4 vex 3458 . . . . 5 𝑓 ∈ V
54rnex 7956 . . . . 5 ran 𝑓 ∈ V
6 f1f1orn 6866 . . . . . . 7 (𝑓:𝐴⟶1-1𝐵 → 𝑓:𝐴⟶1-1ontoran 𝑓)
76adantl 487 . . . . . 6 ((𝐴 ≺ 𝐵 ∧ 𝑓:𝐴⟶1-1𝐵) → 𝑓:𝐴⟶1-1ontoran 𝑓)
8 f1of1 6853 . . . . . 6 (𝑓:𝐴⟶1-1ontoran 𝑓 → 𝑓:𝐴⟶1-1ran 𝑓)
97, 8syl 18 . . . . 5 ((𝐴 ≺ 𝐵 ∧ 𝑓:𝐴⟶1-1𝐵) → 𝑓:𝐴⟶1-1ran 𝑓)
10 f1dom3g 9032 . . . . 5 ((𝑓 ∈ V ∧ ran 𝑓 ∈ V ∧ 𝑓:𝐴⟶1-1ran 𝑓) → 𝐴 ≼ ran 𝑓)
114, 5, 9, 10mp3an12i 1495 . . . 4 ((𝐴 ≺ 𝐵 ∧ 𝑓:𝐴⟶1-1𝐵) → 𝐴 ≼ ran 𝑓)
12 sdomnen 9046 . . . . . . . 8 (𝐴 ≺ 𝐵 → ¬ 𝐴 ≈ 𝐵)
1312adantr 486 . . . . . . 7 ((𝐴 ≺ 𝐵 ∧ 𝑓:𝐴⟶1-1𝐵) → ¬ 𝐴 ≈ 𝐵)
14 ssdif0 4317 . . . . . . . 8 (𝐵 ⊆ ran 𝑓 ↔ (𝐵 ∖ ran 𝑓) = ∅)
15 simplr 781 . . . . . . . . . . 11 (((𝐴 ≺ 𝐵 ∧ 𝑓:𝐴⟶1-1𝐵) ∧ 𝐵 ⊆ ran 𝑓) → 𝑓:𝐴⟶1-1𝐵)
16 f1f 6808 . . . . . . . . . . . . . 14 (𝑓:𝐴⟶1-1𝐵 → 𝑓:𝐴⟶𝐵)
1716frnd 6748 . . . . . . . . . . . . 13 (𝑓:𝐴⟶1-1𝐵 → ran 𝑓 ⊆ 𝐵)
1815, 17syl 18 . . . . . . . . . . . 12 (((𝐴 ≺ 𝐵 ∧ 𝑓:𝐴⟶1-1𝐵) ∧ 𝐵 ⊆ ran 𝑓) → ran 𝑓 ⊆ 𝐵)
19 simpr 490 . . . . . . . . . . . 12 (((𝐴 ≺ 𝐵 ∧ 𝑓:𝐴⟶1-1𝐵) ∧ 𝐵 ⊆ ran 𝑓) → 𝐵 ⊆ ran 𝑓)
2018, 19eqssd 3930 . . . . . . . . . . 11 (((𝐴 ≺ 𝐵 ∧ 𝑓:𝐴⟶1-1𝐵) ∧ 𝐵 ⊆ ran 𝑓) → ran 𝑓 = 𝐵)
21 dff1o5 6864 . . . . . . . . . . 11 (𝑓:𝐴⟶1-1onto𝐵 ↔ (𝑓:𝐴⟶1-1𝐵 ∧ ran 𝑓 = 𝐵))
2215, 20, 21sylanbrc 595 . . . . . . . . . 10 (((𝐴 ≺ 𝐵 ∧ 𝑓:𝐴⟶1-1𝐵) ∧ 𝐵 ⊆ ran 𝑓) → 𝑓:𝐴⟶1-1onto𝐵)
23 f1oen3g 9031 . . . . . . . . . 10 ((𝑓 ∈ V ∧ 𝑓:𝐴⟶1-1onto𝐵) → 𝐴 ≈ 𝐵)
244, 22, 23sylancr 599 . . . . . . . . 9 (((𝐴 ≺ 𝐵 ∧ 𝑓:𝐴⟶1-1𝐵) ∧ 𝐵 ⊆ ran 𝑓) → 𝐴 ≈ 𝐵)
2524ex 418 . . . . . . . 8 ((𝐴 ≺ 𝐵 ∧ 𝑓:𝐴⟶1-1𝐵) → (𝐵 ⊆ ran 𝑓 → 𝐴 ≈ 𝐵))
2614, 25biimtrrid 246 . . . . . . 7 ((𝐴 ≺ 𝐵 ∧ 𝑓:𝐴⟶1-1𝐵) → ((𝐵 ∖ ran 𝑓) = ∅ → 𝐴 ≈ 𝐵))
2713, 26mtod 201 . . . . . 6 ((𝐴 ≺ 𝐵 ∧ 𝑓:𝐴⟶1-1𝐵) → ¬ (𝐵 ∖ ran 𝑓) = ∅)
28 neq0 4302 . . . . . 6 (¬ (𝐵 ∖ ran 𝑓) = ∅ ↔ ∃𝑤 𝑤 ∈ (𝐵 ∖ ran 𝑓))
2927, 28sylib 221 . . . . 5 ((𝐴 ≺ 𝐵 ∧ 𝑓:𝐴⟶1-1𝐵) → ∃𝑤 𝑤 ∈ (𝐵 ∖ ran 𝑓))
30 snssi 4748 . . . . . . 7 (𝑤 ∈ (𝐵 ∖ ran 𝑓) → {𝑤} ⊆ (𝐵 ∖ ran 𝑓))
31 relsdom 9018 . . . . . . . . . . 11 Rel ≺
3231brrelex1i 5714 . . . . . . . . . 10 (𝐴 ≺ 𝐵 → 𝐴 ∈ V)
3332adantr 486 . . . . . . . . 9 ((𝐴 ≺ 𝐵 ∧ 𝑓:𝐴⟶1-1𝐵) → 𝐴 ∈ V)
34 vex 3458 . . . . . . . . 9 𝑤 ∈ V
35 en2sn 9107 . . . . . . . . 9 ((𝐴 ∈ V ∧ 𝑤 ∈ V) → {𝐴} ≈ {𝑤})
3633, 34, 35sylancl 598 . . . . . . . 8 ((𝐴 ≺ 𝐵 ∧ 𝑓:𝐴⟶1-1𝐵) → {𝐴} ≈ {𝑤})
3731brrelex2i 5715 . . . . . . . . . 10 (𝐴 ≺ 𝐵 → 𝐵 ∈ V)
3837adantr 486 . . . . . . . . 9 ((𝐴 ≺ 𝐵 ∧ 𝑓:𝐴⟶1-1𝐵) → 𝐵 ∈ V)
39 difexg 5298 . . . . . . . . 9 (𝐵 ∈ V → (𝐵 ∖ ran 𝑓) ∈ V)
40 snfi 9109 . . . . . . . . . . 11 {𝑤} ∈ Fin
41 ssdomfi2 9250 . . . . . . . . . . 11 (({𝑤} ∈ Fin ∧ (𝐵 ∖ ran 𝑓) ∈ V ∧ {𝑤} ⊆ (𝐵 ∖ ran 𝑓)) → {𝑤} ≼ (𝐵 ∖ ran 𝑓))
4240, 41mp3an1 1478 . . . . . . . . . 10 (((𝐵 ∖ ran 𝑓) ∈ V ∧ {𝑤} ⊆ (𝐵 ∖ ran 𝑓)) → {𝑤} ≼ (𝐵 ∖ ran 𝑓))
4342ex 418 . . . . . . . . 9 ((𝐵 ∖ ran 𝑓) ∈ V → ({𝑤} ⊆ (𝐵 ∖ ran 𝑓) → {𝑤} ≼ (𝐵 ∖ ran 𝑓)))
4438, 39, 433syl 19 . . . . . . . 8 ((𝐴 ≺ 𝐵 ∧ 𝑓:𝐴⟶1-1𝐵) → ({𝑤} ⊆ (𝐵 ∖ ran 𝑓) → {𝑤} ≼ (𝐵 ∖ ran 𝑓)))
45 endom 9044 . . . . . . . . 9 ({𝐴} ≈ {𝑤} → {𝐴} ≼ {𝑤})
46 domtrfi 9246 . . . . . . . . . 10 (({𝑤} ∈ Fin ∧ {𝐴} ≼ {𝑤} ∧ {𝑤} ≼ (𝐵 ∖ ran 𝑓)) → {𝐴} ≼ (𝐵 ∖ ran 𝑓))
4740, 46mp3an1 1478 . . . . . . . . 9 (({𝐴} ≼ {𝑤} ∧ {𝑤} ≼ (𝐵 ∖ ran 𝑓)) → {𝐴} ≼ (𝐵 ∖ ran 𝑓))
4845, 47sylan 592 . . . . . . . 8 (({𝐴} ≈ {𝑤} ∧ {𝑤} ≼ (𝐵 ∖ ran 𝑓)) → {𝐴} ≼ (𝐵 ∖ ran 𝑓))
4936, 44, 48syl6an 697 . . . . . . 7 ((𝐴 ≺ 𝐵 ∧ 𝑓:𝐴⟶1-1𝐵) → ({𝑤} ⊆ (𝐵 ∖ ran 𝑓) → {𝐴} ≼ (𝐵 ∖ ran 𝑓)))
5030, 49syl5 35 . . . . . 6 ((𝐴 ≺ 𝐵 ∧ 𝑓:𝐴⟶1-1𝐵) → (𝑤 ∈ (𝐵 ∖ ran 𝑓) → {𝐴} ≼ (𝐵 ∖ ran 𝑓)))
5150exlimdv 1968 . . . . 5 ((𝐴 ≺ 𝐵 ∧ 𝑓:𝐴⟶1-1𝐵) → (∃𝑤 𝑤 ∈ (𝐵 ∖ ran 𝑓) → {𝐴} ≼ (𝐵 ∖ ran 𝑓)))
5229, 51mpd 16 . . . 4 ((𝐴 ≺ 𝐵 ∧ 𝑓:𝐴⟶1-1𝐵) → {𝐴} ≼ (𝐵 ∖ ran 𝑓))
53 disjdif 4429 . . . . 5 (ran 𝑓 ∩ (𝐵 ∖ ran 𝑓)) = ∅
5453a1i 11 . . . 4 ((𝐴 ≺ 𝐵 ∧ 𝑓:𝐴⟶1-1𝐵) → (ran 𝑓 ∩ (𝐵 ∖ ran 𝑓)) = ∅)
55 undom 9122 . . . 4 (((𝐴 ≼ ran 𝑓 ∧ {𝐴} ≼ (𝐵 ∖ ran 𝑓)) ∧ (ran 𝑓 ∩ (𝐵 ∖ ran 𝑓)) = ∅) → (𝐴 ∪ {𝐴}) ≼ (ran 𝑓 ∪ (𝐵 ∖ ran 𝑓)))
5611, 52, 54, 55syl21anc 851 . . 3 ((𝐴 ≺ 𝐵 ∧ 𝑓:𝐴⟶1-1𝐵) → (𝐴 ∪ {𝐴}) ≼ (ran 𝑓 ∪ (𝐵 ∖ ran 𝑓)))
57 df-suc 6394 . . . 4 suc 𝐴 = (𝐴 ∪ {𝐴})
5857a1i 11 . . 3 ((𝐴 ≺ 𝐵 ∧ 𝑓:𝐴⟶1-1𝐵) → suc 𝐴 = (𝐴 ∪ {𝐴}))
59 undif2 4434 . . . 4 (ran 𝑓 ∪ (𝐵 ∖ ran 𝑓)) = (ran 𝑓 ∪ 𝐵)
6017adantl 487 . . . . 5 ((𝐴 ≺ 𝐵 ∧ 𝑓:𝐴⟶1-1𝐵) → ran 𝑓 ⊆ 𝐵)
61 ssequn1 4187 . . . . 5 (ran 𝑓 ⊆ 𝐵 ↔ (ran 𝑓 ∪ 𝐵) = 𝐵)
6260, 61sylib 221 . . . 4 ((𝐴 ≺ 𝐵 ∧ 𝑓:𝐴⟶1-1𝐵) → (ran 𝑓 ∪ 𝐵) = 𝐵)
6359, 62eqtr2id 2811 . . 3 ((𝐴 ≺ 𝐵 ∧ 𝑓:𝐴⟶1-1𝐵) → 𝐵 = (ran 𝑓 ∪ (𝐵 ∖ ran 𝑓)))
6456, 58, 633brtr4d 5143 . 2 ((𝐴 ≺ 𝐵 ∧ 𝑓:𝐴⟶1-1𝐵) → suc 𝐴 ≼ 𝐵)
653, 64exlimddv 1970 1 (𝐴 ≺ 𝐵 → suc 𝐴 ≼ 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2147  Vcvv 3454   ⊆ wss 3900   ∖ cdif 4048   ∩ cin 4092   ∪ cun 4152  ∅c0 4281  {csn 4588   class class class wbr 5108  ran crn 5659  suc csuc 6390  ⟶1-1wf1 6563  ⟶1-1ontowf1o 6565   ≈ cen 9008   ≼ cdom 9009   ≺ csdm 9010  Fincfn 9011
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-om 7912  df-1o 8514  df-en 9012  df-dom 9013  df-sdom 9014  df-fin 9015
This theorem is used by:  sucdom  9273  card2inf  9586
  Copyright terms: Public domain W3C validator