Theorem allbutfi 45844

Description: For all but finitely many. Some authors say "cofinitely many". Some authors say "ultimately". Compare with eliuniin 45551 and eliuniin2 45572 (here, the precondition can be dropped; see eliuniincex 45561). (Contributed by Glauco Siliprandi, 26-Jun-2021.)

Hypotheses

Ref	Expression
allbutfi.z	⊢ 𝑍 = (ℤ≥‘𝑀)
allbutfi.a	⊢ 𝐴 = ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)𝐵

Assertion

Ref	Expression
allbutfi	⊢ (𝑋 ∈ 𝐴 ↔ ∃𝑛 ∈ 𝑍 ∀𝑚 ∈ (ℤ≥‘𝑛)𝑋 ∈ 𝐵)

Distinct variable group:   𝑚,𝑋,𝑛

Allowed substitution hints:   𝐴(𝑚,𝑛)   𝐵(𝑚,𝑛)   𝑀(𝑚,𝑛)   𝑍(𝑚,𝑛)

Proof of Theorem allbutfi

Step	Hyp	Ref	Expression
1		allbutfi.a	. . . . . 6 ⊢ 𝐴 = ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)𝐵
2	1	eleq2i 2829	. . . . 5 ⊢ (𝑋 ∈ 𝐴 ↔ 𝑋 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)𝐵)
3	2	biimpi 216	. . . 4 ⊢ (𝑋 ∈ 𝐴 → 𝑋 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)𝐵)
4		eliun 4938	. . . 4 ⊢ (𝑋 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)𝐵 ↔ ∃𝑛 ∈ 𝑍 𝑋 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)𝐵)
5	3, 4	sylib 218	. . 3 ⊢ (𝑋 ∈ 𝐴 → ∃𝑛 ∈ 𝑍 𝑋 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)𝐵)
6		nfcv 2899	. . . . 5 ⊢ Ⅎ𝑛𝑋
7		nfiu1 4970	. . . . . 6 ⊢ Ⅎ𝑛∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)𝐵
8	1, 7	nfcxfr 2897	. . . . 5 ⊢ Ⅎ𝑛𝐴
9	6, 8	nfel 2914	. . . 4 ⊢ Ⅎ𝑛 𝑋 ∈ 𝐴
10		eliin 4939	. . . . . 6 ⊢ (𝑋 ∈ 𝐴 → (𝑋 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)𝐵 ↔ ∀𝑚 ∈ (ℤ≥‘𝑛)𝑋 ∈ 𝐵))
11	10	biimpd 229	. . . . 5 ⊢ (𝑋 ∈ 𝐴 → (𝑋 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)𝐵 → ∀𝑚 ∈ (ℤ≥‘𝑛)𝑋 ∈ 𝐵))
12	11	a1d 25	. . . 4 ⊢ (𝑋 ∈ 𝐴 → (𝑛 ∈ 𝑍 → (𝑋 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)𝐵 → ∀𝑚 ∈ (ℤ≥‘𝑛)𝑋 ∈ 𝐵)))
13	9, 12	reximdai 3240	. . 3 ⊢ (𝑋 ∈ 𝐴 → (∃𝑛 ∈ 𝑍 𝑋 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)𝐵 → ∃𝑛 ∈ 𝑍 ∀𝑚 ∈ (ℤ≥‘𝑛)𝑋 ∈ 𝐵))
14	5, 13	mpd 15	. 2 ⊢ (𝑋 ∈ 𝐴 → ∃𝑛 ∈ 𝑍 ∀𝑚 ∈ (ℤ≥‘𝑛)𝑋 ∈ 𝐵)
15		simpr 484	. . . . . . 7 ⊢ ((𝑛 ∈ 𝑍 ∧ ∀𝑚 ∈ (ℤ≥‘𝑛)𝑋 ∈ 𝐵) → ∀𝑚 ∈ (ℤ≥‘𝑛)𝑋 ∈ 𝐵)
16		allbutfi.z	. . . . . . . . . . . . 13 ⊢ 𝑍 = (ℤ≥‘𝑀)
17	16	eleq2i 2829	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ 𝑍 ↔ 𝑛 ∈ (ℤ≥‘𝑀))
18	17	biimpi 216	. . . . . . . . . . 11 ⊢ (𝑛 ∈ 𝑍 → 𝑛 ∈ (ℤ≥‘𝑀))
19		eluzelz 12793	. . . . . . . . . . 11 ⊢ (𝑛 ∈ (ℤ≥‘𝑀) → 𝑛 ∈ ℤ)
20		uzid 12798	. . . . . . . . . . 11 ⊢ (𝑛 ∈ ℤ → 𝑛 ∈ (ℤ≥‘𝑛))
21	18, 19, 20	3syl 18	. . . . . . . . . 10 ⊢ (𝑛 ∈ 𝑍 → 𝑛 ∈ (ℤ≥‘𝑛))
22	21	ne0d 4283	. . . . . . . . 9 ⊢ (𝑛 ∈ 𝑍 → (ℤ≥‘𝑛) ≠ ∅)
23		eliin2 45568	. . . . . . . . 9 ⊢ ((ℤ≥‘𝑛) ≠ ∅ → (𝑋 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)𝐵 ↔ ∀𝑚 ∈ (ℤ≥‘𝑛)𝑋 ∈ 𝐵))
24	22, 23	syl 17	. . . . . . . 8 ⊢ (𝑛 ∈ 𝑍 → (𝑋 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)𝐵 ↔ ∀𝑚 ∈ (ℤ≥‘𝑛)𝑋 ∈ 𝐵))
25	24	adantr 480	. . . . . . 7 ⊢ ((𝑛 ∈ 𝑍 ∧ ∀𝑚 ∈ (ℤ≥‘𝑛)𝑋 ∈ 𝐵) → (𝑋 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)𝐵 ↔ ∀𝑚 ∈ (ℤ≥‘𝑛)𝑋 ∈ 𝐵))
26	15, 25	mpbird 257	. . . . . 6 ⊢ ((𝑛 ∈ 𝑍 ∧ ∀𝑚 ∈ (ℤ≥‘𝑛)𝑋 ∈ 𝐵) → 𝑋 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)𝐵)
27	26	ex 412	. . . . 5 ⊢ (𝑛 ∈ 𝑍 → (∀𝑚 ∈ (ℤ≥‘𝑛)𝑋 ∈ 𝐵 → 𝑋 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)𝐵))
28	27	reximia 3073	. . . 4 ⊢ (∃𝑛 ∈ 𝑍 ∀𝑚 ∈ (ℤ≥‘𝑛)𝑋 ∈ 𝐵 → ∃𝑛 ∈ 𝑍 𝑋 ∈ ∩ 𝑚 ∈ (ℤ≥‘𝑛)𝐵)
29	28, 4	sylibr 234	. . 3 ⊢ (∃𝑛 ∈ 𝑍 ∀𝑚 ∈ (ℤ≥‘𝑛)𝑋 ∈ 𝐵 → 𝑋 ∈ ∪ 𝑛 ∈ 𝑍 ∩ 𝑚 ∈ (ℤ≥‘𝑛)𝐵)
30	29, 1	eleqtrrdi 2848	. 2 ⊢ (∃𝑛 ∈ 𝑍 ∀𝑚 ∈ (ℤ≥‘𝑛)𝑋 ∈ 𝐵 → 𝑋 ∈ 𝐴)
31	14, 30	impbii 209	1 ⊢ (𝑋 ∈ 𝐴 ↔ ∃𝑛 ∈ 𝑍 ∀𝑚 ∈ (ℤ≥‘𝑛)𝑋 ∈ 𝐵)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114   ≠ wne 2933  ∀wral 3052  ∃wrex 3062  ∅c0 4274  ∪ ciun 4934  ∩ ciin 4935  ‘cfv 6494  ℤcz 12519  ℤ_≥cuz 12783

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 5232  ax-nul 5242  ax-pow 5304  ax-pr 5372  ax-un 7684  ax-cnex 11089  ax-resscn 11090  ax-pre-lttri 11107

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-nel 3038  df-ral 3053  df-rex 3063  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-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-iin 4937  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5521  df-xp 5632  df-rel 5633  df-cnv 5634  df-co 5635  df-dm 5636  df-rn 5637  df-res 5638  df-ima 5639  df-iota 6450  df-fun 6496  df-fn 6497  df-f 6498  df-f1 6499  df-fo 6500  df-f1o 6501  df-fv 6502  df-ov 7365  df-er 8638  df-en 8889  df-dom 8890  df-sdom 8891  df-pnf 11176  df-mnf 11177  df-xr 11178  df-ltxr 11179  df-le 11180  df-neg 11375  df-z 12520  df-uz 12784

This theorem is referenced by:  allbutfiinf  45870  allbutfifvre  46125  smflimlem3  47223  smfliminflem  47280