| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > eqord2 | Structured version Visualization version GIF version | ||
| Description: A strictly decreasing real function on a subset of ℝ is one-to-one. (Contributed by Mario Carneiro, 14-Jun-2014.) |
| Ref | Expression |
|---|---|
| ltord.1 | ⊢ (𝑥 = 𝑦 → 𝐴 = 𝐵) |
| ltord.2 | ⊢ (𝑥 = 𝐶 → 𝐴 = 𝑀) |
| ltord.3 | ⊢ (𝑥 = 𝐷 → 𝐴 = 𝑁) |
| ltord.4 | ⊢ 𝑆 ⊆ ℝ |
| ltord.5 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → 𝐴 ∈ ℝ) |
| ltord2.6 | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 < 𝑦 → 𝐵 < 𝐴)) |
| Ref | Expression |
|---|---|
| eqord2 | ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → (𝐶 = 𝐷 ↔ 𝑀 = 𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ltord.1 | . . . 4 ⊢ (𝑥 = 𝑦 → 𝐴 = 𝐵) | |
| 2 | 1 | negeqd 11451 | . . 3 ⊢ (𝑥 = 𝑦 → -𝐴 = -𝐵) |
| 3 | ltord.2 | . . . 4 ⊢ (𝑥 = 𝐶 → 𝐴 = 𝑀) | |
| 4 | 3 | negeqd 11451 | . . 3 ⊢ (𝑥 = 𝐶 → -𝐴 = -𝑀) |
| 5 | ltord.3 | . . . 4 ⊢ (𝑥 = 𝐷 → 𝐴 = 𝑁) | |
| 6 | 5 | negeqd 11451 | . . 3 ⊢ (𝑥 = 𝐷 → -𝐴 = -𝑁) |
| 7 | ltord.4 | . . 3 ⊢ 𝑆 ⊆ ℝ | |
| 8 | ltord.5 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → 𝐴 ∈ ℝ) | |
| 9 | 8 | renegcld 11641 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → -𝐴 ∈ ℝ) |
| 10 | ltord2.6 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 < 𝑦 → 𝐵 < 𝐴)) | |
| 11 | 8 | ralrimiva 3163 | . . . . . . 7 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 𝐴 ∈ ℝ) |
| 12 | 1 | eleq1d 2854 | . . . . . . . 8 ⊢ (𝑥 = 𝑦 → (𝐴 ∈ ℝ ↔ 𝐵 ∈ ℝ)) |
| 13 | 12 | rspccva 3589 | . . . . . . 7 ⊢ ((∀𝑥 ∈ 𝑆 𝐴 ∈ ℝ ∧ 𝑦 ∈ 𝑆) → 𝐵 ∈ ℝ) |
| 14 | 11, 13 | sylan 591 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑆) → 𝐵 ∈ ℝ) |
| 15 | 14 | adantrl 728 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → 𝐵 ∈ ℝ) |
| 16 | 8 | adantrr 729 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → 𝐴 ∈ ℝ) |
| 17 | ltneg 11714 | . . . . 5 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝐵 < 𝐴 ↔ -𝐴 < -𝐵)) | |
| 18 | 15, 16, 17 | syl2anc 595 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝐵 < 𝐴 ↔ -𝐴 < -𝐵)) |
| 19 | 10, 18 | sylibd 242 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 < 𝑦 → -𝐴 < -𝐵)) |
| 20 | 2, 4, 6, 7, 9, 19 | eqord1 11742 | . 2 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → (𝐶 = 𝐷 ↔ -𝑀 = -𝑁)) |
| 21 | 3 | eleq1d 2854 | . . . . . . 7 ⊢ (𝑥 = 𝐶 → (𝐴 ∈ ℝ ↔ 𝑀 ∈ ℝ)) |
| 22 | 21 | rspccva 3589 | . . . . . 6 ⊢ ((∀𝑥 ∈ 𝑆 𝐴 ∈ ℝ ∧ 𝐶 ∈ 𝑆) → 𝑀 ∈ ℝ) |
| 23 | 11, 22 | sylan 591 | . . . . 5 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑆) → 𝑀 ∈ ℝ) |
| 24 | 23 | adantrr 729 | . . . 4 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → 𝑀 ∈ ℝ) |
| 25 | 24 | recnd 11237 | . . 3 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → 𝑀 ∈ ℂ) |
| 26 | 5 | eleq1d 2854 | . . . . . . 7 ⊢ (𝑥 = 𝐷 → (𝐴 ∈ ℝ ↔ 𝑁 ∈ ℝ)) |
| 27 | 26 | rspccva 3589 | . . . . . 6 ⊢ ((∀𝑥 ∈ 𝑆 𝐴 ∈ ℝ ∧ 𝐷 ∈ 𝑆) → 𝑁 ∈ ℝ) |
| 28 | 11, 27 | sylan 591 | . . . . 5 ⊢ ((𝜑 ∧ 𝐷 ∈ 𝑆) → 𝑁 ∈ ℝ) |
| 29 | 28 | adantrl 728 | . . . 4 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → 𝑁 ∈ ℝ) |
| 30 | 29 | recnd 11237 | . . 3 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → 𝑁 ∈ ℂ) |
| 31 | 25, 30 | neg11ad 11565 | . 2 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → (-𝑀 = -𝑁 ↔ 𝑀 = 𝑁)) |
| 32 | 20, 31 | bitrd 282 | 1 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → (𝐶 = 𝐷 ↔ 𝑀 = 𝑁)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ∀wral 3085 ⊆ wss 3913 class class class wbr 5113 ℝcr 11099 < clt 11243 -cneg 11442 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-opab 5178 df-mpt 5197 df-id 5557 df-po 5570 df-so 5571 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-er 8694 df-en 8944 df-dom 8945 df-sdom 8946 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-sub 11443 df-neg 11444 |
| This theorem is referenced by: basellem4 27214 |
| Copyright terms: Public domain | W3C validator |