Theorem isinf2 37735

Description: The converse of isinf 9168. Any set that is not finite is literally infinite, in the sense that it contains subsets of arbitrarily large finite cardinality. (It cannot be proven that the set has countably infinite subsets unless AC is invoked.) The proof does not require the Axiom of Infinity. (Contributed by ML, 14-Dec-2020.)

Assertion

Ref	Expression
isinf2	⊢ (∀𝑛 ∈ ω ∃𝑥(𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝑛) → ¬ 𝐴 ∈ Fin)

Distinct variable group:   𝐴,𝑛,𝑥

Proof of Theorem isinf2

Step	Hyp	Ref	Expression
1		ssdomg 8940	. . . . . . . . 9 ⊢ (𝐴 ∈ V → (𝑥 ⊆ 𝐴 → 𝑥 ≼ 𝐴))
2	1	adantr 480	. . . . . . . 8 ⊢ ((𝐴 ∈ V ∧ 𝑥 ≈ 𝑛) → (𝑥 ⊆ 𝐴 → 𝑥 ≼ 𝐴))
3		domen1 9050	. . . . . . . . 9 ⊢ (𝑥 ≈ 𝑛 → (𝑥 ≼ 𝐴 ↔ 𝑛 ≼ 𝐴))
4	3	adantl 481	. . . . . . . 8 ⊢ ((𝐴 ∈ V ∧ 𝑥 ≈ 𝑛) → (𝑥 ≼ 𝐴 ↔ 𝑛 ≼ 𝐴))
5	2, 4	sylibd 239	. . . . . . 7 ⊢ ((𝐴 ∈ V ∧ 𝑥 ≈ 𝑛) → (𝑥 ⊆ 𝐴 → 𝑛 ≼ 𝐴))
6	5	expimpd 453	. . . . . 6 ⊢ (𝐴 ∈ V → ((𝑥 ≈ 𝑛 ∧ 𝑥 ⊆ 𝐴) → 𝑛 ≼ 𝐴))
7	6	ancomsd 465	. . . . 5 ⊢ (𝐴 ∈ V → ((𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝑛) → 𝑛 ≼ 𝐴))
8	7	exlimdv 1935	. . . 4 ⊢ (𝐴 ∈ V → (∃𝑥(𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝑛) → 𝑛 ≼ 𝐴))
9	8	ralimdv 3152	. . 3 ⊢ (𝐴 ∈ V → (∀𝑛 ∈ ω ∃𝑥(𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝑛) → ∀𝑛 ∈ ω 𝑛 ≼ 𝐴))
10		domalom 37734	. . 3 ⊢ (∀𝑛 ∈ ω 𝑛 ≼ 𝐴 → ¬ 𝐴 ∈ Fin)
11	9, 10	syl6 35	. 2 ⊢ (𝐴 ∈ V → (∀𝑛 ∈ ω ∃𝑥(𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝑛) → ¬ 𝐴 ∈ Fin))
12		prcnel 3456	. . 3 ⊢ (¬ 𝐴 ∈ V → ¬ 𝐴 ∈ Fin)
13	12	a1d 25	. 2 ⊢ (¬ 𝐴 ∈ V → (∀𝑛 ∈ ω ∃𝑥(𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝑛) → ¬ 𝐴 ∈ Fin))
14	11, 13	pm2.61i 182	1 ⊢ (∀𝑛 ∈ ω ∃𝑥(𝑥 ⊆ 𝐴 ∧ 𝑥 ≈ 𝑛) → ¬ 𝐴 ∈ Fin)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395  ∃wex 1781   ∈ wcel 2114  ∀wral 3052  Vcvv 3430   ⊆ wss 3890   class class class wbr 5086  ωcom 7810   ≈ cen 8883   ≼ cdom 8884  Fincfn 8886

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-om 7811  df-1o 8398  df-er 8636  df-en 8887  df-dom 8888  df-sdom 8889  df-fin 8890

This theorem is referenced by:  ctbssinf  37736