xltadd1 - Metamath Proof Explorer

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

Theorem xltadd1 13300

Description: Extended real version of ltadd1 11698. (Contributed by Mario Carneiro, 23-Aug-2015.)

**Assertion**
Ref	Expression
xltadd1	⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ) → (𝐴 < 𝐵 ↔ (𝐴 +_𝑒 𝐶) < (𝐵 +_𝑒 𝐶)))

**Proof of Theorem xltadd1**
Step	Hyp	Ref	Expression
1		xleadd1 13299	. . . 4 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐴 ∈ ℝ^* ∧ 𝐶 ∈ ℝ) → (𝐵 ≤ 𝐴 ↔ (𝐵 +_𝑒 𝐶) ≤ (𝐴 +_𝑒 𝐶)))
2	1	3com12 1141	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ) → (𝐵 ≤ 𝐴 ↔ (𝐵 +_𝑒 𝐶) ≤ (𝐴 +_𝑒 𝐶)))
3	2	notbid 321	. 2 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ) → (¬ 𝐵 ≤ 𝐴 ↔ ¬ (𝐵 +_𝑒 𝐶) ≤ (𝐴 +_𝑒 𝐶)))
4		xrltnle 11293	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (𝐴 < 𝐵 ↔ ¬ 𝐵 ≤ 𝐴))
5	4	3adant3 1150	. 2 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ) → (𝐴 < 𝐵 ↔ ¬ 𝐵 ≤ 𝐴))
6		simp1 1154	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ) → 𝐴 ∈ ℝ^*)
7		rexr 11272	. . . . 5 ⊢ (𝐶 ∈ ℝ → 𝐶 ∈ ℝ^*)
8	7	3ad2ant3 1153	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ) → 𝐶 ∈ ℝ^*)
9		xaddcl 13283	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) → (𝐴 +_𝑒 𝐶) ∈ ℝ^)
10	6, 8, 9	syl2anc 596	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ) → (𝐴 +_𝑒 𝐶) ∈ ℝ^*)
11		simp2 1155	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ) → 𝐵 ∈ ℝ^*)
12		xaddcl 13283	. . . 4 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) → (𝐵 +_𝑒 𝐶) ∈ ℝ^)
13	11, 8, 12	syl2anc 596	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ) → (𝐵 +_𝑒 𝐶) ∈ ℝ^*)
14		xrltnle 11293	. . 3 ⊢ (((𝐴 +_𝑒 𝐶) ∈ ℝ^* ∧ (𝐵 +_𝑒 𝐶) ∈ ℝ^*) → ((𝐴 +_𝑒 𝐶) < (𝐵 +_𝑒 𝐶) ↔ ¬ (𝐵 +_𝑒 𝐶) ≤ (𝐴 +_𝑒 𝐶)))
15	10, 13, 14	syl2anc 596	. 2 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ) → ((𝐴 +_𝑒 𝐶) < (𝐵 +_𝑒 𝐶) ↔ ¬ (𝐵 +_𝑒 𝐶) ≤ (𝐴 +_𝑒 𝐶)))
16	3, 5, 15	3bitr4d 314	1 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ) → (𝐴 < 𝐵 ↔ (𝐴 +_𝑒 𝐶) < (𝐵 +_𝑒 𝐶)))

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ w3a 1103 ∈ wcel 2146 class class class wbr 5111 (class class class)co 7419 ℝcr 11116 ℝ^*cxr 11259 < clt 11260 ≤ cle 11261 +_𝑒 cxad 13153

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-cnex 11173 ax-resscn 11174 ax-1cn 11175 ax-icn 11176 ax-addcl 11177 ax-addrcl 11178 ax-mulcl 11179 ax-mulrcl 11180 ax-mulcom 11181 ax-addass 11182 ax-mulass 11183 ax-distr 11184 ax-i2m1 11185 ax-1ne0 11186 ax-1rid 11187 ax-rnegex 11188 ax-rrecex 11189 ax-cnre 11190 ax-pre-lttri 11191 ax-pre-lttrn 11192 ax-pre-ltadd 11193

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-po 5571 df-so 5572 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-1st 7992 df-2nd 7993 df-er 8700 df-en 8950 df-dom 8951 df-sdom 8952 df-pnf 11262 df-mnf 11263 df-xr 11264 df-ltxr 11265 df-le 11266 df-sub 11460 df-neg 11461 df-xneg 13155 df-xadd 13156

This theorem is used by: xltadd2 13301 xlt2add 13304 hashunsnggt 14450

W3C validator