| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fzostep1 | GIF version | ||
| Description: Two possibilities for a number one greater than a number in a half-open range. (Contributed by Stefan O'Rear, 23-Aug-2015.) |
| Ref | Expression |
|---|---|
| fzostep1 | ⊢ (𝐴 ∈ (𝐵..^𝐶) → ((𝐴 + 1) ∈ (𝐵..^𝐶) ∨ (𝐴 + 1) = 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elfzoel1 9155 | . . . 4 ⊢ (𝐴 ∈ (𝐵..^𝐶) → 𝐵 ∈ ℤ) | |
| 2 | uzid 8633 | . . . 4 ⊢ (𝐵 ∈ ℤ → 𝐵 ∈ (ℤ≥‘𝐵)) | |
| 3 | peano2uz 8671 | . . . 4 ⊢ (𝐵 ∈ (ℤ≥‘𝐵) → (𝐵 + 1) ∈ (ℤ≥‘𝐵)) | |
| 4 | fzoss1 9180 | . . . 4 ⊢ ((𝐵 + 1) ∈ (ℤ≥‘𝐵) → ((𝐵 + 1)..^(𝐶 + 1)) ⊆ (𝐵..^(𝐶 + 1))) | |
| 5 | 1, 2, 3, 4 | 4syl 18 | . . 3 ⊢ (𝐴 ∈ (𝐵..^𝐶) → ((𝐵 + 1)..^(𝐶 + 1)) ⊆ (𝐵..^(𝐶 + 1))) |
| 6 | 1z 8377 | . . . 4 ⊢ 1 ∈ ℤ | |
| 7 | fzoaddel 9201 | . . . 4 ⊢ ((𝐴 ∈ (𝐵..^𝐶) ∧ 1 ∈ ℤ) → (𝐴 + 1) ∈ ((𝐵 + 1)..^(𝐶 + 1))) | |
| 8 | 6, 7 | mpan2 415 | . . 3 ⊢ (𝐴 ∈ (𝐵..^𝐶) → (𝐴 + 1) ∈ ((𝐵 + 1)..^(𝐶 + 1))) |
| 9 | 5, 8 | sseldd 3000 | . 2 ⊢ (𝐴 ∈ (𝐵..^𝐶) → (𝐴 + 1) ∈ (𝐵..^(𝐶 + 1))) |
| 10 | elfzoel2 9156 | . . . 4 ⊢ (𝐴 ∈ (𝐵..^𝐶) → 𝐶 ∈ ℤ) | |
| 11 | elfzolt3 9166 | . . . . 5 ⊢ (𝐴 ∈ (𝐵..^𝐶) → 𝐵 < 𝐶) | |
| 12 | zre 8355 | . . . . . . 7 ⊢ (𝐵 ∈ ℤ → 𝐵 ∈ ℝ) | |
| 13 | zre 8355 | . . . . . . 7 ⊢ (𝐶 ∈ ℤ → 𝐶 ∈ ℝ) | |
| 14 | ltle 7198 | . . . . . . 7 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 < 𝐶 → 𝐵 ≤ 𝐶)) | |
| 15 | 12, 13, 14 | syl2an 283 | . . . . . 6 ⊢ ((𝐵 ∈ ℤ ∧ 𝐶 ∈ ℤ) → (𝐵 < 𝐶 → 𝐵 ≤ 𝐶)) |
| 16 | 1, 10, 15 | syl2anc 403 | . . . . 5 ⊢ (𝐴 ∈ (𝐵..^𝐶) → (𝐵 < 𝐶 → 𝐵 ≤ 𝐶)) |
| 17 | 11, 16 | mpd 13 | . . . 4 ⊢ (𝐴 ∈ (𝐵..^𝐶) → 𝐵 ≤ 𝐶) |
| 18 | eluz2 8625 | . . . 4 ⊢ (𝐶 ∈ (ℤ≥‘𝐵) ↔ (𝐵 ∈ ℤ ∧ 𝐶 ∈ ℤ ∧ 𝐵 ≤ 𝐶)) | |
| 19 | 1, 10, 17, 18 | syl3anbrc 1122 | . . 3 ⊢ (𝐴 ∈ (𝐵..^𝐶) → 𝐶 ∈ (ℤ≥‘𝐵)) |
| 20 | fzosplitsni 9244 | . . 3 ⊢ (𝐶 ∈ (ℤ≥‘𝐵) → ((𝐴 + 1) ∈ (𝐵..^(𝐶 + 1)) ↔ ((𝐴 + 1) ∈ (𝐵..^𝐶) ∨ (𝐴 + 1) = 𝐶))) | |
| 21 | 19, 20 | syl 14 | . 2 ⊢ (𝐴 ∈ (𝐵..^𝐶) → ((𝐴 + 1) ∈ (𝐵..^(𝐶 + 1)) ↔ ((𝐴 + 1) ∈ (𝐵..^𝐶) ∨ (𝐴 + 1) = 𝐶))) |
| 22 | 9, 21 | mpbid 145 | 1 ⊢ (𝐴 ∈ (𝐵..^𝐶) → ((𝐴 + 1) ∈ (𝐵..^𝐶) ∨ (𝐴 + 1) = 𝐶)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 103 ∨ wo 661 = wceq 1284 ∈ wcel 1433 ⊆ wss 2973 class class class wbr 3785 ‘cfv 4922 (class class class)co 5532 ℝcr 6980 1c1 6982 + caddc 6984 < clt 7153 ≤ cle 7154 ℤcz 8351 ℤ≥cuz 8619 ..^cfzo 9152 |
| This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-in1 576 ax-in2 577 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-13 1444 ax-14 1445 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 ax-sep 3896 ax-pow 3948 ax-pr 3964 ax-un 4188 ax-setind 4280 ax-cnex 7067 ax-resscn 7068 ax-1cn 7069 ax-1re 7070 ax-icn 7071 ax-addcl 7072 ax-addrcl 7073 ax-mulcl 7074 ax-addcom 7076 ax-addass 7078 ax-distr 7080 ax-i2m1 7081 ax-0lt1 7082 ax-0id 7084 ax-rnegex 7085 ax-cnre 7087 ax-pre-ltirr 7088 ax-pre-ltwlin 7089 ax-pre-lttrn 7090 ax-pre-apti 7091 ax-pre-ltadd 7092 |
| This theorem depends on definitions: df-bi 115 df-3or 920 df-3an 921 df-tru 1287 df-fal 1290 df-nf 1390 df-sb 1686 df-eu 1944 df-mo 1945 df-clab 2068 df-cleq 2074 df-clel 2077 df-nfc 2208 df-ne 2246 df-nel 2340 df-ral 2353 df-rex 2354 df-reu 2355 df-rab 2357 df-v 2603 df-sbc 2816 df-csb 2909 df-dif 2975 df-un 2977 df-in 2979 df-ss 2986 df-pw 3384 df-sn 3404 df-pr 3405 df-op 3407 df-uni 3602 df-int 3637 df-iun 3680 df-br 3786 df-opab 3840 df-mpt 3841 df-id 4048 df-xp 4369 df-rel 4370 df-cnv 4371 df-co 4372 df-dm 4373 df-rn 4374 df-res 4375 df-ima 4376 df-iota 4887 df-fun 4924 df-fn 4925 df-f 4926 df-fv 4930 df-riota 5488 df-ov 5535 df-oprab 5536 df-mpt2 5537 df-1st 5787 df-2nd 5788 df-pnf 7155 df-mnf 7156 df-xr 7157 df-ltxr 7158 df-le 7159 df-sub 7281 df-neg 7282 df-inn 8040 df-n0 8289 df-z 8352 df-uz 8620 df-fz 9030 df-fzo 9153 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |