Theorem negf1o 8489

Description: Negation is an isomorphism of a subset of the real numbers to the negated elements of the subset. (Contributed by AV, 9-Aug-2020.)

Hypothesis

Ref	Expression
negf1o.1	⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ -𝑥)

Assertion

Ref	Expression
negf1o	⊢ (𝐴 ⊆ ℝ → 𝐹:𝐴–1-1-onto→{𝑛 ∈ ℝ ∣ -𝑛 ∈ 𝐴})

Distinct variable group:   𝐴,𝑛,𝑥

Allowed substitution hints:   𝐹(𝑥,𝑛)

Proof of Theorem negf1o

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		negf1o.1	. . 3 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ -𝑥)
2		ssel 3195	. . . . . 6 ⊢ (𝐴 ⊆ ℝ → (𝑥 ∈ 𝐴 → 𝑥 ∈ ℝ))
3		renegcl 8368	. . . . . 6 ⊢ (𝑥 ∈ ℝ → -𝑥 ∈ ℝ)
4	2, 3	syl6 33	. . . . 5 ⊢ (𝐴 ⊆ ℝ → (𝑥 ∈ 𝐴 → -𝑥 ∈ ℝ))
5	4	imp 124	. . . 4 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑥 ∈ 𝐴) → -𝑥 ∈ ℝ)
6	2	imp 124	. . . . 5 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ ℝ)
7		recn 8093	. . . . . . . . 9 ⊢ (𝑥 ∈ ℝ → 𝑥 ∈ ℂ)
8		negneg 8357	. . . . . . . . . 10 ⊢ (𝑥 ∈ ℂ → --𝑥 = 𝑥)
9	8	eqcomd 2213	. . . . . . . . 9 ⊢ (𝑥 ∈ ℂ → 𝑥 = --𝑥)
10	7, 9	syl 14	. . . . . . . 8 ⊢ (𝑥 ∈ ℝ → 𝑥 = --𝑥)
11	10	eleq1d 2276	. . . . . . 7 ⊢ (𝑥 ∈ ℝ → (𝑥 ∈ 𝐴 ↔ --𝑥 ∈ 𝐴))
12	11	biimpcd 159	. . . . . 6 ⊢ (𝑥 ∈ 𝐴 → (𝑥 ∈ ℝ → --𝑥 ∈ 𝐴))
13	12	adantl 277	. . . . 5 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑥 ∈ 𝐴) → (𝑥 ∈ ℝ → --𝑥 ∈ 𝐴))
14	6, 13	mpd 13	. . . 4 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑥 ∈ 𝐴) → --𝑥 ∈ 𝐴)
15		negeq 8300	. . . . . 6 ⊢ (𝑛 = -𝑥 → -𝑛 = --𝑥)
16	15	eleq1d 2276	. . . . 5 ⊢ (𝑛 = -𝑥 → (-𝑛 ∈ 𝐴 ↔ --𝑥 ∈ 𝐴))
17	16	elrab 2936	. . . 4 ⊢ (-𝑥 ∈ {𝑛 ∈ ℝ ∣ -𝑛 ∈ 𝐴} ↔ (-𝑥 ∈ ℝ ∧ --𝑥 ∈ 𝐴))
18	5, 14, 17	sylanbrc 417	. . 3 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑥 ∈ 𝐴) → -𝑥 ∈ {𝑛 ∈ ℝ ∣ -𝑛 ∈ 𝐴})
19		negeq 8300	. . . . . . 7 ⊢ (𝑛 = 𝑦 → -𝑛 = -𝑦)
20	19	eleq1d 2276	. . . . . 6 ⊢ (𝑛 = 𝑦 → (-𝑛 ∈ 𝐴 ↔ -𝑦 ∈ 𝐴))
21	20	elrab 2936	. . . . 5 ⊢ (𝑦 ∈ {𝑛 ∈ ℝ ∣ -𝑛 ∈ 𝐴} ↔ (𝑦 ∈ ℝ ∧ -𝑦 ∈ 𝐴))
22		simpr 110	. . . . . 6 ⊢ ((𝑦 ∈ ℝ ∧ -𝑦 ∈ 𝐴) → -𝑦 ∈ 𝐴)
23	22	a1i 9	. . . . 5 ⊢ (𝐴 ⊆ ℝ → ((𝑦 ∈ ℝ ∧ -𝑦 ∈ 𝐴) → -𝑦 ∈ 𝐴))
24	21, 23	biimtrid 152	. . . 4 ⊢ (𝐴 ⊆ ℝ → (𝑦 ∈ {𝑛 ∈ ℝ ∣ -𝑛 ∈ 𝐴} → -𝑦 ∈ 𝐴))
25	24	imp 124	. . 3 ⊢ ((𝐴 ⊆ ℝ ∧ 𝑦 ∈ {𝑛 ∈ ℝ ∣ -𝑛 ∈ 𝐴}) → -𝑦 ∈ 𝐴)
26	2, 7	syl6com 35	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝐴 → (𝐴 ⊆ ℝ → 𝑥 ∈ ℂ))
27	26	adantl 277	. . . . . . . . 9 ⊢ (((𝑦 ∈ ℝ ∧ -𝑦 ∈ 𝐴) ∧ 𝑥 ∈ 𝐴) → (𝐴 ⊆ ℝ → 𝑥 ∈ ℂ))
28	27	imp 124	. . . . . . . 8 ⊢ ((((𝑦 ∈ ℝ ∧ -𝑦 ∈ 𝐴) ∧ 𝑥 ∈ 𝐴) ∧ 𝐴 ⊆ ℝ) → 𝑥 ∈ ℂ)
29		recn 8093	. . . . . . . . 9 ⊢ (𝑦 ∈ ℝ → 𝑦 ∈ ℂ)
30	29	ad3antrrr 492	. . . . . . . 8 ⊢ ((((𝑦 ∈ ℝ ∧ -𝑦 ∈ 𝐴) ∧ 𝑥 ∈ 𝐴) ∧ 𝐴 ⊆ ℝ) → 𝑦 ∈ ℂ)
31		negcon2 8360	. . . . . . . 8 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 = -𝑦 ↔ 𝑦 = -𝑥))
32	28, 30, 31	syl2anc 411	. . . . . . 7 ⊢ ((((𝑦 ∈ ℝ ∧ -𝑦 ∈ 𝐴) ∧ 𝑥 ∈ 𝐴) ∧ 𝐴 ⊆ ℝ) → (𝑥 = -𝑦 ↔ 𝑦 = -𝑥))
33	32	exp31 364	. . . . . 6 ⊢ ((𝑦 ∈ ℝ ∧ -𝑦 ∈ 𝐴) → (𝑥 ∈ 𝐴 → (𝐴 ⊆ ℝ → (𝑥 = -𝑦 ↔ 𝑦 = -𝑥))))
34	21, 33	sylbi 121	. . . . 5 ⊢ (𝑦 ∈ {𝑛 ∈ ℝ ∣ -𝑛 ∈ 𝐴} → (𝑥 ∈ 𝐴 → (𝐴 ⊆ ℝ → (𝑥 = -𝑦 ↔ 𝑦 = -𝑥))))
35	34	impcom 125	. . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ {𝑛 ∈ ℝ ∣ -𝑛 ∈ 𝐴}) → (𝐴 ⊆ ℝ → (𝑥 = -𝑦 ↔ 𝑦 = -𝑥)))
36	35	impcom 125	. . 3 ⊢ ((𝐴 ⊆ ℝ ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ {𝑛 ∈ ℝ ∣ -𝑛 ∈ 𝐴})) → (𝑥 = -𝑦 ↔ 𝑦 = -𝑥))
37	1, 18, 25, 36	f1ocnv2d 6173	. 2 ⊢ (𝐴 ⊆ ℝ → (𝐹:𝐴–1-1-onto→{𝑛 ∈ ℝ ∣ -𝑛 ∈ 𝐴} ∧ ◡𝐹 = (𝑦 ∈ {𝑛 ∈ ℝ ∣ -𝑛 ∈ 𝐴} ↦ -𝑦)))
38	37	simpld 112	1 ⊢ (𝐴 ⊆ ℝ → 𝐹:𝐴–1-1-onto→{𝑛 ∈ ℝ ∣ -𝑛 ∈ 𝐴})

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1373   ∈ wcel 2178  {crab 2490   ⊆ wss 3174   ↦ cmpt 4121  ^◡ccnv 4692  –1-1-onto→wf1o 5289  ℂcc 7958  ℝcr 7959  -cneg 8279

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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269  ax-setind 4603  ax-resscn 8052  ax-1cn 8053  ax-icn 8055  ax-addcl 8056  ax-addrcl 8057  ax-mulcl 8058  ax-addcom 8060  ax-addass 8062  ax-distr 8064  ax-i2m1 8065  ax-0id 8068  ax-rnegex 8069  ax-cnre 8071

This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-ral 2491  df-rex 2492  df-reu 2493  df-rab 2495  df-v 2778  df-sbc 3006  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-br 4060  df-opab 4122  df-mpt 4123  df-id 4358  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-iota 5251  df-fun 5292  df-fn 5293  df-f 5294  df-f1 5295  df-fo 5296  df-f1o 5297  df-fv 5298  df-riota 5922  df-ov 5970  df-oprab 5971  df-mpo 5972  df-sub 8280  df-neg 8281

This theorem is referenced by:  negfi  11654