Theorem negf1o 8251

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 3122	. . . . . 6 |- ( A C_ RR -> ( x e. A -> x e. RR ) )
3		renegcl 8130	. . . . . 6 |- ( x e. RR -> -u x e. RR )
4	2, 3	syl6 33	. . . . 5 |- ( A C_ RR -> ( x e. A -> -u x e. RR ) )
5	4	imp 123	. . . 4 |- ( ( A C_ RR /\ x e. A ) -> -u x e. RR )
6	2	imp 123	. . . . 5 |- ( ( A C_ RR /\ x e. A ) -> x e. RR )
7		recn 7859	. . . . . . . . 9 |- ( x e. RR -> x e. CC )
8		negneg 8119	. . . . . . . . . 10 |- ( x e. CC -> -u -u x = x )
9	8	eqcomd 2163	. . . . . . . . 9 |- ( x e. CC -> x = -u -u x )
10	7, 9	syl 14	. . . . . . . 8 |- ( x e. RR -> x = -u -u x )
11	10	eleq1d 2226	. . . . . . 7 |- ( x e. RR -> ( x e. A <-> -u -u x e. A ) )
12	11	biimpcd 158	. . . . . 6 |- ( x e. A -> ( x e. RR -> -u -u x e. A ) )
13	12	adantl 275	. . . . 5 |- ( ( A C_ RR /\ x e. A ) -> ( x e. RR -> -u -u x e. A ) )
14	6, 13	mpd 13	. . . 4 |- ( ( A C_ RR /\ x e. A ) -> -u -u x e. A )
15		negeq 8062	. . . . . 6 |- ( n = -u x -> -u n = -u -u x )
16	15	eleq1d 2226	. . . . 5 |- ( n = -u x -> ( -u n e. A <-> -u -u x e. A ) )
17	16	elrab 2868	. . . 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 414	. . 3 |- ( ( A C_ RR /\ x e. A ) -> -u x e. { n e. RR | -u n e. A } )
19		negeq 8062	. . . . . . 7 |- ( n = y -> -u n = -u y )
20	19	eleq1d 2226	. . . . . 6 |- ( n = y -> ( -u n e. A <-> -u y e. A ) )
21	20	elrab 2868	. . . . 5 |- ( y e. { n e. RR | -u n e. A } <-> ( y e. RR /\ -u y e. A ) )
22		simpr 109	. . . . . 6 |- ( ( y e. RR /\ -u y e. A ) -> -u y e. A )
23	22	a1i 9	. . . . 5 |- ( A C_ RR -> ( ( y e. RR /\ -u y e. A ) -> -u y e. A ) )
24	21, 23	syl5bi 151	. . . 4 |- ( A C_ RR -> ( y e. { n e. RR | -u n e. A } -> -u y e. A ) )
25	24	imp 123	. . 3 |- ( ( A C_ RR /\ y e. { n e. RR | -u n e. A } ) -> -u y e. A )
26	2, 7	syl6com 35	. . . . . . . . . 10 |- ( x e. A -> ( A C_ RR -> x e. CC ) )
27	26	adantl 275	. . . . . . . . 9 |- ( ( ( y e. RR /\ -u y e. A ) /\ x e. A ) -> ( A C_ RR -> x e. CC ) )
28	27	imp 123	. . . . . . . 8 |- ( ( ( ( y e. RR /\ -u y e. A ) /\ x e. A ) /\ A C_ RR ) -> x e. CC )
29		recn 7859	. . . . . . . . 9 |- ( y e. RR -> y e. CC )
30	29	ad3antrrr 484	. . . . . . . 8 |- ( ( ( ( y e. RR /\ -u y e. A ) /\ x e. A ) /\ A C_ RR ) -> y e. CC )
31		negcon2 8122	. . . . . . . 8 |- ( ( x e. CC /\ y e. CC ) -> ( x = -u y <-> y = -u x ) )
32	28, 30, 31	syl2anc 409	. . . . . . 7 |- ( ( ( ( y e. RR /\ -u y e. A ) /\ x e. A ) /\ A C_ RR ) -> ( x = -u y <-> y = -u x ) )
33	32	exp31 362	. . . . . 6 |- ( ( y e. RR /\ -u y e. A ) -> ( x e. A -> ( A C_ RR -> ( x = -u y <-> y = -u x ) ) ) )
34	21, 33	sylbi 120	. . . . 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 124	. . . 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 124	. . 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 6021	. 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 111	1 |- ( A C_ RR -> F : A -1-1-onto-> { n e. RR | -u n e. A } )

Syntax hints:   -> wi 4   /\ wa 103   <-> wb 104   = wceq 1335   e. wcel 2128   {crab 2439   C_ wss 3102   |-> cmpt 4025   `'ccnv 4584   -1-1-onto->wf1o 5168   CCcc 7724   RRcr 7725   -ucneg 8041

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1427  ax-7 1428  ax-gen 1429  ax-ie1 1473  ax-ie2 1474  ax-8 1484  ax-10 1485  ax-11 1486  ax-i12 1487  ax-bndl 1489  ax-4 1490  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-14 2131  ax-ext 2139  ax-sep 4082  ax-pow 4135  ax-pr 4169  ax-setind 4495  ax-resscn 7818  ax-1cn 7819  ax-icn 7821  ax-addcl 7822  ax-addrcl 7823  ax-mulcl 7824  ax-addcom 7826  ax-addass 7828  ax-distr 7830  ax-i2m1 7831  ax-0id 7834  ax-rnegex 7835  ax-cnre 7837

This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1338  df-fal 1341  df-nf 1441  df-sb 1743  df-eu 2009  df-mo 2010  df-clab 2144  df-cleq 2150  df-clel 2153  df-nfc 2288  df-ne 2328  df-ral 2440  df-rex 2441  df-reu 2442  df-rab 2444  df-v 2714  df-sbc 2938  df-dif 3104  df-un 3106  df-in 3108  df-ss 3115  df-pw 3545  df-sn 3566  df-pr 3567  df-op 3569  df-uni 3773  df-br 3966  df-opab 4026  df-mpt 4027  df-id 4253  df-xp 4591  df-rel 4592  df-cnv 4593  df-co 4594  df-dm 4595  df-rn 4596  df-iota 5134  df-fun 5171  df-fn 5172  df-f 5173  df-f1 5174  df-fo 5175  df-f1o 5176  df-fv 5177  df-riota 5777  df-ov 5824  df-oprab 5825  df-mpo 5826  df-sub 8042  df-neg 8043

This theorem is referenced by:  negfi  11120