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

Theorem sucdom2 8156
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.)
Assertion
Ref Expression
sucdom2 (𝐴𝐵 → suc 𝐴𝐵)

Proof of Theorem sucdom2
Dummy variables 𝑤 𝑓 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 sdomdom 7983 . . 3 (𝐴𝐵𝐴𝐵)
2 brdomi 7966 . . 3 (𝐴𝐵 → ∃𝑓 𝑓:𝐴1-1𝐵)
31, 2syl 17 . 2 (𝐴𝐵 → ∃𝑓 𝑓:𝐴1-1𝐵)
4 relsdom 7962 . . . . . . 7 Rel ≺
54brrelexi 5158 . . . . . 6 (𝐴𝐵𝐴 ∈ V)
65adantr 481 . . . . 5 ((𝐴𝐵𝑓:𝐴1-1𝐵) → 𝐴 ∈ V)
7 vex 3203 . . . . . . 7 𝑓 ∈ V
87rnex 7100 . . . . . 6 ran 𝑓 ∈ V
98a1i 11 . . . . 5 ((𝐴𝐵𝑓:𝐴1-1𝐵) → ran 𝑓 ∈ V)
10 f1f1orn 6148 . . . . . . 7 (𝑓:𝐴1-1𝐵𝑓:𝐴1-1-onto→ran 𝑓)
1110adantl 482 . . . . . 6 ((𝐴𝐵𝑓:𝐴1-1𝐵) → 𝑓:𝐴1-1-onto→ran 𝑓)
12 f1of1 6136 . . . . . 6 (𝑓:𝐴1-1-onto→ran 𝑓𝑓:𝐴1-1→ran 𝑓)
1311, 12syl 17 . . . . 5 ((𝐴𝐵𝑓:𝐴1-1𝐵) → 𝑓:𝐴1-1→ran 𝑓)
14 f1dom2g 7973 . . . . 5 ((𝐴 ∈ V ∧ ran 𝑓 ∈ V ∧ 𝑓:𝐴1-1→ran 𝑓) → 𝐴 ≼ ran 𝑓)
156, 9, 13, 14syl3anc 1326 . . . 4 ((𝐴𝐵𝑓:𝐴1-1𝐵) → 𝐴 ≼ ran 𝑓)
16 sdomnen 7984 . . . . . . . 8 (𝐴𝐵 → ¬ 𝐴𝐵)
1716adantr 481 . . . . . . 7 ((𝐴𝐵𝑓:𝐴1-1𝐵) → ¬ 𝐴𝐵)
18 ssdif0 3942 . . . . . . . 8 (𝐵 ⊆ ran 𝑓 ↔ (𝐵 ∖ ran 𝑓) = ∅)
19 simplr 792 . . . . . . . . . . 11 (((𝐴𝐵𝑓:𝐴1-1𝐵) ∧ 𝐵 ⊆ ran 𝑓) → 𝑓:𝐴1-1𝐵)
20 f1f 6101 . . . . . . . . . . . . . . 15 (𝑓:𝐴1-1𝐵𝑓:𝐴𝐵)
21 df-f 5892 . . . . . . . . . . . . . . 15 (𝑓:𝐴𝐵 ↔ (𝑓 Fn 𝐴 ∧ ran 𝑓𝐵))
2220, 21sylib 208 . . . . . . . . . . . . . 14 (𝑓:𝐴1-1𝐵 → (𝑓 Fn 𝐴 ∧ ran 𝑓𝐵))
2322simprd 479 . . . . . . . . . . . . 13 (𝑓:𝐴1-1𝐵 → ran 𝑓𝐵)
2419, 23syl 17 . . . . . . . . . . . 12 (((𝐴𝐵𝑓:𝐴1-1𝐵) ∧ 𝐵 ⊆ ran 𝑓) → ran 𝑓𝐵)
25 simpr 477 . . . . . . . . . . . 12 (((𝐴𝐵𝑓:𝐴1-1𝐵) ∧ 𝐵 ⊆ ran 𝑓) → 𝐵 ⊆ ran 𝑓)
2624, 25eqssd 3620 . . . . . . . . . . 11 (((𝐴𝐵𝑓:𝐴1-1𝐵) ∧ 𝐵 ⊆ ran 𝑓) → ran 𝑓 = 𝐵)
27 dff1o5 6146 . . . . . . . . . . 11 (𝑓:𝐴1-1-onto𝐵 ↔ (𝑓:𝐴1-1𝐵 ∧ ran 𝑓 = 𝐵))
2819, 26, 27sylanbrc 698 . . . . . . . . . 10 (((𝐴𝐵𝑓:𝐴1-1𝐵) ∧ 𝐵 ⊆ ran 𝑓) → 𝑓:𝐴1-1-onto𝐵)
29 f1oen3g 7971 . . . . . . . . . 10 ((𝑓 ∈ V ∧ 𝑓:𝐴1-1-onto𝐵) → 𝐴𝐵)
307, 28, 29sylancr 695 . . . . . . . . 9 (((𝐴𝐵𝑓:𝐴1-1𝐵) ∧ 𝐵 ⊆ ran 𝑓) → 𝐴𝐵)
3130ex 450 . . . . . . . 8 ((𝐴𝐵𝑓:𝐴1-1𝐵) → (𝐵 ⊆ ran 𝑓𝐴𝐵))
3218, 31syl5bir 233 . . . . . . 7 ((𝐴𝐵𝑓:𝐴1-1𝐵) → ((𝐵 ∖ ran 𝑓) = ∅ → 𝐴𝐵))
3317, 32mtod 189 . . . . . 6 ((𝐴𝐵𝑓:𝐴1-1𝐵) → ¬ (𝐵 ∖ ran 𝑓) = ∅)
34 neq0 3930 . . . . . 6 (¬ (𝐵 ∖ ran 𝑓) = ∅ ↔ ∃𝑤 𝑤 ∈ (𝐵 ∖ ran 𝑓))
3533, 34sylib 208 . . . . 5 ((𝐴𝐵𝑓:𝐴1-1𝐵) → ∃𝑤 𝑤 ∈ (𝐵 ∖ ran 𝑓))
36 snssi 4339 . . . . . . 7 (𝑤 ∈ (𝐵 ∖ ran 𝑓) → {𝑤} ⊆ (𝐵 ∖ ran 𝑓))
37 vex 3203 . . . . . . . . 9 𝑤 ∈ V
38 en2sn 8037 . . . . . . . . 9 ((𝐴 ∈ V ∧ 𝑤 ∈ V) → {𝐴} ≈ {𝑤})
396, 37, 38sylancl 694 . . . . . . . 8 ((𝐴𝐵𝑓:𝐴1-1𝐵) → {𝐴} ≈ {𝑤})
404brrelex2i 5159 . . . . . . . . . 10 (𝐴𝐵𝐵 ∈ V)
4140adantr 481 . . . . . . . . 9 ((𝐴𝐵𝑓:𝐴1-1𝐵) → 𝐵 ∈ V)
42 difexg 4808 . . . . . . . . 9 (𝐵 ∈ V → (𝐵 ∖ ran 𝑓) ∈ V)
43 ssdomg 8001 . . . . . . . . 9 ((𝐵 ∖ ran 𝑓) ∈ V → ({𝑤} ⊆ (𝐵 ∖ ran 𝑓) → {𝑤} ≼ (𝐵 ∖ ran 𝑓)))
4441, 42, 433syl 18 . . . . . . . 8 ((𝐴𝐵𝑓:𝐴1-1𝐵) → ({𝑤} ⊆ (𝐵 ∖ ran 𝑓) → {𝑤} ≼ (𝐵 ∖ ran 𝑓)))
45 endomtr 8014 . . . . . . . 8 (({𝐴} ≈ {𝑤} ∧ {𝑤} ≼ (𝐵 ∖ ran 𝑓)) → {𝐴} ≼ (𝐵 ∖ ran 𝑓))
4639, 44, 45syl6an 568 . . . . . . 7 ((𝐴𝐵𝑓:𝐴1-1𝐵) → ({𝑤} ⊆ (𝐵 ∖ ran 𝑓) → {𝐴} ≼ (𝐵 ∖ ran 𝑓)))
4736, 46syl5 34 . . . . . 6 ((𝐴𝐵𝑓:𝐴1-1𝐵) → (𝑤 ∈ (𝐵 ∖ ran 𝑓) → {𝐴} ≼ (𝐵 ∖ ran 𝑓)))
4847exlimdv 1861 . . . . 5 ((𝐴𝐵𝑓:𝐴1-1𝐵) → (∃𝑤 𝑤 ∈ (𝐵 ∖ ran 𝑓) → {𝐴} ≼ (𝐵 ∖ ran 𝑓)))
4935, 48mpd 15 . . . 4 ((𝐴𝐵𝑓:𝐴1-1𝐵) → {𝐴} ≼ (𝐵 ∖ ran 𝑓))
50 disjdif 4040 . . . . 5 (ran 𝑓 ∩ (𝐵 ∖ ran 𝑓)) = ∅
5150a1i 11 . . . 4 ((𝐴𝐵𝑓:𝐴1-1𝐵) → (ran 𝑓 ∩ (𝐵 ∖ ran 𝑓)) = ∅)
52 undom 8048 . . . 4 (((𝐴 ≼ ran 𝑓 ∧ {𝐴} ≼ (𝐵 ∖ ran 𝑓)) ∧ (ran 𝑓 ∩ (𝐵 ∖ ran 𝑓)) = ∅) → (𝐴 ∪ {𝐴}) ≼ (ran 𝑓 ∪ (𝐵 ∖ ran 𝑓)))
5315, 49, 51, 52syl21anc 1325 . . 3 ((𝐴𝐵𝑓:𝐴1-1𝐵) → (𝐴 ∪ {𝐴}) ≼ (ran 𝑓 ∪ (𝐵 ∖ ran 𝑓)))
54 df-suc 5729 . . . 4 suc 𝐴 = (𝐴 ∪ {𝐴})
5554a1i 11 . . 3 ((𝐴𝐵𝑓:𝐴1-1𝐵) → suc 𝐴 = (𝐴 ∪ {𝐴}))
56 undif2 4044 . . . 4 (ran 𝑓 ∪ (𝐵 ∖ ran 𝑓)) = (ran 𝑓𝐵)
5723adantl 482 . . . . 5 ((𝐴𝐵𝑓:𝐴1-1𝐵) → ran 𝑓𝐵)
58 ssequn1 3783 . . . . 5 (ran 𝑓𝐵 ↔ (ran 𝑓𝐵) = 𝐵)
5957, 58sylib 208 . . . 4 ((𝐴𝐵𝑓:𝐴1-1𝐵) → (ran 𝑓𝐵) = 𝐵)
6056, 59syl5req 2669 . . 3 ((𝐴𝐵𝑓:𝐴1-1𝐵) → 𝐵 = (ran 𝑓 ∪ (𝐵 ∖ ran 𝑓)))
6153, 55, 603brtr4d 4685 . 2 ((𝐴𝐵𝑓:𝐴1-1𝐵) → suc 𝐴𝐵)
623, 61exlimddv 1863 1 (𝐴𝐵 → suc 𝐴𝐵)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 384   = wceq 1483  wex 1704  wcel 1990  Vcvv 3200  cdif 3571  cun 3572  cin 3573  wss 3574  c0 3915  {csn 4177   class class class wbr 4653  ran crn 5115  suc csuc 5725   Fn wfn 5883  wf 5884  1-1wf1 5885  1-1-ontowf1o 5887  cen 7952  cdom 7953  csdm 7954
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-suc 5729  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-1o 7560  df-er 7742  df-en 7956  df-dom 7957  df-sdom 7958
This theorem is referenced by:  sucdom  8157  card2inf  8460
  Copyright terms: Public domain W3C validator