Theorem infpssr 10298

Description: Dedekind infinity implies existence of a denumerable subset: take a single point witnessing the proper subset relation and iterate the embedding. (Contributed by Stefan O'Rear, 30-Oct-2014.) (Revised by Mario Carneiro, 16-May-2015.)

Assertion

Ref	Expression
infpssr	⊢ ((𝑋 ⊊ 𝐴 ∧ 𝑋 ≈ 𝐴) → ω ≼ 𝐴)

Proof of Theorem infpssr

Dummy variables 𝑦 𝑓 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		pssnel 4430	. . 3 ⊢ (𝑋 ⊊ 𝐴 → ∃𝑦(𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ 𝑋))
2	1	adantr 485	. 2 ⊢ ((𝑋 ⊊ 𝐴 ∧ 𝑋 ≈ 𝐴) → ∃𝑦(𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ 𝑋))
3		eldif 3914	. . . 4 ⊢ (𝑦 ∈ (𝐴 ∖ 𝑋) ↔ (𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ 𝑋))
4		pssss 4051	. . . . . 6 ⊢ (𝑋 ⊊ 𝐴 → 𝑋 ⊆ 𝐴)
5		bren 8951	. . . . . . . 8 ⊢ (𝑋 ≈ 𝐴 ↔ ∃𝑓 𝑓:𝑋–1-1-onto→𝐴)
6		simpr 489	. . . . . . . . . . . . 13 ⊢ (((𝑦 ∈ (𝐴 ∖ 𝑋) ∧ 𝑋 ⊆ 𝐴) ∧ 𝑓:𝑋–1-1-onto→𝐴) → 𝑓:𝑋–1-1-onto→𝐴)
7		f1ofo 6828	. . . . . . . . . . . . 13 ⊢ (𝑓:𝑋–1-1-onto→𝐴 → 𝑓:𝑋–onto→𝐴)
8		forn 6795	. . . . . . . . . . . . 13 ⊢ (𝑓:𝑋–onto→𝐴 → ran 𝑓 = 𝐴)
9	6, 7, 8	3syl 19	. . . . . . . . . . . 12 ⊢ (((𝑦 ∈ (𝐴 ∖ 𝑋) ∧ 𝑋 ⊆ 𝐴) ∧ 𝑓:𝑋–1-1-onto→𝐴) → ran 𝑓 = 𝐴)
10		vex 3458	. . . . . . . . . . . . 13 ⊢ 𝑓 ∈ V
11	10	rnex 7905	. . . . . . . . . . . 12 ⊢ ran 𝑓 ∈ V
12	9, 11	eqeltrrdi 2871	. . . . . . . . . . 11 ⊢ (((𝑦 ∈ (𝐴 ∖ 𝑋) ∧ 𝑋 ⊆ 𝐴) ∧ 𝑓:𝑋–1-1-onto→𝐴) → 𝐴 ∈ V)
13		simplr 780	. . . . . . . . . . . 12 ⊢ (((𝑦 ∈ (𝐴 ∖ 𝑋) ∧ 𝑋 ⊆ 𝐴) ∧ 𝑓:𝑋–1-1-onto→𝐴) → 𝑋 ⊆ 𝐴)
14		simpll 778	. . . . . . . . . . . 12 ⊢ (((𝑦 ∈ (𝐴 ∖ 𝑋) ∧ 𝑋 ⊆ 𝐴) ∧ 𝑓:𝑋–1-1-onto→𝐴) → 𝑦 ∈ (𝐴 ∖ 𝑋))
15		eqid 2762	. . . . . . . . . . . 12 ⊢ (rec(◡𝑓, 𝑦) ↾ ω) = (rec(◡𝑓, 𝑦) ↾ ω)
16	13, 6, 14, 15	infpssrlem5 10297	. . . . . . . . . . 11 ⊢ (((𝑦 ∈ (𝐴 ∖ 𝑋) ∧ 𝑋 ⊆ 𝐴) ∧ 𝑓:𝑋–1-1-onto→𝐴) → (𝐴 ∈ V → ω ≼ 𝐴))
17	12, 16	mpd 16	. . . . . . . . . 10 ⊢ (((𝑦 ∈ (𝐴 ∖ 𝑋) ∧ 𝑋 ⊆ 𝐴) ∧ 𝑓:𝑋–1-1-onto→𝐴) → ω ≼ 𝐴)
18	17	ex 417	. . . . . . . . 9 ⊢ ((𝑦 ∈ (𝐴 ∖ 𝑋) ∧ 𝑋 ⊆ 𝐴) → (𝑓:𝑋–1-1-onto→𝐴 → ω ≼ 𝐴))
19	18	exlimdv 1962	. . . . . . . 8 ⊢ ((𝑦 ∈ (𝐴 ∖ 𝑋) ∧ 𝑋 ⊆ 𝐴) → (∃𝑓 𝑓:𝑋–1-1-onto→𝐴 → ω ≼ 𝐴))
20	5, 19	biimtrid 245	. . . . . . 7 ⊢ ((𝑦 ∈ (𝐴 ∖ 𝑋) ∧ 𝑋 ⊆ 𝐴) → (𝑋 ≈ 𝐴 → ω ≼ 𝐴))
21	20	ex 417	. . . . . 6 ⊢ (𝑦 ∈ (𝐴 ∖ 𝑋) → (𝑋 ⊆ 𝐴 → (𝑋 ≈ 𝐴 → ω ≼ 𝐴)))
22	4, 21	syl5 35	. . . . 5 ⊢ (𝑦 ∈ (𝐴 ∖ 𝑋) → (𝑋 ⊊ 𝐴 → (𝑋 ≈ 𝐴 → ω ≼ 𝐴)))
23	22	impd 415	. . . 4 ⊢ (𝑦 ∈ (𝐴 ∖ 𝑋) → ((𝑋 ⊊ 𝐴 ∧ 𝑋 ≈ 𝐴) → ω ≼ 𝐴))
24	3, 23	sylbir 238	. . 3 ⊢ ((𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ 𝑋) → ((𝑋 ⊊ 𝐴 ∧ 𝑋 ≈ 𝐴) → ω ≼ 𝐴))
25	24	exlimiv 1959	. 2 ⊢ (∃𝑦(𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ 𝑋) → ((𝑋 ⊊ 𝐴 ∧ 𝑋 ≈ 𝐴) → ω ≼ 𝐴))
26	2, 25	mpcom 39	1 ⊢ ((𝑋 ⊊ 𝐴 ∧ 𝑋 ≈ 𝐴) → ω ≼ 𝐴)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 400   = wceq 1569  ∃wex 1808   ∈ wcel 2142  Vcvv 3454   ∖ cdif 3901   ⊆ wss 3904   ⊊ wpss 3905   class class class wbr 5108  ^◡ccnv 5659  ran crn 5661   ↾ cres 5662  –onto→wfo 6534  –1-1-onto→wf1o 6535  ωcom 7860  reccrdg 8394   ≈ cen 8938   ≼ cdom 8939

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pr 5403  ax-un 7734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1103  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5555  df-eprel 5560  df-po 5568  df-so 5569  df-fr 5613  df-we 5615  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7415  df-om 7861  df-2nd 7985  df-frecs 8276  df-wrecs 8307  df-recs 8356  df-rdg 8395  df-en 8942  df-dom 8943

This theorem is used by:  isfin4-2  10304