![]() |
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 3342 | . . . 4 ⊢ (𝑥 ∈ ((𝐽...𝐾) ∩ (𝑀...𝑁)) ↔ (𝑥 ∈ (𝐽...𝐾) ∧ 𝑥 ∈ (𝑀...𝑁))) | |
2 | elfzel1 10090 | . . . . . . . 8 ⊢ (𝑥 ∈ (𝑀...𝑁) → 𝑀 ∈ ℤ) | |
3 | 2 | adantl 277 | . . . . . . 7 ⊢ ((𝑥 ∈ (𝐽...𝐾) ∧ 𝑥 ∈ (𝑀...𝑁)) → 𝑀 ∈ ℤ) |
4 | 3 | zred 9439 | . . . . . 6 ⊢ ((𝑥 ∈ (𝐽...𝐾) ∧ 𝑥 ∈ (𝑀...𝑁)) → 𝑀 ∈ ℝ) |
5 | elfzelz 10091 | . . . . . . . 8 ⊢ (𝑥 ∈ (𝑀...𝑁) → 𝑥 ∈ ℤ) | |
6 | 5 | zred 9439 | . . . . . . 7 ⊢ (𝑥 ∈ (𝑀...𝑁) → 𝑥 ∈ ℝ) |
7 | 6 | adantl 277 | . . . . . 6 ⊢ ((𝑥 ∈ (𝐽...𝐾) ∧ 𝑥 ∈ (𝑀...𝑁)) → 𝑥 ∈ ℝ) |
8 | elfzel2 10089 | . . . . . . . 8 ⊢ (𝑥 ∈ (𝐽...𝐾) → 𝐾 ∈ ℤ) | |
9 | 8 | adantr 276 | . . . . . . 7 ⊢ ((𝑥 ∈ (𝐽...𝐾) ∧ 𝑥 ∈ (𝑀...𝑁)) → 𝐾 ∈ ℤ) |
10 | 9 | zred 9439 | . . . . . 6 ⊢ ((𝑥 ∈ (𝐽...𝐾) ∧ 𝑥 ∈ (𝑀...𝑁)) → 𝐾 ∈ ℝ) |
11 | elfzle1 10093 | . . . . . . 7 ⊢ (𝑥 ∈ (𝑀...𝑁) → 𝑀 ≤ 𝑥) | |
12 | 11 | adantl 277 | . . . . . 6 ⊢ ((𝑥 ∈ (𝐽...𝐾) ∧ 𝑥 ∈ (𝑀...𝑁)) → 𝑀 ≤ 𝑥) |
13 | elfzle2 10094 | . . . . . . 7 ⊢ (𝑥 ∈ (𝐽...𝐾) → 𝑥 ≤ 𝐾) | |
14 | 13 | adantr 276 | . . . . . 6 ⊢ ((𝑥 ∈ (𝐽...𝐾) ∧ 𝑥 ∈ (𝑀...𝑁)) → 𝑥 ≤ 𝐾) |
15 | 4, 7, 10, 12, 14 | letrd 8143 | . . . . 5 ⊢ ((𝑥 ∈ (𝐽...𝐾) ∧ 𝑥 ∈ (𝑀...𝑁)) → 𝑀 ≤ 𝐾) |
16 | 4, 10 | lenltd 8137 | . . . . 5 ⊢ ((𝑥 ∈ (𝐽...𝐾) ∧ 𝑥 ∈ (𝑀...𝑁)) → (𝑀 ≤ 𝐾 ↔ ¬ 𝐾 < 𝑀)) |
17 | 15, 16 | mpbid 147 | . . . 4 ⊢ ((𝑥 ∈ (𝐽...𝐾) ∧ 𝑥 ∈ (𝑀...𝑁)) → ¬ 𝐾 < 𝑀) |
18 | 1, 17 | sylbi 121 | . . 3 ⊢ (𝑥 ∈ ((𝐽...𝐾) ∩ (𝑀...𝑁)) → ¬ 𝐾 < 𝑀) |
19 | 18 | con2i 628 | . 2 ⊢ (𝐾 < 𝑀 → ¬ 𝑥 ∈ ((𝐽...𝐾) ∩ (𝑀...𝑁))) |
20 | 19 | eq0rdv 3491 | 1 ⊢ (𝐾 < 𝑀 → ((𝐽...𝐾) ∩ (𝑀...𝑁)) = ∅) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 = wceq 1364 ∈ wcel 2164 ∩ cin 3152 ∅c0 3446 class class class wbr 4029 (class class class)co 5918 ℝcr 7871 < clt 8054 ≤ cle 8055 ℤcz 9317 ...cfz 10074 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-sep 4147 ax-pow 4203 ax-pr 4238 ax-un 4464 ax-setind 4569 ax-cnex 7963 ax-resscn 7964 ax-pre-ltwlin 7985 |
This theorem depends on definitions: df-bi 117 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-nel 2460 df-ral 2477 df-rex 2478 df-rab 2481 df-v 2762 df-sbc 2986 df-dif 3155 df-un 3157 df-in 3159 df-ss 3166 df-nul 3447 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-uni 3836 df-br 4030 df-opab 4091 df-mpt 4092 df-id 4324 df-xp 4665 df-rel 4666 df-cnv 4667 df-co 4668 df-dm 4669 df-rn 4670 df-res 4671 df-ima 4672 df-iota 5215 df-fun 5256 df-fn 5257 df-f 5258 df-fv 5262 df-ov 5921 df-oprab 5922 df-mpo 5923 df-pnf 8056 df-mnf 8057 df-xr 8058 df-ltxr 8059 df-le 8060 df-neg 8193 df-z 9318 df-uz 9593 df-fz 10075 |
This theorem is referenced by: fsumm1 11559 fsum1p 11561 mertenslemi1 11678 fprod1p 11742 fprodeq0 11760 strleund 12721 strleun 12722 gausslemma2dlem4 15180 gausslemma2dlem6 15183 cvgcmp2nlemabs 15522 |
Copyright terms: Public domain | W3C validator |