Metamath Proof Explorer


Theorem allbutfiinf

Description: Given a "for all but finitely many" condition, the condition holds from N on. (Contributed by Glauco Siliprandi, 23-Oct-2021)

Ref Expression
Hypotheses allbutfiinf.z ⊢ Z = ℤ ≥ M
allbutfiinf.a ⊢ A = ⋃ n ∈ Z ⋂ m ∈ ℤ ≥ n B
allbutfiinf.x ⊢ φ → X ∈ A
allbutfiinf.n ⊢ N = inf n ∈ Z | ∀ m ∈ ℤ ≥ n X ∈ B ℝ <
Assertion allbutfiinf ⊢ φ → N ∈ Z ∧ ∀ m ∈ ℤ ≥ N X ∈ B

Proof

Step Hyp Ref Expression
1 allbutfiinf.z ⊢ Z = ℤ ≥ M
2 allbutfiinf.a ⊢ A = ⋃ n ∈ Z ⋂ m ∈ ℤ ≥ n B
3 allbutfiinf.x ⊢ φ → X ∈ A
4 allbutfiinf.n ⊢ N = inf n ∈ Z | ∀ m ∈ ℤ ≥ n X ∈ B ℝ <
5 ssrab2 ⊢ n ∈ Z | ∀ m ∈ ℤ ≥ n X ∈ B ⊆ Z
6 4 a1i ⊢ φ → N = inf n ∈ Z | ∀ m ∈ ℤ ≥ n X ∈ B ℝ <
7 5 1 sseqtri ⊢ n ∈ Z | ∀ m ∈ ℤ ≥ n X ∈ B ⊆ ℤ ≥ M
8 7 a1i ⊢ φ → n ∈ Z | ∀ m ∈ ℤ ≥ n X ∈ B ⊆ ℤ ≥ M
9 1 2 allbutfi ⊢ X ∈ A ↔ ∃ n ∈ Z ∀ m ∈ ℤ ≥ n X ∈ B
10 3 9 sylib ⊢ φ → ∃ n ∈ Z ∀ m ∈ ℤ ≥ n X ∈ B
11 nfrab1 ⊢ Ⅎ _ n n ∈ Z | ∀ m ∈ ℤ ≥ n X ∈ B
12 nfcv ⊢ Ⅎ _ n ∅
13 11 12 nfne ⊢ Ⅎ n n ∈ Z | ∀ m ∈ ℤ ≥ n X ∈ B ≠ ∅
14 rabid ⊢ n ∈ n ∈ Z | ∀ m ∈ ℤ ≥ n X ∈ B ↔ n ∈ Z ∧ ∀ m ∈ ℤ ≥ n X ∈ B
15 14 bicomi ⊢ n ∈ Z ∧ ∀ m ∈ ℤ ≥ n X ∈ B ↔ n ∈ n ∈ Z | ∀ m ∈ ℤ ≥ n X ∈ B
16 15 biimpi ⊢ n ∈ Z ∧ ∀ m ∈ ℤ ≥ n X ∈ B → n ∈ n ∈ Z | ∀ m ∈ ℤ ≥ n X ∈ B
17 16 ne0d ⊢ n ∈ Z ∧ ∀ m ∈ ℤ ≥ n X ∈ B → n ∈ Z | ∀ m ∈ ℤ ≥ n X ∈ B ≠ ∅
18 17 ex ⊢ n ∈ Z → ∀ m ∈ ℤ ≥ n X ∈ B → n ∈ Z | ∀ m ∈ ℤ ≥ n X ∈ B ≠ ∅
19 13 18 rexlimi ⊢ ∃ n ∈ Z ∀ m ∈ ℤ ≥ n X ∈ B → n ∈ Z | ∀ m ∈ ℤ ≥ n X ∈ B ≠ ∅
20 19 a1i ⊢ φ → ∃ n ∈ Z ∀ m ∈ ℤ ≥ n X ∈ B → n ∈ Z | ∀ m ∈ ℤ ≥ n X ∈ B ≠ ∅
21 10 20 mpd ⊢ φ → n ∈ Z | ∀ m ∈ ℤ ≥ n X ∈ B ≠ ∅
22 infssuzcl ⊢ n ∈ Z | ∀ m ∈ ℤ ≥ n X ∈ B ⊆ ℤ ≥ M ∧ n ∈ Z | ∀ m ∈ ℤ ≥ n X ∈ B ≠ ∅ → inf n ∈ Z | ∀ m ∈ ℤ ≥ n X ∈ B ℝ < ∈ n ∈ Z | ∀ m ∈ ℤ ≥ n X ∈ B
23 8 21 22 syl2anc ⊢ φ → inf n ∈ Z | ∀ m ∈ ℤ ≥ n X ∈ B ℝ < ∈ n ∈ Z | ∀ m ∈ ℤ ≥ n X ∈ B
24 6 23 eqeltrd ⊢ φ → N ∈ n ∈ Z | ∀ m ∈ ℤ ≥ n X ∈ B
25 5 24 sselid ⊢ φ → N ∈ Z
26 nfcv ⊢ Ⅎ _ n ℝ
27 nfcv ⊢ Ⅎ _ n <
28 11 26 27 nfinf ⊢ Ⅎ _ n inf n ∈ Z | ∀ m ∈ ℤ ≥ n X ∈ B ℝ <
29 4 28 nfcxfr ⊢ Ⅎ _ n N
30 nfcv ⊢ Ⅎ _ n Z
31 nfcv ⊢ Ⅎ _ n ℤ ≥
32 31 29 nffv ⊢ Ⅎ _ n ℤ ≥ N
33 nfv ⊢ Ⅎ n X ∈ B
34 32 33 nfralw ⊢ Ⅎ n ∀ m ∈ ℤ ≥ N X ∈ B
35 nfcv ⊢ Ⅎ _ m ℤ ≥ n
36 nfcv ⊢ Ⅎ _ m ℤ ≥
37 nfra1 ⊢ Ⅎ m ∀ m ∈ ℤ ≥ n X ∈ B
38 nfcv ⊢ Ⅎ _ m Z
39 37 38 nfrabw ⊢ Ⅎ _ m n ∈ Z | ∀ m ∈ ℤ ≥ n X ∈ B
40 nfcv ⊢ Ⅎ _ m ℝ
41 nfcv ⊢ Ⅎ _ m <
42 39 40 41 nfinf ⊢ Ⅎ _ m inf n ∈ Z | ∀ m ∈ ℤ ≥ n X ∈ B ℝ <
43 4 42 nfcxfr ⊢ Ⅎ _ m N
44 36 43 nffv ⊢ Ⅎ _ m ℤ ≥ N
45 fveq2 ⊢ n = N → ℤ ≥ n = ℤ ≥ N
46 35 44 45 raleqd ⊢ n = N → ∀ m ∈ ℤ ≥ n X ∈ B ↔ ∀ m ∈ ℤ ≥ N X ∈ B
47 29 30 34 46 elrabf ⊢ N ∈ n ∈ Z | ∀ m ∈ ℤ ≥ n X ∈ B ↔ N ∈ Z ∧ ∀ m ∈ ℤ ≥ N X ∈ B
48 47 biimpi ⊢ N ∈ n ∈ Z | ∀ m ∈ ℤ ≥ n X ∈ B → N ∈ Z ∧ ∀ m ∈ ℤ ≥ N X ∈ B
49 48 simprd ⊢ N ∈ n ∈ Z | ∀ m ∈ ℤ ≥ n X ∈ B → ∀ m ∈ ℤ ≥ N X ∈ B
50 24 49 syl ⊢ φ → ∀ m ∈ ℤ ≥ N X ∈ B
51 25 50 jca ⊢ φ → N ∈ Z ∧ ∀ m ∈ ℤ ≥ N X ∈ B