negiso - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > negiso		Structured version Visualization version GIF version

Theorem negiso 12232

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.

Step	Hyp	Ref	Expression
1		negiso.1	. . . . . 6 ⊢ 𝐹 = (𝑥 ∈ ℝ ↦ -𝑥)
2		simpr 483	. . . . . . 7 ⊢ ((⊤ ∧ 𝑥 ∈ ℝ) → 𝑥 ∈ ℝ)
3	2	renegcld 11679	. . . . . 6 ⊢ ((⊤ ∧ 𝑥 ∈ ℝ) → -𝑥 ∈ ℝ)
4		simpr 483	. . . . . . 7 ⊢ ((⊤ ∧ 𝑦 ∈ ℝ) → 𝑦 ∈ ℝ)
5	4	renegcld 11679	. . . . . 6 ⊢ ((⊤ ∧ 𝑦 ∈ ℝ) → -𝑦 ∈ ℝ)
6		recn 11236	. . . . . . . 8 ⊢ (𝑥 ∈ ℝ → 𝑥 ∈ ℂ)
7		recn 11236	. . . . . . . 8 ⊢ (𝑦 ∈ ℝ → 𝑦 ∈ ℂ)
8		negcon2 11551	. . . . . . . 8 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 = -𝑦 ↔ 𝑦 = -𝑥))
9	6, 7, 8	syl2an 594	. . . . . . 7 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝑥 = -𝑦 ↔ 𝑦 = -𝑥))
10	9	adantl 480	. . . . . 6 ⊢ ((⊤ ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ)) → (𝑥 = -𝑦 ↔ 𝑦 = -𝑥))
11	1, 3, 5, 10	f1ocnv2d 7680	. . . . 5 ⊢ (⊤ → (𝐹:ℝ–1-1-onto→ℝ ∧ ^◡𝐹 = (𝑦 ∈ ℝ ↦ -𝑦)))
12	11	mptru 1540	. . . 4 ⊢ (𝐹:ℝ–1-1-onto→ℝ ∧ ^◡𝐹 = (𝑦 ∈ ℝ ↦ -𝑦))
13	12	simpli 482	. . 3 ⊢ 𝐹:ℝ–1-1-onto→ℝ
14		ltneg 11752	. . . . . 6 ⊢ ((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝑧 < 𝑦 ↔ -𝑦 < -𝑧))
15		negex 11496	. . . . . . 7 ⊢ -𝑧 ∈ V
16		negex 11496	. . . . . . 7 ⊢ -𝑦 ∈ V
17	15, 16	brcnv 5889	. . . . . 6 ⊢ (-𝑧^◡ < -𝑦 ↔ -𝑦 < -𝑧)
18	14, 17	bitr4di 288	. . . . 5 ⊢ ((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝑧 < 𝑦 ↔ -𝑧^◡ < -𝑦))
19		negeq 11490	. . . . . . 7 ⊢ (𝑥 = 𝑧 → -𝑥 = -𝑧)
20	19, 1, 15	fvmpt 7010	. . . . . 6 ⊢ (𝑧 ∈ ℝ → (𝐹‘𝑧) = -𝑧)
21		negeq 11490	. . . . . . 7 ⊢ (𝑥 = 𝑦 → -𝑥 = -𝑦)
22	21, 1, 16	fvmpt 7010	. . . . . 6 ⊢ (𝑦 ∈ ℝ → (𝐹‘𝑦) = -𝑦)
23	20, 22	breqan12d 5168	. . . . 5 ⊢ ((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) → ((𝐹‘𝑧)^◡ < (𝐹‘𝑦) ↔ -𝑧^◡ < -𝑦))
24	18, 23	bitr4d 281	. . . 4 ⊢ ((𝑧 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝑧 < 𝑦 ↔ (𝐹‘𝑧)^◡ < (𝐹‘𝑦)))
25	24	rgen2 3195	. . 3 ⊢ ∀𝑧 ∈ ℝ ∀𝑦 ∈ ℝ (𝑧 < 𝑦 ↔ (𝐹‘𝑧)^◡ < (𝐹‘𝑦))
26		df-isom 6562	. . 3 ⊢ (𝐹 Isom < , ^◡ < (ℝ, ℝ) ↔ (𝐹:ℝ–1-1-onto→ℝ ∧ ∀𝑧 ∈ ℝ ∀𝑦 ∈ ℝ (𝑧 < 𝑦 ↔ (𝐹‘𝑧)^◡ < (𝐹‘𝑦))))
27	13, 25, 26	mpbir2an 709	. 2 ⊢ 𝐹 Isom < , ^◡ < (ℝ, ℝ)
28		negeq 11490	. . . 4 ⊢ (𝑦 = 𝑥 → -𝑦 = -𝑥)
29	28	cbvmptv 5265	. . 3 ⊢ (𝑦 ∈ ℝ ↦ -𝑦) = (𝑥 ∈ ℝ ↦ -𝑥)
30	12	simpri 484	. . 3 ⊢ ^◡𝐹 = (𝑦 ∈ ℝ ↦ -𝑦)
31	29, 30, 1	3eqtr4i 2766	. 2 ⊢ ^◡𝐹 = 𝐹
32	27, 31	pm3.2i 469	1 ⊢ (𝐹 Isom < , ^◡ < (ℝ, ℝ) ∧ ^◡𝐹 = 𝐹)

Colors of variables: wff setvar class

Syntax hints: ↔ wb 205 ∧ wa 394 = wceq 1533 ⊤wtru 1534 ∈ wcel 2098 ∀wral 3058 class class class wbr 5152 ↦ cmpt 5235 ^◡ccnv 5681 –1-1-onto→wf1o 6552 ‘cfv 6553 Isom wiso 6554 ℂcc 11144 ℝcr 11145 < clt 11286 -cneg 11483

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2699 ax-sep 5303 ax-nul 5310 ax-pow 5369 ax-pr 5433 ax-un 7746 ax-resscn 11203 ax-1cn 11204 ax-icn 11205 ax-addcl 11206 ax-addrcl 11207 ax-mulcl 11208 ax-mulrcl 11209 ax-mulcom 11210 ax-addass 11211 ax-mulass 11212 ax-distr 11213 ax-i2m1 11214 ax-1ne0 11215 ax-1rid 11216 ax-rnegex 11217 ax-rrecex 11218 ax-cnre 11219 ax-pre-lttri 11220 ax-pre-lttrn 11221 ax-pre-ltadd 11222

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2529 df-eu 2558 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2938 df-nel 3044 df-ral 3059 df-rex 3068 df-reu 3375 df-rab 3431 df-v 3475 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-nul 4327 df-if 4533 df-pw 4608 df-sn 4633 df-pr 4635 df-op 4639 df-uni 4913 df-br 5153 df-opab 5215 df-mpt 5236 df-id 5580 df-po 5594 df-so 5595 df-xp 5688 df-rel 5689 df-cnv 5690 df-co 5691 df-dm 5692 df-rn 5693 df-res 5694 df-ima 5695 df-iota 6505 df-fun 6555 df-fn 6556 df-f 6557 df-f1 6558 df-fo 6559 df-f1o 6560 df-fv 6561 df-isom 6562 df-riota 7382 df-ov 7429 df-oprab 7430 df-mpo 7431 df-er 8731 df-en 8971 df-dom 8972 df-sdom 8973 df-pnf 11288 df-mnf 11289 df-xr 11290 df-ltxr 11291 df-le 11292 df-sub 11484 df-neg 11485

This theorem is referenced by: infrenegsup 12235

W3C validator

	
		OSZAR »