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 13202

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

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

**Proof of Theorem xltadd1**
Step	Hyp	Ref	Expression
1		xleadd1 13201	. . . 4 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐴 ∈ ℝ^* ∧ 𝐶 ∈ ℝ) → (𝐵 ≤ 𝐴 ↔ (𝐵 +_𝑒 𝐶) ≤ (𝐴 +_𝑒 𝐶)))
2	1	3com12 1124	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ) → (𝐵 ≤ 𝐴 ↔ (𝐵 +_𝑒 𝐶) ≤ (𝐴 +_𝑒 𝐶)))
3	2	notbid 318	. 2 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ) → (¬ 𝐵 ≤ 𝐴 ↔ ¬ (𝐵 +_𝑒 𝐶) ≤ (𝐴 +_𝑒 𝐶)))
4		xrltnle 11206	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (𝐴 < 𝐵 ↔ ¬ 𝐵 ≤ 𝐴))
5	4	3adant3 1133	. 2 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ) → (𝐴 < 𝐵 ↔ ¬ 𝐵 ≤ 𝐴))
6		simp1 1137	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ) → 𝐴 ∈ ℝ^*)
7		rexr 11185	. . . . 5 ⊢ (𝐶 ∈ ℝ → 𝐶 ∈ ℝ^*)
8	7	3ad2ant3 1136	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ) → 𝐶 ∈ ℝ^*)
9		xaddcl 13185	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) → (𝐴 +_𝑒 𝐶) ∈ ℝ^)
10	6, 8, 9	syl2anc 585	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ) → (𝐴 +_𝑒 𝐶) ∈ ℝ^*)
11		simp2 1138	. . . 4 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ) → 𝐵 ∈ ℝ^*)
12		xaddcl 13185	. . . 4 ⊢ ((𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ^) → (𝐵 +_𝑒 𝐶) ∈ ℝ^)
13	11, 8, 12	syl2anc 585	. . 3 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ) → (𝐵 +_𝑒 𝐶) ∈ ℝ^*)
14		xrltnle 11206	. . 3 ⊢ (((𝐴 +_𝑒 𝐶) ∈ ℝ^* ∧ (𝐵 +_𝑒 𝐶) ∈ ℝ^*) → ((𝐴 +_𝑒 𝐶) < (𝐵 +_𝑒 𝐶) ↔ ¬ (𝐵 +_𝑒 𝐶) ≤ (𝐴 +_𝑒 𝐶)))
15	10, 13, 14	syl2anc 585	. 2 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ) → ((𝐴 +_𝑒 𝐶) < (𝐵 +_𝑒 𝐶) ↔ ¬ (𝐵 +_𝑒 𝐶) ≤ (𝐴 +_𝑒 𝐶)))
16	3, 5, 15	3bitr4d 311	1 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ 𝐶 ∈ ℝ) → (𝐴 < 𝐵 ↔ (𝐴 +_𝑒 𝐶) < (𝐵 +_𝑒 𝐶)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ w3a 1087 ∈ wcel 2114 class class class wbr 5086 (class class class)co 7361 ℝcr 11031 ℝ^*cxr 11172 < clt 11173 ≤ cle 11174 +_𝑒 cxad 13055

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5232 ax-nul 5242 ax-pow 5303 ax-pr 5371 ax-un 7683 ax-cnex 11088 ax-resscn 11089 ax-1cn 11090 ax-icn 11091 ax-addcl 11092 ax-addrcl 11093 ax-mulcl 11094 ax-mulrcl 11095 ax-mulcom 11096 ax-addass 11097 ax-mulass 11098 ax-distr 11099 ax-i2m1 11100 ax-1ne0 11101 ax-1rid 11102 ax-rnegex 11103 ax-rrecex 11104 ax-cnre 11105 ax-pre-lttri 11106 ax-pre-lttrn 11107 ax-pre-ltadd 11108

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5520 df-po 5533 df-so 5534 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7318 df-ov 7364 df-oprab 7365 df-mpo 7366 df-1st 7936 df-2nd 7937 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-pnf 11175 df-mnf 11176 df-xr 11177 df-ltxr 11178 df-le 11179 df-sub 11373 df-neg 11374 df-xneg 13057 df-xadd 13058

This theorem is referenced by: xltadd2 13203 xlt2add 13206 hashunsnggt 14350

W3C validator