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

Theorem negiso 8976
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 8401 . . . . . 6 ((⊤ ∧ 𝑥 ∈ ℝ) → -𝑥 ∈ ℝ)
4 simpr 110 . . . . . . 7 ((⊤ ∧ 𝑦 ∈ ℝ) → 𝑦 ∈ ℝ)
54renegcld 8401 . . . . . 6 ((⊤ ∧ 𝑦 ∈ ℝ) → -𝑦 ∈ ℝ)
6 recn 8007 . . . . . . . 8 (𝑥 ∈ ℝ → 𝑥 ∈ ℂ)
7 recn 8007 . . . . . . . 8 (𝑦 ∈ ℝ → 𝑦 ∈ ℂ)
8 negcon2 8274 . . . . . . . 8 ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 = -𝑦𝑦 = -𝑥))
96, 7, 8syl2an 289 . . . . . . 7 ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝑥 = -𝑦𝑦 = -𝑥))
109adantl 277 . . . . . 6 ((⊤ ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ)) → (𝑥 = -𝑦𝑦 = -𝑥))
111, 3, 5, 10f1ocnv2d 6124 . . . . 5 (⊤ → (𝐹:ℝ–1-1-onto→ℝ ∧ 𝐹 = (𝑦 ∈ ℝ ↦ -𝑦)))
1211mptru 1373 . . . 4 (𝐹:ℝ–1-1-onto→ℝ ∧ 𝐹 = (𝑦 ∈ ℝ ↦ -𝑦))
1312simpli 111 . . 3 𝐹:ℝ–1-1-onto→ℝ
14 simpl 109 . . . . . . . 8 ((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) → 𝑧 ∈ ℝ)
1514recnd 8050 . . . . . . 7 ((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) → 𝑧 ∈ ℂ)
1615negcld 8319 . . . . . 6 ((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) → -𝑧 ∈ ℂ)
177adantl 277 . . . . . . 7 ((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) → 𝑦 ∈ ℂ)
1817negcld 8319 . . . . . 6 ((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) → -𝑦 ∈ ℂ)
19 brcnvg 4844 . . . . . 6 ((-𝑧 ∈ ℂ ∧ -𝑦 ∈ ℂ) → (-𝑧 < -𝑦 ↔ -𝑦 < -𝑧))
2016, 18, 19syl2anc 411 . . . . 5 ((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (-𝑧 < -𝑦 ↔ -𝑦 < -𝑧))
211a1i 9 . . . . . . 7 ((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) → 𝐹 = (𝑥 ∈ ℝ ↦ -𝑥))
22 negeq 8214 . . . . . . . 8 (𝑥 = 𝑧 → -𝑥 = -𝑧)
2322adantl 277 . . . . . . 7 (((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) ∧ 𝑥 = 𝑧) → -𝑥 = -𝑧)
2421, 23, 14, 16fvmptd 5639 . . . . . 6 ((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝐹𝑧) = -𝑧)
25 negeq 8214 . . . . . . . 8 (𝑥 = 𝑦 → -𝑥 = -𝑦)
2625adantl 277 . . . . . . 7 (((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) ∧ 𝑥 = 𝑦) → -𝑥 = -𝑦)
27 simpr 110 . . . . . . 7 ((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) → 𝑦 ∈ ℝ)
2821, 26, 27, 18fvmptd 5639 . . . . . 6 ((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝐹𝑦) = -𝑦)
2924, 28breq12d 4043 . . . . 5 ((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) → ((𝐹𝑧) < (𝐹𝑦) ↔ -𝑧 < -𝑦))
30 ltneg 8483 . . . . 5 ((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝑧 < 𝑦 ↔ -𝑦 < -𝑧))
3120, 29, 303bitr4rd 221 . . . 4 ((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝑧 < 𝑦 ↔ (𝐹𝑧) < (𝐹𝑦)))
3231rgen2a 2548 . . 3 𝑧 ∈ ℝ ∀𝑦 ∈ ℝ (𝑧 < 𝑦 ↔ (𝐹𝑧) < (𝐹𝑦))
33 df-isom 5264 . . 3 (𝐹 Isom < , < (ℝ, ℝ) ↔ (𝐹:ℝ–1-1-onto→ℝ ∧ ∀𝑧 ∈ ℝ ∀𝑦 ∈ ℝ (𝑧 < 𝑦 ↔ (𝐹𝑧) < (𝐹𝑦))))
3413, 32, 33mpbir2an 944 . 2 𝐹 Isom < , < (ℝ, ℝ)
35 negeq 8214 . . . 4 (𝑦 = 𝑥 → -𝑦 = -𝑥)
3635cbvmptv 4126 . . 3 (𝑦 ∈ ℝ ↦ -𝑦) = (𝑥 ∈ ℝ ↦ -𝑥)
3712simpri 113 . . 3 𝐹 = (𝑦 ∈ ℝ ↦ -𝑦)
3836, 37, 13eqtr4i 2224 . 2 𝐹 = 𝐹
3934, 38pm3.2i 272 1 (𝐹 Isom < , < (ℝ, ℝ) ∧ 𝐹 = 𝐹)
Colors of variables: wff set class
Syntax hints:  wa 104  wb 105   = wceq 1364  wtru 1365  wcel 2164  wral 2472   class class class wbr 4030  cmpt 4091  ccnv 4659  1-1-ontowf1o 5254  cfv 5255   Isom wiso 5256  cc 7872  cr 7873   < clt 8056  -cneg 8193
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4148  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-setind 4570  ax-cnex 7965  ax-resscn 7966  ax-1cn 7967  ax-1re 7968  ax-icn 7969  ax-addcl 7970  ax-addrcl 7971  ax-mulcl 7972  ax-addcom 7974  ax-addass 7976  ax-distr 7978  ax-i2m1 7979  ax-0id 7982  ax-rnegex 7983  ax-cnre 7985  ax-pre-ltadd 7990
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2987  df-csb 3082  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-br 4031  df-opab 4092  df-mpt 4093  df-id 4325  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-isom 5264  df-riota 5874  df-ov 5922  df-oprab 5923  df-mpo 5924  df-pnf 8058  df-mnf 8059  df-ltxr 8061  df-sub 8194  df-neg 8195
This theorem is referenced by:  infrenegsupex  9662
  Copyright terms: Public domain W3C validator