Theorem infpssr 10259

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 4422	. . 3 ⊢ (𝑋 ⊊ 𝐴 → ∃𝑦(𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ 𝑋))
2	1	adantr 484	. 2 ⊢ ((𝑋 ⊊ 𝐴 ∧ 𝑋 ≈ 𝐴) → ∃𝑦(𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ 𝑋))
3		eldif 3912	. . . 4 ⊢ (𝑦 ∈ (𝐴 ∖ 𝑋) ↔ (𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ 𝑋))
4		pssss 4049	. . . . . 6 ⊢ (𝑋 ⊊ 𝐴 → 𝑋 ⊆ 𝐴)
5		bren 8931	. . . . . . . 8 ⊢ (𝑋 ≈ 𝐴 ↔ ∃𝑓 𝑓:𝑋–1-1-onto→𝐴)
6		simpr 488	. . . . . . . . . . . . 13 ⊢ (((𝑦 ∈ (𝐴 ∖ 𝑋) ∧ 𝑋 ⊆ 𝐴) ∧ 𝑓:𝑋–1-1-onto→𝐴) → 𝑓:𝑋–1-1-onto→𝐴)
7		f1ofo 6809	. . . . . . . . . . . . 13 ⊢ (𝑓:𝑋–1-1-onto→𝐴 → 𝑓:𝑋–onto→𝐴)
8		forn 6776	. . . . . . . . . . . . 13 ⊢ (𝑓:𝑋–onto→𝐴 → ran 𝑓 = 𝐴)
9	6, 7, 8	3syl 18	. . . . . . . . . . . 12 ⊢ (((𝑦 ∈ (𝐴 ∖ 𝑋) ∧ 𝑋 ⊆ 𝐴) ∧ 𝑓:𝑋–1-1-onto→𝐴) → ran 𝑓 = 𝐴)
10		vex 3457	. . . . . . . . . . . . 13 ⊢ 𝑓 ∈ V
11	10	rnex 7886	. . . . . . . . . . . 12 ⊢ ran 𝑓 ∈ V
12	9, 11	eqeltrrdi 2870	. . . . . . . . . . 11 ⊢ (((𝑦 ∈ (𝐴 ∖ 𝑋) ∧ 𝑋 ⊆ 𝐴) ∧ 𝑓:𝑋–1-1-onto→𝐴) → 𝐴 ∈ V)
13		simplr 778	. . . . . . . . . . . 12 ⊢ (((𝑦 ∈ (𝐴 ∖ 𝑋) ∧ 𝑋 ⊆ 𝐴) ∧ 𝑓:𝑋–1-1-onto→𝐴) → 𝑋 ⊆ 𝐴)
14		simpll 776	. . . . . . . . . . . 12 ⊢ (((𝑦 ∈ (𝐴 ∖ 𝑋) ∧ 𝑋 ⊆ 𝐴) ∧ 𝑓:𝑋–1-1-onto→𝐴) → 𝑦 ∈ (𝐴 ∖ 𝑋))
15		eqid 2761	. . . . . . . . . . . 12 ⊢ (rec(◡𝑓, 𝑦) ↾ ω) = (rec(◡𝑓, 𝑦) ↾ ω)
16	13, 6, 14, 15	infpssrlem5 10258	. . . . . . . . . . 11 ⊢ (((𝑦 ∈ (𝐴 ∖ 𝑋) ∧ 𝑋 ⊆ 𝐴) ∧ 𝑓:𝑋–1-1-onto→𝐴) → (𝐴 ∈ V → ω ≼ 𝐴))
17	12, 16	mpd 15	. . . . . . . . . 10 ⊢ (((𝑦 ∈ (𝐴 ∖ 𝑋) ∧ 𝑋 ⊆ 𝐴) ∧ 𝑓:𝑋–1-1-onto→𝐴) → ω ≼ 𝐴)
18	17	ex 416	. . . . . . . . 9 ⊢ ((𝑦 ∈ (𝐴 ∖ 𝑋) ∧ 𝑋 ⊆ 𝐴) → (𝑓:𝑋–1-1-onto→𝐴 → ω ≼ 𝐴))
19	18	exlimdv 1952	. . . . . . . 8 ⊢ ((𝑦 ∈ (𝐴 ∖ 𝑋) ∧ 𝑋 ⊆ 𝐴) → (∃𝑓 𝑓:𝑋–1-1-onto→𝐴 → ω ≼ 𝐴))
20	5, 19	biimtrid 244	. . . . . . 7 ⊢ ((𝑦 ∈ (𝐴 ∖ 𝑋) ∧ 𝑋 ⊆ 𝐴) → (𝑋 ≈ 𝐴 → ω ≼ 𝐴))
21	20	ex 416	. . . . . 6 ⊢ (𝑦 ∈ (𝐴 ∖ 𝑋) → (𝑋 ⊆ 𝐴 → (𝑋 ≈ 𝐴 → ω ≼ 𝐴)))
22	4, 21	syl5 34	. . . . 5 ⊢ (𝑦 ∈ (𝐴 ∖ 𝑋) → (𝑋 ⊊ 𝐴 → (𝑋 ≈ 𝐴 → ω ≼ 𝐴)))
23	22	impd 414	. . . 4 ⊢ (𝑦 ∈ (𝐴 ∖ 𝑋) → ((𝑋 ⊊ 𝐴 ∧ 𝑋 ≈ 𝐴) → ω ≼ 𝐴))
24	3, 23	sylbir 237	. . 3 ⊢ ((𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ 𝑋) → ((𝑋 ⊊ 𝐴 ∧ 𝑋 ≈ 𝐴) → ω ≼ 𝐴))
25	24	exlimiv 1949	. 2 ⊢ (∃𝑦(𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ 𝑋) → ((𝑋 ⊊ 𝐴 ∧ 𝑋 ≈ 𝐴) → ω ≼ 𝐴))
26	2, 25	mpcom 38	1 ⊢ ((𝑋 ⊊ 𝐴 ∧ 𝑋 ≈ 𝐴) → ω ≼ 𝐴)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 399   = wceq 1559  ∃wex 1798   ∈ wcel 2141  Vcvv 3453   ∖ cdif 3899   ⊆ wss 3902   ⊊ wpss 3903   class class class wbr 5097  ^◡ccnv 5642  ran crn 5644   ↾ cres 5645  –onto→wfo 6514  –1-1-onto→wf1o 6515  ωcom 7841  reccrdg 8374   ≈ cen 8918   ≼ cdom 8919

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5224  ax-sep 5243  ax-nul 5253  ax-pr 5387  ax-un 7713

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-iun 4948  df-br 5098  df-opab 5160  df-mpt 5179  df-tr 5205  df-id 5538  df-eprel 5543  df-po 5551  df-so 5552  df-fr 5596  df-we 5598  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-rn 5654  df-res 5655  df-ima 5656  df-pred 6283  df-ord 6344  df-on 6345  df-lim 6346  df-suc 6347  df-iota 6472  df-fun 6518  df-fn 6519  df-f 6520  df-f1 6521  df-fo 6522  df-f1o 6523  df-fv 6524  df-ov 7394  df-om 7842  df-2nd 7966  df-frecs 8256  df-wrecs 8287  df-recs 8336  df-rdg 8375  df-en 8922  df-dom 8923

This theorem is referenced by:  isfin4-2  10265