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

Theorem fin23lem22 9149
Description: Lemma for fin23 9211 but could be used elsewhere if we find a good name for it. Explicit construction of a bijection (actually an isomorphism, see fin23lem27 9150) between an infinite subset of ω and ω itself. (Contributed by Stefan O'Rear, 1-Nov-2014.)
Hypothesis
Ref Expression
fin23lem22.b 𝐶 = (𝑖 ∈ ω ↦ (𝑗𝑆 (𝑗𝑆) ≈ 𝑖))
Assertion
Ref Expression
fin23lem22 ((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) → 𝐶:ω–1-1-onto𝑆)
Distinct variable group:   𝑖,𝑗,𝑆
Allowed substitution hints:   𝐶(𝑖,𝑗)

Proof of Theorem fin23lem22
Dummy variable 𝑎 is distinct from all other variables.
StepHypRef Expression
1 fin23lem22.b . 2 𝐶 = (𝑖 ∈ ω ↦ (𝑗𝑆 (𝑗𝑆) ≈ 𝑖))
2 fin23lem23 9148 . . 3 (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ 𝑖 ∈ ω) → ∃!𝑗𝑆 (𝑗𝑆) ≈ 𝑖)
3 riotacl 6625 . . 3 (∃!𝑗𝑆 (𝑗𝑆) ≈ 𝑖 → (𝑗𝑆 (𝑗𝑆) ≈ 𝑖) ∈ 𝑆)
42, 3syl 17 . 2 (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ 𝑖 ∈ ω) → (𝑗𝑆 (𝑗𝑆) ≈ 𝑖) ∈ 𝑆)
5 simpll 790 . . . 4 (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ 𝑎𝑆) → 𝑆 ⊆ ω)
6 simpr 477 . . . 4 (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ 𝑎𝑆) → 𝑎𝑆)
75, 6sseldd 3604 . . 3 (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ 𝑎𝑆) → 𝑎 ∈ ω)
8 nnfi 8153 . . 3 (𝑎 ∈ ω → 𝑎 ∈ Fin)
9 infi 8184 . . 3 (𝑎 ∈ Fin → (𝑎𝑆) ∈ Fin)
10 ficardom 8787 . . 3 ((𝑎𝑆) ∈ Fin → (card‘(𝑎𝑆)) ∈ ω)
117, 8, 9, 104syl 19 . 2 (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ 𝑎𝑆) → (card‘(𝑎𝑆)) ∈ ω)
12 cardnn 8789 . . . . . . 7 (𝑖 ∈ ω → (card‘𝑖) = 𝑖)
1312eqcomd 2628 . . . . . 6 (𝑖 ∈ ω → 𝑖 = (card‘𝑖))
1413eqeq1d 2624 . . . . 5 (𝑖 ∈ ω → (𝑖 = (card‘(𝑎𝑆)) ↔ (card‘𝑖) = (card‘(𝑎𝑆))))
15 eqcom 2629 . . . . 5 ((card‘𝑖) = (card‘(𝑎𝑆)) ↔ (card‘(𝑎𝑆)) = (card‘𝑖))
1614, 15syl6bb 276 . . . 4 (𝑖 ∈ ω → (𝑖 = (card‘(𝑎𝑆)) ↔ (card‘(𝑎𝑆)) = (card‘𝑖)))
1716ad2antrl 764 . . 3 (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ (𝑖 ∈ ω ∧ 𝑎𝑆)) → (𝑖 = (card‘(𝑎𝑆)) ↔ (card‘(𝑎𝑆)) = (card‘𝑖)))
18 simpll 790 . . . . . . 7 (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ (𝑖 ∈ ω ∧ 𝑎𝑆)) → 𝑆 ⊆ ω)
19 simprr 796 . . . . . . 7 (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ (𝑖 ∈ ω ∧ 𝑎𝑆)) → 𝑎𝑆)
2018, 19sseldd 3604 . . . . . 6 (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ (𝑖 ∈ ω ∧ 𝑎𝑆)) → 𝑎 ∈ ω)
21 nnon 7071 . . . . . 6 (𝑎 ∈ ω → 𝑎 ∈ On)
22 onenon 8775 . . . . . 6 (𝑎 ∈ On → 𝑎 ∈ dom card)
2320, 21, 223syl 18 . . . . 5 (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ (𝑖 ∈ ω ∧ 𝑎𝑆)) → 𝑎 ∈ dom card)
24 inss1 3833 . . . . 5 (𝑎𝑆) ⊆ 𝑎
25 ssnum 8862 . . . . 5 ((𝑎 ∈ dom card ∧ (𝑎𝑆) ⊆ 𝑎) → (𝑎𝑆) ∈ dom card)
2623, 24, 25sylancl 694 . . . 4 (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ (𝑖 ∈ ω ∧ 𝑎𝑆)) → (𝑎𝑆) ∈ dom card)
27 nnon 7071 . . . . . 6 (𝑖 ∈ ω → 𝑖 ∈ On)
2827ad2antrl 764 . . . . 5 (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ (𝑖 ∈ ω ∧ 𝑎𝑆)) → 𝑖 ∈ On)
29 onenon 8775 . . . . 5 (𝑖 ∈ On → 𝑖 ∈ dom card)
3028, 29syl 17 . . . 4 (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ (𝑖 ∈ ω ∧ 𝑎𝑆)) → 𝑖 ∈ dom card)
31 carden2 8813 . . . 4 (((𝑎𝑆) ∈ dom card ∧ 𝑖 ∈ dom card) → ((card‘(𝑎𝑆)) = (card‘𝑖) ↔ (𝑎𝑆) ≈ 𝑖))
3226, 30, 31syl2anc 693 . . 3 (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ (𝑖 ∈ ω ∧ 𝑎𝑆)) → ((card‘(𝑎𝑆)) = (card‘𝑖) ↔ (𝑎𝑆) ≈ 𝑖))
332adantrr 753 . . . . 5 (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ (𝑖 ∈ ω ∧ 𝑎𝑆)) → ∃!𝑗𝑆 (𝑗𝑆) ≈ 𝑖)
34 ineq1 3807 . . . . . . 7 (𝑗 = 𝑎 → (𝑗𝑆) = (𝑎𝑆))
3534breq1d 4663 . . . . . 6 (𝑗 = 𝑎 → ((𝑗𝑆) ≈ 𝑖 ↔ (𝑎𝑆) ≈ 𝑖))
3635riota2 6633 . . . . 5 ((𝑎𝑆 ∧ ∃!𝑗𝑆 (𝑗𝑆) ≈ 𝑖) → ((𝑎𝑆) ≈ 𝑖 ↔ (𝑗𝑆 (𝑗𝑆) ≈ 𝑖) = 𝑎))
3719, 33, 36syl2anc 693 . . . 4 (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ (𝑖 ∈ ω ∧ 𝑎𝑆)) → ((𝑎𝑆) ≈ 𝑖 ↔ (𝑗𝑆 (𝑗𝑆) ≈ 𝑖) = 𝑎))
38 eqcom 2629 . . . 4 ((𝑗𝑆 (𝑗𝑆) ≈ 𝑖) = 𝑎𝑎 = (𝑗𝑆 (𝑗𝑆) ≈ 𝑖))
3937, 38syl6bb 276 . . 3 (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ (𝑖 ∈ ω ∧ 𝑎𝑆)) → ((𝑎𝑆) ≈ 𝑖𝑎 = (𝑗𝑆 (𝑗𝑆) ≈ 𝑖)))
4017, 32, 393bitrd 294 . 2 (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ (𝑖 ∈ ω ∧ 𝑎𝑆)) → (𝑖 = (card‘(𝑎𝑆)) ↔ 𝑎 = (𝑗𝑆 (𝑗𝑆) ≈ 𝑖)))
411, 4, 11, 40f1o2d 6887 1 ((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) → 𝐶:ω–1-1-onto𝑆)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 196  wa 384   = wceq 1483  wcel 1990  ∃!wreu 2914  cin 3573  wss 3574   class class class wbr 4653  cmpt 4729  dom cdm 5114  Oncon0 5723  1-1-ontowf1o 5887  cfv 5888  crio 6610  ωcom 7065  cen 7952  Fincfn 7955  cardccrd 8761
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-rep 4771  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-3or 1038  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-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-int 4476  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-se 5074  df-we 5075  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-pred 5680  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-isom 5897  df-riota 6611  df-om 7066  df-wrecs 7407  df-recs 7468  df-1o 7560  df-er 7742  df-en 7956  df-dom 7957  df-sdom 7958  df-fin 7959  df-card 8765
This theorem is referenced by:  fin23lem27  9150  fin23lem28  9162  fin23lem30  9164  isf32lem6  9180  isf32lem7  9181  isf32lem8  9182
  Copyright terms: Public domain W3C validator