fzoaddel - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > fzoaddel		Structured version Visualization version GIF version

Theorem fzoaddel 13093

Description: Translate membership in a half-open integer range. (Contributed by Stefan O'Rear, 15-Aug-2015.)

**Assertion**
Ref	Expression
fzoaddel	⊢ ((𝐴 ∈ (𝐵..^𝐶) ∧ 𝐷 ∈ ℤ) → (𝐴 + 𝐷) ∈ ((𝐵 + 𝐷)..^(𝐶 + 𝐷)))

**Proof of Theorem fzoaddel**
Step	Hyp	Ref	Expression
1		elfzoel1 13039	. . . . 5 ⊢ (𝐴 ∈ (𝐵..^𝐶) → 𝐵 ∈ ℤ)
2	1	adantr 483	. . . 4 ⊢ ((𝐴 ∈ (𝐵..^𝐶) ∧ 𝐷 ∈ ℤ) → 𝐵 ∈ ℤ)
3	2	zred 12090	. . 3 ⊢ ((𝐴 ∈ (𝐵..^𝐶) ∧ 𝐷 ∈ ℤ) → 𝐵 ∈ ℝ)
4		elfzoelz 13041	. . . . 5 ⊢ (𝐴 ∈ (𝐵..^𝐶) → 𝐴 ∈ ℤ)
5	4	adantr 483	. . . 4 ⊢ ((𝐴 ∈ (𝐵..^𝐶) ∧ 𝐷 ∈ ℤ) → 𝐴 ∈ ℤ)
6	5	zred 12090	. . 3 ⊢ ((𝐴 ∈ (𝐵..^𝐶) ∧ 𝐷 ∈ ℤ) → 𝐴 ∈ ℝ)
7		simpr 487	. . . 4 ⊢ ((𝐴 ∈ (𝐵..^𝐶) ∧ 𝐷 ∈ ℤ) → 𝐷 ∈ ℤ)
8	7	zred 12090	. . 3 ⊢ ((𝐴 ∈ (𝐵..^𝐶) ∧ 𝐷 ∈ ℤ) → 𝐷 ∈ ℝ)
9		elfzole1 13049	. . . 4 ⊢ (𝐴 ∈ (𝐵..^𝐶) → 𝐵 ≤ 𝐴)
10	9	adantr 483	. . 3 ⊢ ((𝐴 ∈ (𝐵..^𝐶) ∧ 𝐷 ∈ ℤ) → 𝐵 ≤ 𝐴)
11	3, 6, 8, 10	leadd1dd 11257	. 2 ⊢ ((𝐴 ∈ (𝐵..^𝐶) ∧ 𝐷 ∈ ℤ) → (𝐵 + 𝐷) ≤ (𝐴 + 𝐷))
12		elfzoel2 13040	. . . . 5 ⊢ (𝐴 ∈ (𝐵..^𝐶) → 𝐶 ∈ ℤ)
13	12	adantr 483	. . . 4 ⊢ ((𝐴 ∈ (𝐵..^𝐶) ∧ 𝐷 ∈ ℤ) → 𝐶 ∈ ℤ)
14	13	zred 12090	. . 3 ⊢ ((𝐴 ∈ (𝐵..^𝐶) ∧ 𝐷 ∈ ℤ) → 𝐶 ∈ ℝ)
15		elfzolt2 13050	. . . 4 ⊢ (𝐴 ∈ (𝐵..^𝐶) → 𝐴 < 𝐶)
16	15	adantr 483	. . 3 ⊢ ((𝐴 ∈ (𝐵..^𝐶) ∧ 𝐷 ∈ ℤ) → 𝐴 < 𝐶)
17	6, 14, 8, 16	ltadd1dd 11254	. 2 ⊢ ((𝐴 ∈ (𝐵..^𝐶) ∧ 𝐷 ∈ ℤ) → (𝐴 + 𝐷) < (𝐶 + 𝐷))
18		zaddcl 12025	. . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝐷 ∈ ℤ) → (𝐴 + 𝐷) ∈ ℤ)
19	4, 18	sylan 582	. . 3 ⊢ ((𝐴 ∈ (𝐵..^𝐶) ∧ 𝐷 ∈ ℤ) → (𝐴 + 𝐷) ∈ ℤ)
20		zaddcl 12025	. . . 4 ⊢ ((𝐵 ∈ ℤ ∧ 𝐷 ∈ ℤ) → (𝐵 + 𝐷) ∈ ℤ)
21	1, 20	sylan 582	. . 3 ⊢ ((𝐴 ∈ (𝐵..^𝐶) ∧ 𝐷 ∈ ℤ) → (𝐵 + 𝐷) ∈ ℤ)
22		zaddcl 12025	. . . 4 ⊢ ((𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ) → (𝐶 + 𝐷) ∈ ℤ)
23	12, 22	sylan 582	. . 3 ⊢ ((𝐴 ∈ (𝐵..^𝐶) ∧ 𝐷 ∈ ℤ) → (𝐶 + 𝐷) ∈ ℤ)
24		elfzo 13043	. . 3 ⊢ (((𝐴 + 𝐷) ∈ ℤ ∧ (𝐵 + 𝐷) ∈ ℤ ∧ (𝐶 + 𝐷) ∈ ℤ) → ((𝐴 + 𝐷) ∈ ((𝐵 + 𝐷)..^(𝐶 + 𝐷)) ↔ ((𝐵 + 𝐷) ≤ (𝐴 + 𝐷) ∧ (𝐴 + 𝐷) < (𝐶 + 𝐷))))
25	19, 21, 23, 24	syl3anc 1367	. 2 ⊢ ((𝐴 ∈ (𝐵..^𝐶) ∧ 𝐷 ∈ ℤ) → ((𝐴 + 𝐷) ∈ ((𝐵 + 𝐷)..^(𝐶 + 𝐷)) ↔ ((𝐵 + 𝐷) ≤ (𝐴 + 𝐷) ∧ (𝐴 + 𝐷) < (𝐶 + 𝐷))))
26	11, 17, 25	mpbir2and 711	1 ⊢ ((𝐴 ∈ (𝐵..^𝐶) ∧ 𝐷 ∈ ℤ) → (𝐴 + 𝐷) ∈ ((𝐵 + 𝐷)..^(𝐶 + 𝐷)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∈ wcel 2113 class class class wbr 5069 (class class class)co 7159 + caddc 10543 < clt 10678 ≤ cle 10679 ℤcz 11984 ..^cfzo 13036

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 ax-cnex 10596 ax-resscn 10597 ax-1cn 10598 ax-icn 10599 ax-addcl 10600 ax-addrcl 10601 ax-mulcl 10602 ax-mulrcl 10603 ax-mulcom 10604 ax-addass 10605 ax-mulass 10606 ax-distr 10607 ax-i2m1 10608 ax-1ne0 10609 ax-1rid 10610 ax-rnegex 10611 ax-rrecex 10612 ax-cnre 10613 ax-pre-lttri 10614 ax-pre-lttrn 10615 ax-pre-ltadd 10616 ax-pre-mulgt0 10617

This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-nel 3127 df-ral 3146 df-rex 3147 df-reu 3148 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-pss 3957 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-tp 4575 df-op 4577 df-uni 4842 df-iun 4924 df-br 5070 df-opab 5132 df-mpt 5150 df-tr 5176 df-id 5463 df-eprel 5468 df-po 5477 df-so 5478 df-fr 5517 df-we 5519 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-pred 6151 df-ord 6197 df-on 6198 df-lim 6199 df-suc 6200 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-riota 7117 df-ov 7162 df-oprab 7163 df-mpo 7164 df-om 7584 df-1st 7692 df-2nd 7693 df-wrecs 7950 df-recs 8011 df-rdg 8049 df-er 8292 df-en 8513 df-dom 8514 df-sdom 8515 df-pnf 10680 df-mnf 10681 df-xr 10682 df-ltxr 10683 df-le 10684 df-sub 10875 df-neg 10876 df-nn 11642 df-n0 11901 df-z 11985 df-uz 12247 df-fz 12896 df-fzo 13037

This theorem is referenced by: fzo0addel 13094 fzoaddel2 13096 fzosubel 13099 fz0add1fz1 13110 fzofzp1 13137 fzostep1 13156 splfv2a 14121 cycpmco2lem4 30775

W3C validator