Metamath Proof Explorer


Theorem fzen2

Description: The cardinality of a finite set of sequential integers with arbitrary endpoints. (Contributed by Mario Carneiro, 13-Feb-2014)

Ref Expression
Hypothesis fzennn.1 ⊢ G = rec ⁡ x ∈ V ⟼ x + 1 0 ↾ ω
Assertion fzen2 ⊢ N ∈ ℤ ≥ M → M … N ≈ G -1 ⁡ N + 1 - M

Proof

Step Hyp Ref Expression
1 fzennn.1 ⊢ G = rec ⁡ x ∈ V ⟼ x + 1 0 ↾ ω
2 eluzel2 ⊢ N ∈ ℤ ≥ M → M ∈ ℤ
3 eluzelz ⊢ N ∈ ℤ ≥ M → N ∈ ℤ
4 1z ⊢ 1 ∈ ℤ
5 zsubcl ⊢ 1 ∈ ℤ ∧ M ∈ ℤ → 1 − M ∈ ℤ
6 4 2 5 sylancr ⊢ N ∈ ℤ ≥ M → 1 − M ∈ ℤ
7 fzen ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ 1 − M ∈ ℤ → M … N ≈ M + 1 - M … N + 1 - M
8 2 3 6 7 syl3anc ⊢ N ∈ ℤ ≥ M → M … N ≈ M + 1 - M … N + 1 - M
9 2 zcnd ⊢ N ∈ ℤ ≥ M → M ∈ ℂ
10 ax-1cn ⊢ 1 ∈ ℂ
11 pncan3 ⊢ M ∈ ℂ ∧ 1 ∈ ℂ → M + 1 - M = 1
12 9 10 11 sylancl ⊢ N ∈ ℤ ≥ M → M + 1 - M = 1
13 zcn ⊢ N ∈ ℤ → N ∈ ℂ
14 zcn ⊢ M ∈ ℤ → M ∈ ℂ
15 addsubass ⊢ N ∈ ℂ ∧ 1 ∈ ℂ ∧ M ∈ ℂ → N + 1 - M = N + 1 - M
16 10 15 mp3an2 ⊢ N ∈ ℂ ∧ M ∈ ℂ → N + 1 - M = N + 1 - M
17 13 14 16 syl2an ⊢ N ∈ ℤ ∧ M ∈ ℤ → N + 1 - M = N + 1 - M
18 3 2 17 syl2anc ⊢ N ∈ ℤ ≥ M → N + 1 - M = N + 1 - M
19 18 eqcomd ⊢ N ∈ ℤ ≥ M → N + 1 - M = N + 1 - M
20 12 19 oveq12d ⊢ N ∈ ℤ ≥ M → M + 1 - M … N + 1 - M = 1 … N + 1 - M
21 8 20 breqtrd ⊢ N ∈ ℤ ≥ M → M … N ≈ 1 … N + 1 - M
22 peano2uz ⊢ N ∈ ℤ ≥ M → N + 1 ∈ ℤ ≥ M
23 uznn0sub ⊢ N + 1 ∈ ℤ ≥ M → N + 1 - M ∈ ℕ 0
24 1 fzennn ⊢ N + 1 - M ∈ ℕ 0 → 1 … N + 1 - M ≈ G -1 ⁡ N + 1 - M
25 22 23 24 3syl ⊢ N ∈ ℤ ≥ M → 1 … N + 1 - M ≈ G -1 ⁡ N + 1 - M
26 entr ⊢ M … N ≈ 1 … N + 1 - M ∧ 1 … N + 1 - M ≈ G -1 ⁡ N + 1 - M → M … N ≈ G -1 ⁡ N + 1 - M
27 21 25 26 syl2anc ⊢ N ∈ ℤ ≥ M → M … N ≈ G -1 ⁡ N + 1 - M