Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > fzdisj | GIF version |
Description: Condition for two finite intervals of integers to be disjoint. (Contributed by Jeff Madsen, 17-Jun-2010.) |
Ref | Expression |
---|---|
fzdisj | ⊢ (𝐾 < 𝑀 → ((𝐽...𝐾) ∩ (𝑀...𝑁)) = ∅) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elin 3126 | . . . 4 ⊢ (𝑥 ∈ ((𝐽...𝐾) ∩ (𝑀...𝑁)) ↔ (𝑥 ∈ (𝐽...𝐾) ∧ 𝑥 ∈ (𝑀...𝑁))) | |
2 | elfzel1 8889 | . . . . . . . 8 ⊢ (𝑥 ∈ (𝑀...𝑁) → 𝑀 ∈ ℤ) | |
3 | 2 | adantl 262 | . . . . . . 7 ⊢ ((𝑥 ∈ (𝐽...𝐾) ∧ 𝑥 ∈ (𝑀...𝑁)) → 𝑀 ∈ ℤ) |
4 | 3 | zred 8360 | . . . . . 6 ⊢ ((𝑥 ∈ (𝐽...𝐾) ∧ 𝑥 ∈ (𝑀...𝑁)) → 𝑀 ∈ ℝ) |
5 | elfzelz 8890 | . . . . . . . 8 ⊢ (𝑥 ∈ (𝑀...𝑁) → 𝑥 ∈ ℤ) | |
6 | 5 | zred 8360 | . . . . . . 7 ⊢ (𝑥 ∈ (𝑀...𝑁) → 𝑥 ∈ ℝ) |
7 | 6 | adantl 262 | . . . . . 6 ⊢ ((𝑥 ∈ (𝐽...𝐾) ∧ 𝑥 ∈ (𝑀...𝑁)) → 𝑥 ∈ ℝ) |
8 | elfzel2 8888 | . . . . . . . 8 ⊢ (𝑥 ∈ (𝐽...𝐾) → 𝐾 ∈ ℤ) | |
9 | 8 | adantr 261 | . . . . . . 7 ⊢ ((𝑥 ∈ (𝐽...𝐾) ∧ 𝑥 ∈ (𝑀...𝑁)) → 𝐾 ∈ ℤ) |
10 | 9 | zred 8360 | . . . . . 6 ⊢ ((𝑥 ∈ (𝐽...𝐾) ∧ 𝑥 ∈ (𝑀...𝑁)) → 𝐾 ∈ ℝ) |
11 | elfzle1 8891 | . . . . . . 7 ⊢ (𝑥 ∈ (𝑀...𝑁) → 𝑀 ≤ 𝑥) | |
12 | 11 | adantl 262 | . . . . . 6 ⊢ ((𝑥 ∈ (𝐽...𝐾) ∧ 𝑥 ∈ (𝑀...𝑁)) → 𝑀 ≤ 𝑥) |
13 | elfzle2 8892 | . . . . . . 7 ⊢ (𝑥 ∈ (𝐽...𝐾) → 𝑥 ≤ 𝐾) | |
14 | 13 | adantr 261 | . . . . . 6 ⊢ ((𝑥 ∈ (𝐽...𝐾) ∧ 𝑥 ∈ (𝑀...𝑁)) → 𝑥 ≤ 𝐾) |
15 | 4, 7, 10, 12, 14 | letrd 7138 | . . . . 5 ⊢ ((𝑥 ∈ (𝐽...𝐾) ∧ 𝑥 ∈ (𝑀...𝑁)) → 𝑀 ≤ 𝐾) |
16 | 4, 10 | lenltd 7134 | . . . . 5 ⊢ ((𝑥 ∈ (𝐽...𝐾) ∧ 𝑥 ∈ (𝑀...𝑁)) → (𝑀 ≤ 𝐾 ↔ ¬ 𝐾 < 𝑀)) |
17 | 15, 16 | mpbid 135 | . . . 4 ⊢ ((𝑥 ∈ (𝐽...𝐾) ∧ 𝑥 ∈ (𝑀...𝑁)) → ¬ 𝐾 < 𝑀) |
18 | 1, 17 | sylbi 114 | . . 3 ⊢ (𝑥 ∈ ((𝐽...𝐾) ∩ (𝑀...𝑁)) → ¬ 𝐾 < 𝑀) |
19 | 18 | con2i 557 | . 2 ⊢ (𝐾 < 𝑀 → ¬ 𝑥 ∈ ((𝐽...𝐾) ∩ (𝑀...𝑁))) |
20 | 19 | eq0rdv 3261 | 1 ⊢ (𝐾 < 𝑀 → ((𝐽...𝐾) ∩ (𝑀...𝑁)) = ∅) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 97 = wceq 1243 ∈ wcel 1393 ∩ cin 2916 ∅c0 3224 class class class wbr 3764 (class class class)co 5512 ℝcr 6888 < clt 7060 ≤ cle 7061 ℤcz 8245 ...cfz 8874 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-in1 544 ax-in2 545 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-13 1404 ax-14 1405 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 ax-sep 3875 ax-pow 3927 ax-pr 3944 ax-un 4170 ax-setind 4262 ax-cnex 6975 ax-resscn 6976 ax-pre-ltwlin 6997 |
This theorem depends on definitions: df-bi 110 df-3or 886 df-3an 887 df-tru 1246 df-fal 1249 df-nf 1350 df-sb 1646 df-eu 1903 df-mo 1904 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-ne 2206 df-nel 2207 df-ral 2311 df-rex 2312 df-rab 2315 df-v 2559 df-sbc 2765 df-dif 2920 df-un 2922 df-in 2924 df-ss 2931 df-nul 3225 df-pw 3361 df-sn 3381 df-pr 3382 df-op 3384 df-uni 3581 df-br 3765 df-opab 3819 df-mpt 3820 df-id 4030 df-xp 4351 df-rel 4352 df-cnv 4353 df-co 4354 df-dm 4355 df-rn 4356 df-res 4357 df-ima 4358 df-iota 4867 df-fun 4904 df-fn 4905 df-f 4906 df-fv 4910 df-ov 5515 df-oprab 5516 df-mpt2 5517 df-pnf 7062 df-mnf 7063 df-xr 7064 df-ltxr 7065 df-le 7066 df-neg 7185 df-z 8246 df-uz 8474 df-fz 8875 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |