Theorem fin23lem22 10364

Description: Lemma for fin23 10426 but could be used elsewhere if we find a good name for it. Explicit construction of a bijection (actually an isomorphism, see fin23lem27 10365) 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.

Step	Hyp	Ref	Expression
1		fin23lem22.b	. 2 ⊢ 𝐶 = (𝑖 ∈ ω ↦ (℩𝑗 ∈ 𝑆 (𝑗 ∩ 𝑆) ≈ 𝑖))
2		fin23lem23 10363	. . 3 ⊢ (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ 𝑖 ∈ ω) → ∃!𝑗 ∈ 𝑆 (𝑗 ∩ 𝑆) ≈ 𝑖)
3		riotacl 7404	. . 3 ⊢ (∃!𝑗 ∈ 𝑆 (𝑗 ∩ 𝑆) ≈ 𝑖 → (℩𝑗 ∈ 𝑆 (𝑗 ∩ 𝑆) ≈ 𝑖) ∈ 𝑆)
4	2, 3	syl 17	. 2 ⊢ (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ 𝑖 ∈ ω) → (℩𝑗 ∈ 𝑆 (𝑗 ∩ 𝑆) ≈ 𝑖) ∈ 𝑆)
5		simpll 767	. . . 4 ⊢ (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ 𝑎 ∈ 𝑆) → 𝑆 ⊆ ω)
6		simpr 484	. . . 4 ⊢ (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ 𝑎 ∈ 𝑆) → 𝑎 ∈ 𝑆)
7	5, 6	sseldd 3995	. . 3 ⊢ (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ 𝑎 ∈ 𝑆) → 𝑎 ∈ ω)
8		nnfi 9205	. . 3 ⊢ (𝑎 ∈ ω → 𝑎 ∈ Fin)
9		infi 9299	. . 3 ⊢ (𝑎 ∈ Fin → (𝑎 ∩ 𝑆) ∈ Fin)
10		ficardom 9998	. . 3 ⊢ ((𝑎 ∩ 𝑆) ∈ Fin → (card‘(𝑎 ∩ 𝑆)) ∈ ω)
11	7, 8, 9, 10	4syl 19	. 2 ⊢ (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ 𝑎 ∈ 𝑆) → (card‘(𝑎 ∩ 𝑆)) ∈ ω)
12		cardnn 10000	. . . . . . 7 ⊢ (𝑖 ∈ ω → (card‘𝑖) = 𝑖)
13	12	eqcomd 2740	. . . . . 6 ⊢ (𝑖 ∈ ω → 𝑖 = (card‘𝑖))
14	13	eqeq1d 2736	. . . . 5 ⊢ (𝑖 ∈ ω → (𝑖 = (card‘(𝑎 ∩ 𝑆)) ↔ (card‘𝑖) = (card‘(𝑎 ∩ 𝑆))))
15		eqcom 2741	. . . . 5 ⊢ ((card‘𝑖) = (card‘(𝑎 ∩ 𝑆)) ↔ (card‘(𝑎 ∩ 𝑆)) = (card‘𝑖))
16	14, 15	bitrdi 287	. . . 4 ⊢ (𝑖 ∈ ω → (𝑖 = (card‘(𝑎 ∩ 𝑆)) ↔ (card‘(𝑎 ∩ 𝑆)) = (card‘𝑖)))
17	16	ad2antrl 728	. . 3 ⊢ (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ (𝑖 ∈ ω ∧ 𝑎 ∈ 𝑆)) → (𝑖 = (card‘(𝑎 ∩ 𝑆)) ↔ (card‘(𝑎 ∩ 𝑆)) = (card‘𝑖)))
18		simpll 767	. . . . . . 7 ⊢ (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ (𝑖 ∈ ω ∧ 𝑎 ∈ 𝑆)) → 𝑆 ⊆ ω)
19		simprr 773	. . . . . . 7 ⊢ (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ (𝑖 ∈ ω ∧ 𝑎 ∈ 𝑆)) → 𝑎 ∈ 𝑆)
20	18, 19	sseldd 3995	. . . . . 6 ⊢ (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ (𝑖 ∈ ω ∧ 𝑎 ∈ 𝑆)) → 𝑎 ∈ ω)
21		nnon 7892	. . . . . 6 ⊢ (𝑎 ∈ ω → 𝑎 ∈ On)
22		onenon 9986	. . . . . 6 ⊢ (𝑎 ∈ On → 𝑎 ∈ dom card)
23	20, 21, 22	3syl 18	. . . . 5 ⊢ (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ (𝑖 ∈ ω ∧ 𝑎 ∈ 𝑆)) → 𝑎 ∈ dom card)
24		inss1 4244	. . . . 5 ⊢ (𝑎 ∩ 𝑆) ⊆ 𝑎
25		ssnum 10076	. . . . 5 ⊢ ((𝑎 ∈ dom card ∧ (𝑎 ∩ 𝑆) ⊆ 𝑎) → (𝑎 ∩ 𝑆) ∈ dom card)
26	23, 24, 25	sylancl 586	. . . 4 ⊢ (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ (𝑖 ∈ ω ∧ 𝑎 ∈ 𝑆)) → (𝑎 ∩ 𝑆) ∈ dom card)
27		nnon 7892	. . . . . 6 ⊢ (𝑖 ∈ ω → 𝑖 ∈ On)
28	27	ad2antrl 728	. . . . 5 ⊢ (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ (𝑖 ∈ ω ∧ 𝑎 ∈ 𝑆)) → 𝑖 ∈ On)
29		onenon 9986	. . . . 5 ⊢ (𝑖 ∈ On → 𝑖 ∈ dom card)
30	28, 29	syl 17	. . . 4 ⊢ (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ (𝑖 ∈ ω ∧ 𝑎 ∈ 𝑆)) → 𝑖 ∈ dom card)
31		carden2 10024	. . . 4 ⊢ (((𝑎 ∩ 𝑆) ∈ dom card ∧ 𝑖 ∈ dom card) → ((card‘(𝑎 ∩ 𝑆)) = (card‘𝑖) ↔ (𝑎 ∩ 𝑆) ≈ 𝑖))
32	26, 30, 31	syl2anc 584	. . 3 ⊢ (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ (𝑖 ∈ ω ∧ 𝑎 ∈ 𝑆)) → ((card‘(𝑎 ∩ 𝑆)) = (card‘𝑖) ↔ (𝑎 ∩ 𝑆) ≈ 𝑖))
33	2	adantrr 717	. . . . 5 ⊢ (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ (𝑖 ∈ ω ∧ 𝑎 ∈ 𝑆)) → ∃!𝑗 ∈ 𝑆 (𝑗 ∩ 𝑆) ≈ 𝑖)
34		ineq1 4220	. . . . . . 7 ⊢ (𝑗 = 𝑎 → (𝑗 ∩ 𝑆) = (𝑎 ∩ 𝑆))
35	34	breq1d 5157	. . . . . 6 ⊢ (𝑗 = 𝑎 → ((𝑗 ∩ 𝑆) ≈ 𝑖 ↔ (𝑎 ∩ 𝑆) ≈ 𝑖))
36	35	riota2 7412	. . . . 5 ⊢ ((𝑎 ∈ 𝑆 ∧ ∃!𝑗 ∈ 𝑆 (𝑗 ∩ 𝑆) ≈ 𝑖) → ((𝑎 ∩ 𝑆) ≈ 𝑖 ↔ (℩𝑗 ∈ 𝑆 (𝑗 ∩ 𝑆) ≈ 𝑖) = 𝑎))
37	19, 33, 36	syl2anc 584	. . . 4 ⊢ (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ (𝑖 ∈ ω ∧ 𝑎 ∈ 𝑆)) → ((𝑎 ∩ 𝑆) ≈ 𝑖 ↔ (℩𝑗 ∈ 𝑆 (𝑗 ∩ 𝑆) ≈ 𝑖) = 𝑎))
38		eqcom 2741	. . . 4 ⊢ ((℩𝑗 ∈ 𝑆 (𝑗 ∩ 𝑆) ≈ 𝑖) = 𝑎 ↔ 𝑎 = (℩𝑗 ∈ 𝑆 (𝑗 ∩ 𝑆) ≈ 𝑖))
39	37, 38	bitrdi 287	. . 3 ⊢ (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ (𝑖 ∈ ω ∧ 𝑎 ∈ 𝑆)) → ((𝑎 ∩ 𝑆) ≈ 𝑖 ↔ 𝑎 = (℩𝑗 ∈ 𝑆 (𝑗 ∩ 𝑆) ≈ 𝑖)))
40	17, 32, 39	3bitrd 305	. 2 ⊢ (((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) ∧ (𝑖 ∈ ω ∧ 𝑎 ∈ 𝑆)) → (𝑖 = (card‘(𝑎 ∩ 𝑆)) ↔ 𝑎 = (℩𝑗 ∈ 𝑆 (𝑗 ∩ 𝑆) ≈ 𝑖)))
41	1, 4, 11, 40	f1o2d 7686	1 ⊢ ((𝑆 ⊆ ω ∧ ¬ 𝑆 ∈ Fin) → 𝐶:ω–1-1-onto→𝑆)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1536   ∈ wcel 2105  ∃!wreu 3375   ∩ cin 3961   ⊆ wss 3962   class class class wbr 5147   ↦ cmpt 5230  dom cdm 5688  Oncon0 6385  –1-1-onto→wf1o 6561  ‘cfv 6562  ℩crio 7386  ωcom 7886   ≈ cen 8980  Fincfn 8983  cardccrd 9972

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1791  ax-4 1805  ax-5 1907  ax-6 1964  ax-7 2004  ax-8 2107  ax-9 2115  ax-10 2138  ax-11 2154  ax-12 2174  ax-ext 2705  ax-rep 5284  ax-sep 5301  ax-nul 5311  ax-pow 5370  ax-pr 5437  ax-un 7753

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1539  df-fal 1549  df-ex 1776  df-nf 1780  df-sb 2062  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2726  df-clel 2813  df-nfc 2889  df-ne 2938  df-ral 3059  df-rex 3068  df-rmo 3377  df-reu 3378  df-rab 3433  df-v 3479  df-sbc 3791  df-csb 3908  df-dif 3965  df-un 3967  df-in 3969  df-ss 3979  df-pss 3982  df-nul 4339  df-if 4531  df-pw 4606  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4912  df-int 4951  df-iun 4997  df-br 5148  df-opab 5210  df-mpt 5231  df-tr 5265  df-id 5582  df-eprel 5588  df-po 5596  df-so 5597  df-fr 5640  df-se 5641  df-we 5642  df-xp 5694  df-rel 5695  df-cnv 5696  df-co 5697  df-dm 5698  df-rn 5699  df-res 5700  df-ima 5701  df-pred 6322  df-ord 6388  df-on 6389  df-lim 6390  df-suc 6391  df-iota 6515  df-fun 6564  df-fn 6565  df-f 6566  df-f1 6567  df-fo 6568  df-f1o 6569  df-fv 6570  df-isom 6571  df-riota 7387  df-ov 7433  df-om 7887  df-2nd 8013  df-frecs 8304  df-wrecs 8335  df-recs 8409  df-1o 8504  df-er 8743  df-en 8984  df-dom 8985  df-sdom 8986  df-fin 8987  df-card 9976

This theorem is referenced by:  fin23lem27  10365  fin23lem28  10377  fin23lem30  10379  isf32lem6  10395  isf32lem7  10396  isf32lem8  10397