Theorem negf1o 10460

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	|- F = ( x e. A |-> -u x )

Assertion

Ref	Expression
negf1o	|- ( A C_ RR -> F : A -1-1-onto-> { n e. RR | -u n e. A } )

Distinct variable group:   A, n, x

Allowed substitution hints:   F( x, n)

Proof of Theorem negf1o

Dummy variable y is distinct from all other variables.

Step	Hyp	Ref	Expression
1		negf1o.1	. . 3 |- F = ( x e. A |-> -u x )
2		ssel 3597	. . . . . 6 |- ( A C_ RR -> ( x e. A -> x e. RR ) )
3		renegcl 10344	. . . . . 6 |- ( x e. RR -> -u x e. RR )
4	2, 3	syl6 35	. . . . 5 |- ( A C_ RR -> ( x e. A -> -u x e. RR ) )
5	4	imp 445	. . . 4 |- ( ( A C_ RR /\ x e. A ) -> -u x e. RR )
6	2	imp 445	. . . . 5 |- ( ( A C_ RR /\ x e. A ) -> x e. RR )
7		recn 10026	. . . . . . . . 9 |- ( x e. RR -> x e. CC )
8		negneg 10331	. . . . . . . . . 10 |- ( x e. CC -> -u -u x = x )
9	8	eqcomd 2628	. . . . . . . . 9 |- ( x e. CC -> x = -u -u x )
10	7, 9	syl 17	. . . . . . . 8 |- ( x e. RR -> x = -u -u x )
11	10	eleq1d 2686	. . . . . . 7 |- ( x e. RR -> ( x e. A <-> -u -u x e. A ) )
12	11	biimpcd 239	. . . . . 6 |- ( x e. A -> ( x e. RR -> -u -u x e. A ) )
13	12	adantl 482	. . . . 5 |- ( ( A C_ RR /\ x e. A ) -> ( x e. RR -> -u -u x e. A ) )
14	6, 13	mpd 15	. . . 4 |- ( ( A C_ RR /\ x e. A ) -> -u -u x e. A )
15		negeq 10273	. . . . . 6 |- ( n = -u x -> -u n = -u -u x )
16	15	eleq1d 2686	. . . . 5 |- ( n = -u x -> ( -u n e. A <-> -u -u x e. A ) )
17	16	elrab 3363	. . . 4 |- ( -u x e. { n e. RR | -u n e. A } <-> ( -u x e. RR /\ -u -u x e. A ) )
18	5, 14, 17	sylanbrc 698	. . 3 |- ( ( A C_ RR /\ x e. A ) -> -u x e. { n e. RR | -u n e. A } )
19		negeq 10273	. . . . . . 7 |- ( n = y -> -u n = -u y )
20	19	eleq1d 2686	. . . . . 6 |- ( n = y -> ( -u n e. A <-> -u y e. A ) )
21	20	elrab 3363	. . . . 5 |- ( y e. { n e. RR | -u n e. A } <-> ( y e. RR /\ -u y e. A ) )
22		simpr 477	. . . . . 6 |- ( ( y e. RR /\ -u y e. A ) -> -u y e. A )
23	22	a1i 11	. . . . 5 |- ( A C_ RR -> ( ( y e. RR /\ -u y e. A ) -> -u y e. A ) )
24	21, 23	syl5bi 232	. . . 4 |- ( A C_ RR -> ( y e. { n e. RR | -u n e. A } -> -u y e. A ) )
25	24	imp 445	. . 3 |- ( ( A C_ RR /\ y e. { n e. RR | -u n e. A } ) -> -u y e. A )
26	2, 7	syl6com 37	. . . . . . . . . 10 |- ( x e. A -> ( A C_ RR -> x e. CC ) )
27	26	adantl 482	. . . . . . . . 9 |- ( ( ( y e. RR /\ -u y e. A ) /\ x e. A ) -> ( A C_ RR -> x e. CC ) )
28	27	imp 445	. . . . . . . 8 |- ( ( ( ( y e. RR /\ -u y e. A ) /\ x e. A ) /\ A C_ RR ) -> x e. CC )
29		recn 10026	. . . . . . . . 9 |- ( y e. RR -> y e. CC )
30	29	ad3antrrr 766	. . . . . . . 8 |- ( ( ( ( y e. RR /\ -u y e. A ) /\ x e. A ) /\ A C_ RR ) -> y e. CC )
31		negcon2 10334	. . . . . . . 8 |- ( ( x e. CC /\ y e. CC ) -> ( x = -u y <-> y = -u x ) )
32	28, 30, 31	syl2anc 693	. . . . . . 7 |- ( ( ( ( y e. RR /\ -u y e. A ) /\ x e. A ) /\ A C_ RR ) -> ( x = -u y <-> y = -u x ) )
33	32	exp31 630	. . . . . 6 |- ( ( y e. RR /\ -u y e. A ) -> ( x e. A -> ( A C_ RR -> ( x = -u y <-> y = -u x ) ) ) )
34	21, 33	sylbi 207	. . . . 5 |- ( y e. { n e. RR | -u n e. A } -> ( x e. A -> ( A C_ RR -> ( x = -u y <-> y = -u x ) ) ) )
35	34	impcom 446	. . . 4 |- ( ( x e. A /\ y e. { n e. RR | -u n e. A } ) -> ( A C_ RR -> ( x = -u y <-> y = -u x ) ) )
36	35	impcom 446	. . 3 |- ( ( A C_ RR /\ ( x e. A /\ y e. { n e. RR | -u n e. A } ) ) -> ( x = -u y <-> y = -u x ) )
37	1, 18, 25, 36	f1ocnv2d 6886	. 2 |- ( A C_ RR -> ( F : A -1-1-onto-> { n e. RR | -u n e. A } /\ `' F = ( y e. { n e. RR | -u n e. A } |-> -u y ) ) )
38	37	simpld 475	1 |- ( A C_ RR -> F : A -1-1-onto-> { n e. RR | -u n e. A } )

Syntax hints:   -> wi 4   <-> wb 196   /\ wa 384   = wceq 1483   e. wcel 1990   {crab 2916   C_ wss 3574   |-> cmpt 4729   `'ccnv 5113   -1-1-onto->wf1o 5887   CCcc 9934   RRcr 9935   -ucneg 10267

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949  ax-resscn 9993  ax-1cn 9994  ax-icn 9995  ax-addcl 9996  ax-addrcl 9997  ax-mulcl 9998  ax-mulrcl 9999  ax-mulcom 10000  ax-addass 10001  ax-mulass 10002  ax-distr 10003  ax-i2m1 10004  ax-1ne0 10005  ax-1rid 10006  ax-rnegex 10007  ax-rrecex 10008  ax-cnre 10009  ax-pre-lttri 10010  ax-pre-lttrn 10011  ax-pre-ltadd 10012

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-nel 2898  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-po 5035  df-so 5036  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-riota 6611  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-er 7742  df-en 7956  df-dom 7957  df-sdom 7958  df-pnf 10076  df-mnf 10077  df-ltxr 10079  df-sub 10268  df-neg 10269

This theorem is referenced by:  negfi  10971