![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > negiso | Structured version Visualization version GIF version |
Description: Negation is an order anti-isomorphism of the real numbers, which is its own inverse. (Contributed by Mario Carneiro, 24-Dec-2016.) |
Ref | Expression |
---|---|
negiso.1 | ⊢ 𝐹 = (𝑥 ∈ ℝ ↦ -𝑥) |
Ref | Expression |
---|---|
negiso | ⊢ (𝐹 Isom < , ◡ < (ℝ, ℝ) ∧ ◡𝐹 = 𝐹) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | negiso.1 | . . . . . 6 ⊢ 𝐹 = (𝑥 ∈ ℝ ↦ -𝑥) | |
2 | simpr 484 | . . . . . . 7 ⊢ ((⊤ ∧ 𝑥 ∈ ℝ) → 𝑥 ∈ ℝ) | |
3 | 2 | renegcld 11688 | . . . . . 6 ⊢ ((⊤ ∧ 𝑥 ∈ ℝ) → -𝑥 ∈ ℝ) |
4 | simpr 484 | . . . . . . 7 ⊢ ((⊤ ∧ 𝑦 ∈ ℝ) → 𝑦 ∈ ℝ) | |
5 | 4 | renegcld 11688 | . . . . . 6 ⊢ ((⊤ ∧ 𝑦 ∈ ℝ) → -𝑦 ∈ ℝ) |
6 | recn 11243 | . . . . . . . 8 ⊢ (𝑥 ∈ ℝ → 𝑥 ∈ ℂ) | |
7 | recn 11243 | . . . . . . . 8 ⊢ (𝑦 ∈ ℝ → 𝑦 ∈ ℂ) | |
8 | negcon2 11560 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 = -𝑦 ↔ 𝑦 = -𝑥)) | |
9 | 6, 7, 8 | syl2an 596 | . . . . . . 7 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝑥 = -𝑦 ↔ 𝑦 = -𝑥)) |
10 | 9 | adantl 481 | . . . . . 6 ⊢ ((⊤ ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ)) → (𝑥 = -𝑦 ↔ 𝑦 = -𝑥)) |
11 | 1, 3, 5, 10 | f1ocnv2d 7686 | . . . . 5 ⊢ (⊤ → (𝐹:ℝ–1-1-onto→ℝ ∧ ◡𝐹 = (𝑦 ∈ ℝ ↦ -𝑦))) |
12 | 11 | mptru 1544 | . . . 4 ⊢ (𝐹:ℝ–1-1-onto→ℝ ∧ ◡𝐹 = (𝑦 ∈ ℝ ↦ -𝑦)) |
13 | 12 | simpli 483 | . . 3 ⊢ 𝐹:ℝ–1-1-onto→ℝ |
14 | ltneg 11761 | . . . . . 6 ⊢ ((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝑧 < 𝑦 ↔ -𝑦 < -𝑧)) | |
15 | negex 11504 | . . . . . . 7 ⊢ -𝑧 ∈ V | |
16 | negex 11504 | . . . . . . 7 ⊢ -𝑦 ∈ V | |
17 | 15, 16 | brcnv 5896 | . . . . . 6 ⊢ (-𝑧◡ < -𝑦 ↔ -𝑦 < -𝑧) |
18 | 14, 17 | bitr4di 289 | . . . . 5 ⊢ ((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝑧 < 𝑦 ↔ -𝑧◡ < -𝑦)) |
19 | negeq 11498 | . . . . . . 7 ⊢ (𝑥 = 𝑧 → -𝑥 = -𝑧) | |
20 | 19, 1, 15 | fvmpt 7016 | . . . . . 6 ⊢ (𝑧 ∈ ℝ → (𝐹‘𝑧) = -𝑧) |
21 | negeq 11498 | . . . . . . 7 ⊢ (𝑥 = 𝑦 → -𝑥 = -𝑦) | |
22 | 21, 1, 16 | fvmpt 7016 | . . . . . 6 ⊢ (𝑦 ∈ ℝ → (𝐹‘𝑦) = -𝑦) |
23 | 20, 22 | breqan12d 5164 | . . . . 5 ⊢ ((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) → ((𝐹‘𝑧)◡ < (𝐹‘𝑦) ↔ -𝑧◡ < -𝑦)) |
24 | 18, 23 | bitr4d 282 | . . . 4 ⊢ ((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝑧 < 𝑦 ↔ (𝐹‘𝑧)◡ < (𝐹‘𝑦))) |
25 | 24 | rgen2 3197 | . . 3 ⊢ ∀𝑧 ∈ ℝ ∀𝑦 ∈ ℝ (𝑧 < 𝑦 ↔ (𝐹‘𝑧)◡ < (𝐹‘𝑦)) |
26 | df-isom 6572 | . . 3 ⊢ (𝐹 Isom < , ◡ < (ℝ, ℝ) ↔ (𝐹:ℝ–1-1-onto→ℝ ∧ ∀𝑧 ∈ ℝ ∀𝑦 ∈ ℝ (𝑧 < 𝑦 ↔ (𝐹‘𝑧)◡ < (𝐹‘𝑦)))) | |
27 | 13, 25, 26 | mpbir2an 711 | . 2 ⊢ 𝐹 Isom < , ◡ < (ℝ, ℝ) |
28 | negeq 11498 | . . . 4 ⊢ (𝑦 = 𝑥 → -𝑦 = -𝑥) | |
29 | 28 | cbvmptv 5261 | . . 3 ⊢ (𝑦 ∈ ℝ ↦ -𝑦) = (𝑥 ∈ ℝ ↦ -𝑥) |
30 | 12 | simpri 485 | . . 3 ⊢ ◡𝐹 = (𝑦 ∈ ℝ ↦ -𝑦) |
31 | 29, 30, 1 | 3eqtr4i 2773 | . 2 ⊢ ◡𝐹 = 𝐹 |
32 | 27, 31 | pm3.2i 470 | 1 ⊢ (𝐹 Isom < , ◡ < (ℝ, ℝ) ∧ ◡𝐹 = 𝐹) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 206 ∧ wa 395 = wceq 1537 ⊤wtru 1538 ∈ wcel 2106 ∀wral 3059 class class class wbr 5148 ↦ cmpt 5231 ◡ccnv 5688 –1-1-onto→wf1o 6562 ‘cfv 6563 Isom wiso 6564 ℂcc 11151 ℝcr 11152 < clt 11293 -cneg 11491 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-mulcom 11217 ax-addass 11218 ax-mulass 11219 ax-distr 11220 ax-i2m1 11221 ax-1ne0 11222 ax-1rid 11223 ax-rnegex 11224 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 ax-pre-ltadd 11229 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5583 df-po 5597 df-so 5598 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-isom 6572 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-er 8744 df-en 8985 df-dom 8986 df-sdom 8987 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-sub 11492 df-neg 11493 |
This theorem is referenced by: infrenegsup 12249 |
Copyright terms: Public domain | W3C validator |