Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > iccshftri | Structured version Visualization version GIF version |
Description: Membership in a shifted interval. (Contributed by Jeff Madsen, 2-Sep-2009.) |
Ref | Expression |
---|---|
iccshftri.1 | ⊢ 𝐴 ∈ ℝ |
iccshftri.2 | ⊢ 𝐵 ∈ ℝ |
iccshftri.3 | ⊢ 𝑅 ∈ ℝ |
iccshftri.4 | ⊢ (𝐴 + 𝑅) = 𝐶 |
iccshftri.5 | ⊢ (𝐵 + 𝑅) = 𝐷 |
Ref | Expression |
---|---|
iccshftri | ⊢ (𝑋 ∈ (𝐴[,]𝐵) → (𝑋 + 𝑅) ∈ (𝐶[,]𝐷)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | iccshftri.1 | . . . 4 ⊢ 𝐴 ∈ ℝ | |
2 | iccshftri.2 | . . . 4 ⊢ 𝐵 ∈ ℝ | |
3 | iccssre 13090 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴[,]𝐵) ⊆ ℝ) | |
4 | 1, 2, 3 | mp2an 688 | . . 3 ⊢ (𝐴[,]𝐵) ⊆ ℝ |
5 | 4 | sseli 3913 | . 2 ⊢ (𝑋 ∈ (𝐴[,]𝐵) → 𝑋 ∈ ℝ) |
6 | iccshftri.3 | . . . 4 ⊢ 𝑅 ∈ ℝ | |
7 | iccshftri.4 | . . . . . 6 ⊢ (𝐴 + 𝑅) = 𝐶 | |
8 | iccshftri.5 | . . . . . 6 ⊢ (𝐵 + 𝑅) = 𝐷 | |
9 | 7, 8 | iccshftr 13147 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝑋 ∈ ℝ ∧ 𝑅 ∈ ℝ)) → (𝑋 ∈ (𝐴[,]𝐵) ↔ (𝑋 + 𝑅) ∈ (𝐶[,]𝐷))) |
10 | 1, 2, 9 | mpanl12 698 | . . . 4 ⊢ ((𝑋 ∈ ℝ ∧ 𝑅 ∈ ℝ) → (𝑋 ∈ (𝐴[,]𝐵) ↔ (𝑋 + 𝑅) ∈ (𝐶[,]𝐷))) |
11 | 6, 10 | mpan2 687 | . . 3 ⊢ (𝑋 ∈ ℝ → (𝑋 ∈ (𝐴[,]𝐵) ↔ (𝑋 + 𝑅) ∈ (𝐶[,]𝐷))) |
12 | 11 | biimpd 228 | . 2 ⊢ (𝑋 ∈ ℝ → (𝑋 ∈ (𝐴[,]𝐵) → (𝑋 + 𝑅) ∈ (𝐶[,]𝐷))) |
13 | 5, 12 | mpcom 38 | 1 ⊢ (𝑋 ∈ (𝐴[,]𝐵) → (𝑋 + 𝑅) ∈ (𝐶[,]𝐷)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1539 ∈ wcel 2108 ⊆ wss 3883 (class class class)co 7255 ℝcr 10801 + caddc 10805 [,]cicc 13011 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-opab 5133 df-mpt 5154 df-id 5480 df-po 5494 df-so 5495 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-ov 7258 df-oprab 7259 df-mpo 7260 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-icc 13015 |
This theorem is referenced by: pcoass 24093 |
Copyright terms: Public domain | W3C validator |