ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  negiso GIF version

Theorem negiso 9134
Description: Negation is an order anti-isomorphism of the real numbers, which is its own inverse. (Contributed by Mario Carneiro, 24-Dec-2016.)
Hypothesis
Ref Expression
negiso.1 𝐹 = (𝑥 ∈ ℝ ↦ -𝑥)
Assertion
Ref Expression
negiso (𝐹 Isom < , < (ℝ, ℝ) ∧ 𝐹 = 𝐹)

Proof of Theorem negiso
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 negiso.1 . . . . . 6 𝐹 = (𝑥 ∈ ℝ ↦ -𝑥)
2 simpr 110 . . . . . . 7 ((⊤ ∧ 𝑥 ∈ ℝ) → 𝑥 ∈ ℝ)
32renegcld 8558 . . . . . 6 ((⊤ ∧ 𝑥 ∈ ℝ) → -𝑥 ∈ ℝ)
4 simpr 110 . . . . . . 7 ((⊤ ∧ 𝑦 ∈ ℝ) → 𝑦 ∈ ℝ)
54renegcld 8558 . . . . . 6 ((⊤ ∧ 𝑦 ∈ ℝ) → -𝑦 ∈ ℝ)
6 recn 8164 . . . . . . . 8 (𝑥 ∈ ℝ → 𝑥 ∈ ℂ)
7 recn 8164 . . . . . . . 8 (𝑦 ∈ ℝ → 𝑦 ∈ ℂ)
8 negcon2 8431 . . . . . . . 8 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 = -𝑦𝑦 = -𝑥))
96, 7, 8syl2an 289 . . . . . . 7 ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝑥 = -𝑦𝑦 = -𝑥))
109adantl 277 . . . . . 6 ((⊤ ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ)) → (𝑥 = -𝑦𝑦 = -𝑥))
111, 3, 5, 10f1ocnv2d 6226 . . . . 5 (⊤ → (𝐹:ℝ–1-1-onto→ℝ ∧ 𝐹 = (𝑦 ∈ ℝ ↦ -𝑦)))
1211mptru 1406 . . . 4 (𝐹:ℝ–1-1-onto→ℝ ∧ 𝐹 = (𝑦 ∈ ℝ ↦ -𝑦))
1312simpli 111 . . 3 𝐹:ℝ–1-1-onto→ℝ
14 simpl 109 . . . . . . . 8 ((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) → 𝑧 ∈ ℝ)
1514recnd 8207 . . . . . . 7 ((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) → 𝑧 ∈ ℂ)
1615negcld 8476 . . . . . 6 ((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) → -𝑧 ∈ ℂ)
177adantl 277 . . . . . . 7 ((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) → 𝑦 ∈ ℂ)
1817negcld 8476 . . . . . 6 ((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) → -𝑦 ∈ ℂ)
19 brcnvg 4911 . . . . . 6 ((-𝑧 ∈ ℂ ∧ -𝑦 ∈ ℂ) → (-𝑧 < -𝑦 ↔ -𝑦 < -𝑧))
2016, 18, 19syl2anc 411 . . . . 5 ((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (-𝑧 < -𝑦 ↔ -𝑦 < -𝑧))
211a1i 9 . . . . . . 7 ((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) → 𝐹 = (𝑥 ∈ ℝ ↦ -𝑥))
22 negeq 8371 . . . . . . . 8 (𝑥 = 𝑧 → -𝑥 = -𝑧)
2322adantl 277 . . . . . . 7 (((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) ∧ 𝑥 = 𝑧) → -𝑥 = -𝑧)
2421, 23, 14, 16fvmptd 5727 . . . . . 6 ((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝐹𝑧) = -𝑧)
25 negeq 8371 . . . . . . . 8 (𝑥 = 𝑦 → -𝑥 = -𝑦)
2625adantl 277 . . . . . . 7 (((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) ∧ 𝑥 = 𝑦) → -𝑥 = -𝑦)
27 simpr 110 . . . . . . 7 ((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) → 𝑦 ∈ ℝ)
2821, 26, 27, 18fvmptd 5727 . . . . . 6 ((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝐹𝑦) = -𝑦)
2924, 28breq12d 4101 . . . . 5 ((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) → ((𝐹𝑧) < (𝐹𝑦) ↔ -𝑧 < -𝑦))
30 ltneg 8641 . . . . 5 ((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝑧 < 𝑦 ↔ -𝑦 < -𝑧))
3120, 29, 303bitr4rd 221 . . . 4 ((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝑧 < 𝑦 ↔ (𝐹𝑧) < (𝐹𝑦)))
3231rgen2a 2586 . . 3 𝑧 ∈ ℝ ∀𝑦 ∈ ℝ (𝑧 < 𝑦 ↔ (𝐹𝑧) < (𝐹𝑦))
33 df-isom 5335 . . 3 (𝐹 Isom < , < (ℝ, ℝ) ↔ (𝐹:ℝ–1-1-onto→ℝ ∧ ∀𝑧 ∈ ℝ ∀𝑦 ∈ ℝ (𝑧 < 𝑦 ↔ (𝐹𝑧) < (𝐹𝑦))))
3413, 32, 33mpbir2an 950 . 2 𝐹 Isom < , < (ℝ, ℝ)
35 negeq 8371 . . . 4 (𝑦 = 𝑥 → -𝑦 = -𝑥)
3635cbvmptv 4185 . . 3 (𝑦 ∈ ℝ ↦ -𝑦) = (𝑥 ∈ ℝ ↦ -𝑥)
3712simpri 113 . . 3 𝐹 = (𝑦 ∈ ℝ ↦ -𝑦)
3836, 37, 13eqtr4i 2262 . 2 𝐹 = 𝐹
3934, 38pm3.2i 272 1 (𝐹 Isom < , < (ℝ, ℝ) ∧ 𝐹 = 𝐹)
Colors of variables: wff set class
Syntax hints:  wa 104  wb 105   = wceq 1397  wtru 1398  wcel 2202  wral 2510   class class class wbr 4088  cmpt 4150  ccnv 4724  1-1-ontowf1o 5325  cfv 5326   Isom wiso 5327  cc 8029  cr 8030   < clt 8213  -cneg 8350
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-addcom 8131  ax-addass 8133  ax-distr 8135  ax-i2m1 8136  ax-0id 8139  ax-rnegex 8140  ax-cnre 8142  ax-pre-ltadd 8147
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-isom 5335  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-pnf 8215  df-mnf 8216  df-ltxr 8218  df-sub 8351  df-neg 8352
This theorem is referenced by:  infrenegsupex  9827
  Copyright terms: Public domain W3C validator