Metamath Proof Explorer


Theorem uz11

Description: The upper integers function is one-to-one. (Contributed by NM, 12-Dec-2005)

Ref Expression
Assertion uz11 ⊢ M ∈ ℤ → ℤ ≥ M = ℤ ≥ N ↔ M = N

Proof

Step Hyp Ref Expression
1 uzid ⊢ M ∈ ℤ → M ∈ ℤ ≥ M
2 eleq2 ⊢ ℤ ≥ M = ℤ ≥ N → M ∈ ℤ ≥ M ↔ M ∈ ℤ ≥ N
3 eluzel2 ⊢ M ∈ ℤ ≥ N → N ∈ ℤ
4 2 3 biimtrdi ⊢ ℤ ≥ M = ℤ ≥ N → M ∈ ℤ ≥ M → N ∈ ℤ
5 1 4 mpan9 ⊢ M ∈ ℤ ∧ ℤ ≥ M = ℤ ≥ N → N ∈ ℤ
6 uzid ⊢ N ∈ ℤ → N ∈ ℤ ≥ N
7 eleq2 ⊢ ℤ ≥ M = ℤ ≥ N → N ∈ ℤ ≥ M ↔ N ∈ ℤ ≥ N
8 6 7 imbitrrid ⊢ ℤ ≥ M = ℤ ≥ N → N ∈ ℤ → N ∈ ℤ ≥ M
9 eluzle ⊢ N ∈ ℤ ≥ M → M ≤ N
10 8 9 syl6 ⊢ ℤ ≥ M = ℤ ≥ N → N ∈ ℤ → M ≤ N
11 1 2 imbitrid ⊢ ℤ ≥ M = ℤ ≥ N → M ∈ ℤ → M ∈ ℤ ≥ N
12 eluzle ⊢ M ∈ ℤ ≥ N → N ≤ M
13 11 12 syl6 ⊢ ℤ ≥ M = ℤ ≥ N → M ∈ ℤ → N ≤ M
14 10 13 anim12d ⊢ ℤ ≥ M = ℤ ≥ N → N ∈ ℤ ∧ M ∈ ℤ → M ≤ N ∧ N ≤ M
15 14 impl ⊢ ℤ ≥ M = ℤ ≥ N ∧ N ∈ ℤ ∧ M ∈ ℤ → M ≤ N ∧ N ≤ M
16 15 ancoms ⊢ M ∈ ℤ ∧ ℤ ≥ M = ℤ ≥ N ∧ N ∈ ℤ → M ≤ N ∧ N ≤ M
17 16 anassrs ⊢ M ∈ ℤ ∧ ℤ ≥ M = ℤ ≥ N ∧ N ∈ ℤ → M ≤ N ∧ N ≤ M
18 zre ⊢ M ∈ ℤ → M ∈ ℝ
19 zre ⊢ N ∈ ℤ → N ∈ ℝ
20 letri3 ⊢ M ∈ ℝ ∧ N ∈ ℝ → M = N ↔ M ≤ N ∧ N ≤ M
21 18 19 20 syl2an ⊢ M ∈ ℤ ∧ N ∈ ℤ → M = N ↔ M ≤ N ∧ N ≤ M
22 21 adantlr ⊢ M ∈ ℤ ∧ ℤ ≥ M = ℤ ≥ N ∧ N ∈ ℤ → M = N ↔ M ≤ N ∧ N ≤ M
23 17 22 mpbird ⊢ M ∈ ℤ ∧ ℤ ≥ M = ℤ ≥ N ∧ N ∈ ℤ → M = N
24 5 23 mpdan ⊢ M ∈ ℤ ∧ ℤ ≥ M = ℤ ≥ N → M = N
25 24 ex ⊢ M ∈ ℤ → ℤ ≥ M = ℤ ≥ N → M = N
26 fveq2 ⊢ M = N → ℤ ≥ M = ℤ ≥ N
27 25 26 impbid1 ⊢ M ∈ ℤ → ℤ ≥ M = ℤ ≥ N ↔ M = N