Metamath Proof Explorer


Theorem uzin

Description: Intersection of two upper intervals of integers. (Contributed by Mario Carneiro, 24-Dec-2013)

Ref Expression
Assertion uzin ⊢ M ∈ ℤ ∧ N ∈ ℤ → ℤ ≥ M ∩ ℤ ≥ N = ℤ ≥ if M ≤ N N M

Proof

Step Hyp Ref Expression
1 uztric ⊢ M ∈ ℤ ∧ N ∈ ℤ → N ∈ ℤ ≥ M ∨ M ∈ ℤ ≥ N
2 uzss ⊢ N ∈ ℤ ≥ M → ℤ ≥ N ⊆ ℤ ≥ M
3 sseqin2 ⊢ ℤ ≥ N ⊆ ℤ ≥ M ↔ ℤ ≥ M ∩ ℤ ≥ N = ℤ ≥ N
4 2 3 sylib ⊢ N ∈ ℤ ≥ M → ℤ ≥ M ∩ ℤ ≥ N = ℤ ≥ N
5 eluzle ⊢ N ∈ ℤ ≥ M → M ≤ N
6 iftrue ⊢ M ≤ N → if M ≤ N N M = N
7 5 6 syl ⊢ N ∈ ℤ ≥ M → if M ≤ N N M = N
8 7 fveq2d ⊢ N ∈ ℤ ≥ M → ℤ ≥ if M ≤ N N M = ℤ ≥ N
9 4 8 eqtr4d ⊢ N ∈ ℤ ≥ M → ℤ ≥ M ∩ ℤ ≥ N = ℤ ≥ if M ≤ N N M
10 uzss ⊢ M ∈ ℤ ≥ N → ℤ ≥ M ⊆ ℤ ≥ N
11 dfss2 ⊢ ℤ ≥ M ⊆ ℤ ≥ N ↔ ℤ ≥ M ∩ ℤ ≥ N = ℤ ≥ M
12 10 11 sylib ⊢ M ∈ ℤ ≥ N → ℤ ≥ M ∩ ℤ ≥ N = ℤ ≥ M
13 eluzle ⊢ M ∈ ℤ ≥ N → N ≤ M
14 eluzel2 ⊢ M ∈ ℤ ≥ N → N ∈ ℤ
15 eluzelz ⊢ M ∈ ℤ ≥ N → M ∈ ℤ
16 zre ⊢ N ∈ ℤ → N ∈ ℝ
17 zre ⊢ M ∈ ℤ → M ∈ ℝ
18 letri3 ⊢ N ∈ ℝ ∧ M ∈ ℝ → N = M ↔ N ≤ M ∧ M ≤ N
19 16 17 18 syl2an ⊢ N ∈ ℤ ∧ M ∈ ℤ → N = M ↔ N ≤ M ∧ M ≤ N
20 14 15 19 syl2anc ⊢ M ∈ ℤ ≥ N → N = M ↔ N ≤ M ∧ M ≤ N
21 13 20 mpbirand ⊢ M ∈ ℤ ≥ N → N = M ↔ M ≤ N
22 21 biimprcd ⊢ M ≤ N → M ∈ ℤ ≥ N → N = M
23 6 eqeq1d ⊢ M ≤ N → if M ≤ N N M = M ↔ N = M
24 22 23 sylibrd ⊢ M ≤ N → M ∈ ℤ ≥ N → if M ≤ N N M = M
25 24 com12 ⊢ M ∈ ℤ ≥ N → M ≤ N → if M ≤ N N M = M
26 iffalse ⊢ ¬ M ≤ N → if M ≤ N N M = M
27 25 26 pm2.61d1 ⊢ M ∈ ℤ ≥ N → if M ≤ N N M = M
28 27 fveq2d ⊢ M ∈ ℤ ≥ N → ℤ ≥ if M ≤ N N M = ℤ ≥ M
29 12 28 eqtr4d ⊢ M ∈ ℤ ≥ N → ℤ ≥ M ∩ ℤ ≥ N = ℤ ≥ if M ≤ N N M
30 9 29 jaoi ⊢ N ∈ ℤ ≥ M ∨ M ∈ ℤ ≥ N → ℤ ≥ M ∩ ℤ ≥ N = ℤ ≥ if M ≤ N N M
31 1 30 syl ⊢ M ∈ ℤ ∧ N ∈ ℤ → ℤ ≥ M ∩ ℤ ≥ N = ℤ ≥ if M ≤ N N M