Metamath Proof Explorer


Theorem negleft

Description: The left set of the negative of a surreal is the set of negatives of its right set. (Contributed by Scott Fenton, 21-Feb-2026)

Ref Expression
Assertion negleft ( 𝐴 No → ( L ‘ ( -us𝐴 ) ) = ( -us “ ( R ‘ 𝐴 ) ) )

Proof

Step Hyp Ref Expression
1 fveqeq2 ( 𝑦 = ( -us𝑥 ) → ( ( -us𝑦 ) = 𝑥 ↔ ( -us ‘ ( -us𝑥 ) ) = 𝑥 ) )
2 leftno ( 𝑥 ∈ ( L ‘ ( -us𝐴 ) ) → 𝑥 No )
3 2 adantl ( ( 𝐴 No 𝑥 ∈ ( L ‘ ( -us𝐴 ) ) ) → 𝑥 No )
4 negbday ( 𝑥 No → ( bday ‘ ( -us𝑥 ) ) = ( bday 𝑥 ) )
5 3 4 syl ( ( 𝐴 No 𝑥 ∈ ( L ‘ ( -us𝐴 ) ) ) → ( bday ‘ ( -us𝑥 ) ) = ( bday 𝑥 ) )
6 leftold ( 𝑥 ∈ ( L ‘ ( -us𝐴 ) ) → 𝑥 ∈ ( O ‘ ( bday ‘ ( -us𝐴 ) ) ) )
7 6 adantl ( ( 𝐴 No 𝑥 ∈ ( L ‘ ( -us𝐴 ) ) ) → 𝑥 ∈ ( O ‘ ( bday ‘ ( -us𝐴 ) ) ) )
8 bdayon ( bday ‘ ( -us𝐴 ) ) ∈ On
9 oldbday ( ( ( bday ‘ ( -us𝐴 ) ) ∈ On ∧ 𝑥 No ) → ( 𝑥 ∈ ( O ‘ ( bday ‘ ( -us𝐴 ) ) ) ↔ ( bday 𝑥 ) ∈ ( bday ‘ ( -us𝐴 ) ) ) )
10 8 3 9 sylancr ( ( 𝐴 No 𝑥 ∈ ( L ‘ ( -us𝐴 ) ) ) → ( 𝑥 ∈ ( O ‘ ( bday ‘ ( -us𝐴 ) ) ) ↔ ( bday 𝑥 ) ∈ ( bday ‘ ( -us𝐴 ) ) ) )
11 7 10 mpbid ( ( 𝐴 No 𝑥 ∈ ( L ‘ ( -us𝐴 ) ) ) → ( bday 𝑥 ) ∈ ( bday ‘ ( -us𝐴 ) ) )
12 negbday ( 𝐴 No → ( bday ‘ ( -us𝐴 ) ) = ( bday 𝐴 ) )
13 12 adantr ( ( 𝐴 No 𝑥 ∈ ( L ‘ ( -us𝐴 ) ) ) → ( bday ‘ ( -us𝐴 ) ) = ( bday 𝐴 ) )
14 11 13 eleqtrd ( ( 𝐴 No 𝑥 ∈ ( L ‘ ( -us𝐴 ) ) ) → ( bday 𝑥 ) ∈ ( bday 𝐴 ) )
15 5 14 eqeltrd ( ( 𝐴 No 𝑥 ∈ ( L ‘ ( -us𝐴 ) ) ) → ( bday ‘ ( -us𝑥 ) ) ∈ ( bday 𝐴 ) )
16 bdayon ( bday 𝐴 ) ∈ On
17 3 negscld ( ( 𝐴 No 𝑥 ∈ ( L ‘ ( -us𝐴 ) ) ) → ( -us𝑥 ) ∈ No )
18 oldbday ( ( ( bday 𝐴 ) ∈ On ∧ ( -us𝑥 ) ∈ No ) → ( ( -us𝑥 ) ∈ ( O ‘ ( bday 𝐴 ) ) ↔ ( bday ‘ ( -us𝑥 ) ) ∈ ( bday 𝐴 ) ) )
19 16 17 18 sylancr ( ( 𝐴 No 𝑥 ∈ ( L ‘ ( -us𝐴 ) ) ) → ( ( -us𝑥 ) ∈ ( O ‘ ( bday 𝐴 ) ) ↔ ( bday ‘ ( -us𝑥 ) ) ∈ ( bday 𝐴 ) ) )
20 15 19 mpbird ( ( 𝐴 No 𝑥 ∈ ( L ‘ ( -us𝐴 ) ) ) → ( -us𝑥 ) ∈ ( O ‘ ( bday 𝐴 ) ) )
21 negnegs ( 𝐴 No → ( -us ‘ ( -us𝐴 ) ) = 𝐴 )
22 21 adantr ( ( 𝐴 No 𝑥 ∈ ( L ‘ ( -us𝐴 ) ) ) → ( -us ‘ ( -us𝐴 ) ) = 𝐴 )
23 leftlt ( 𝑥 ∈ ( L ‘ ( -us𝐴 ) ) → 𝑥 <s ( -us𝐴 ) )
24 23 adantl ( ( 𝐴 No 𝑥 ∈ ( L ‘ ( -us𝐴 ) ) ) → 𝑥 <s ( -us𝐴 ) )
25 negscl ( 𝐴 No → ( -us𝐴 ) ∈ No )
26 25 adantr ( ( 𝐴 No 𝑥 ∈ ( L ‘ ( -us𝐴 ) ) ) → ( -us𝐴 ) ∈ No )
27 3 26 ltnegsd ( ( 𝐴 No 𝑥 ∈ ( L ‘ ( -us𝐴 ) ) ) → ( 𝑥 <s ( -us𝐴 ) ↔ ( -us ‘ ( -us𝐴 ) ) <s ( -us𝑥 ) ) )
28 24 27 mpbid ( ( 𝐴 No 𝑥 ∈ ( L ‘ ( -us𝐴 ) ) ) → ( -us ‘ ( -us𝐴 ) ) <s ( -us𝑥 ) )
29 22 28 eqbrtrrd ( ( 𝐴 No 𝑥 ∈ ( L ‘ ( -us𝐴 ) ) ) → 𝐴 <s ( -us𝑥 ) )
30 elright ( ( -us𝑥 ) ∈ ( R ‘ 𝐴 ) ↔ ( ( -us𝑥 ) ∈ ( O ‘ ( bday 𝐴 ) ) ∧ 𝐴 <s ( -us𝑥 ) ) )
31 20 29 30 sylanbrc ( ( 𝐴 No 𝑥 ∈ ( L ‘ ( -us𝐴 ) ) ) → ( -us𝑥 ) ∈ ( R ‘ 𝐴 ) )
32 negnegs ( 𝑥 No → ( -us ‘ ( -us𝑥 ) ) = 𝑥 )
33 3 32 syl ( ( 𝐴 No 𝑥 ∈ ( L ‘ ( -us𝐴 ) ) ) → ( -us ‘ ( -us𝑥 ) ) = 𝑥 )
34 1 31 33 rspcedvdw ( ( 𝐴 No 𝑥 ∈ ( L ‘ ( -us𝐴 ) ) ) → ∃ 𝑦 ∈ ( R ‘ 𝐴 ) ( -us𝑦 ) = 𝑥 )
35 34 ex ( 𝐴 No → ( 𝑥 ∈ ( L ‘ ( -us𝐴 ) ) → ∃ 𝑦 ∈ ( R ‘ 𝐴 ) ( -us𝑦 ) = 𝑥 ) )
36 rightold ( 𝑦 ∈ ( R ‘ 𝐴 ) → 𝑦 ∈ ( O ‘ ( bday 𝐴 ) ) )
37 rightno ( 𝑦 ∈ ( R ‘ 𝐴 ) → 𝑦 No )
38 oldbday ( ( ( bday 𝐴 ) ∈ On ∧ 𝑦 No ) → ( 𝑦 ∈ ( O ‘ ( bday 𝐴 ) ) ↔ ( bday 𝑦 ) ∈ ( bday 𝐴 ) ) )
39 16 37 38 sylancr ( 𝑦 ∈ ( R ‘ 𝐴 ) → ( 𝑦 ∈ ( O ‘ ( bday 𝐴 ) ) ↔ ( bday 𝑦 ) ∈ ( bday 𝐴 ) ) )
40 36 39 mpbid ( 𝑦 ∈ ( R ‘ 𝐴 ) → ( bday 𝑦 ) ∈ ( bday 𝐴 ) )
41 40 adantl ( ( 𝐴 No 𝑦 ∈ ( R ‘ 𝐴 ) ) → ( bday 𝑦 ) ∈ ( bday 𝐴 ) )
42 37 adantl ( ( 𝐴 No 𝑦 ∈ ( R ‘ 𝐴 ) ) → 𝑦 No )
43 negbday ( 𝑦 No → ( bday ‘ ( -us𝑦 ) ) = ( bday 𝑦 ) )
44 42 43 syl ( ( 𝐴 No 𝑦 ∈ ( R ‘ 𝐴 ) ) → ( bday ‘ ( -us𝑦 ) ) = ( bday 𝑦 ) )
45 12 adantr ( ( 𝐴 No 𝑦 ∈ ( R ‘ 𝐴 ) ) → ( bday ‘ ( -us𝐴 ) ) = ( bday 𝐴 ) )
46 41 44 45 3eltr4d ( ( 𝐴 No 𝑦 ∈ ( R ‘ 𝐴 ) ) → ( bday ‘ ( -us𝑦 ) ) ∈ ( bday ‘ ( -us𝐴 ) ) )
47 42 negscld ( ( 𝐴 No 𝑦 ∈ ( R ‘ 𝐴 ) ) → ( -us𝑦 ) ∈ No )
48 oldbday ( ( ( bday ‘ ( -us𝐴 ) ) ∈ On ∧ ( -us𝑦 ) ∈ No ) → ( ( -us𝑦 ) ∈ ( O ‘ ( bday ‘ ( -us𝐴 ) ) ) ↔ ( bday ‘ ( -us𝑦 ) ) ∈ ( bday ‘ ( -us𝐴 ) ) ) )
49 8 47 48 sylancr ( ( 𝐴 No 𝑦 ∈ ( R ‘ 𝐴 ) ) → ( ( -us𝑦 ) ∈ ( O ‘ ( bday ‘ ( -us𝐴 ) ) ) ↔ ( bday ‘ ( -us𝑦 ) ) ∈ ( bday ‘ ( -us𝐴 ) ) ) )
50 46 49 mpbird ( ( 𝐴 No 𝑦 ∈ ( R ‘ 𝐴 ) ) → ( -us𝑦 ) ∈ ( O ‘ ( bday ‘ ( -us𝐴 ) ) ) )
51 rightgt ( 𝑦 ∈ ( R ‘ 𝐴 ) → 𝐴 <s 𝑦 )
52 51 adantl ( ( 𝐴 No 𝑦 ∈ ( R ‘ 𝐴 ) ) → 𝐴 <s 𝑦 )
53 simpl ( ( 𝐴 No 𝑦 ∈ ( R ‘ 𝐴 ) ) → 𝐴 No )
54 53 42 ltnegsd ( ( 𝐴 No 𝑦 ∈ ( R ‘ 𝐴 ) ) → ( 𝐴 <s 𝑦 ↔ ( -us𝑦 ) <s ( -us𝐴 ) ) )
55 52 54 mpbid ( ( 𝐴 No 𝑦 ∈ ( R ‘ 𝐴 ) ) → ( -us𝑦 ) <s ( -us𝐴 ) )
56 elleft ( ( -us𝑦 ) ∈ ( L ‘ ( -us𝐴 ) ) ↔ ( ( -us𝑦 ) ∈ ( O ‘ ( bday ‘ ( -us𝐴 ) ) ) ∧ ( -us𝑦 ) <s ( -us𝐴 ) ) )
57 50 55 56 sylanbrc ( ( 𝐴 No 𝑦 ∈ ( R ‘ 𝐴 ) ) → ( -us𝑦 ) ∈ ( L ‘ ( -us𝐴 ) ) )
58 eleq1 ( ( -us𝑦 ) = 𝑥 → ( ( -us𝑦 ) ∈ ( L ‘ ( -us𝐴 ) ) ↔ 𝑥 ∈ ( L ‘ ( -us𝐴 ) ) ) )
59 57 58 syl5ibcom ( ( 𝐴 No 𝑦 ∈ ( R ‘ 𝐴 ) ) → ( ( -us𝑦 ) = 𝑥𝑥 ∈ ( L ‘ ( -us𝐴 ) ) ) )
60 59 rexlimdva ( 𝐴 No → ( ∃ 𝑦 ∈ ( R ‘ 𝐴 ) ( -us𝑦 ) = 𝑥𝑥 ∈ ( L ‘ ( -us𝐴 ) ) ) )
61 35 60 impbid ( 𝐴 No → ( 𝑥 ∈ ( L ‘ ( -us𝐴 ) ) ↔ ∃ 𝑦 ∈ ( R ‘ 𝐴 ) ( -us𝑦 ) = 𝑥 ) )
62 negsfn -us Fn No
63 rightssno ( R ‘ 𝐴 ) ⊆ No
64 fvelimab ( ( -us Fn No ∧ ( R ‘ 𝐴 ) ⊆ No ) → ( 𝑥 ∈ ( -us “ ( R ‘ 𝐴 ) ) ↔ ∃ 𝑦 ∈ ( R ‘ 𝐴 ) ( -us𝑦 ) = 𝑥 ) )
65 62 63 64 mp2an ( 𝑥 ∈ ( -us “ ( R ‘ 𝐴 ) ) ↔ ∃ 𝑦 ∈ ( R ‘ 𝐴 ) ( -us𝑦 ) = 𝑥 )
66 61 65 bitr4di ( 𝐴 No → ( 𝑥 ∈ ( L ‘ ( -us𝐴 ) ) ↔ 𝑥 ∈ ( -us “ ( R ‘ 𝐴 ) ) ) )
67 66 eqrdv ( 𝐴 No → ( L ‘ ( -us𝐴 ) ) = ( -us “ ( R ‘ 𝐴 ) ) )