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

Theorem recsex 28664
Description: A nonzero surreal has a reciprocal. (Contributed by Scott Fenton, 15-Mar-2025.)
Assertion
Ref Expression
recsex ((𝐴 ∈ No ∧ 𝐴 ≠ 0s ) → ∃𝑥 ∈ No (𝐴 ·s 𝑥) = 1s )
Distinct variable group:   𝑥,𝐴

Proof of Theorem recsex
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 0no 28254 . . . 4 0s ∈ No
2 ltstrine 28167 . . . 4 ((𝐴 ∈ No ∧ 0s ∈ No) → (𝐴 ≠ 0s ↔ (𝐴 <s 0s ∨ 0s <s 𝐴)))
31, 2mpan2 704 . . 3 (𝐴 ∈ No → (𝐴 ≠ 0s ↔ (𝐴 <s 0s ∨ 0s <s 𝐴)))
4 ltnegs 28490 . . . . . . 7 ((𝐴 ∈ No ∧ 0s ∈ No) → (𝐴 <s 0s ↔ ( -s‘ 0s ) <s ( -s‘𝐴)))
51, 4mpan2 704 . . . . . 6 (𝐴 ∈ No → (𝐴 <s 0s ↔ ( -s‘ 0s ) <s ( -s‘𝐴)))
6 neg0s 28471 . . . . . . 7 ( -s‘ 0s ) = 0s
76breq1i 5114 . . . . . 6 (( -s‘ 0s ) <s ( -s‘𝐴) ↔ 0s <s ( -s‘𝐴))
85, 7bitrdi 290 . . . . 5 (𝐴 ∈ No → (𝐴 <s 0s ↔ 0s <s ( -s‘𝐴)))
9 negscl 28481 . . . . . . . 8 (𝐴 ∈ No → ( -s‘𝐴) ∈ No)
10 precsex 28663 . . . . . . . 8 ((( -s‘𝐴) ∈ No ∧ 0s <s ( -s‘𝐴)) → ∃𝑦 ∈ No (( -s‘𝐴) ·s 𝑦) = 1s )
119, 10sylan 592 . . . . . . 7 ((𝐴 ∈ No ∧ 0s <s ( -s‘𝐴)) → ∃𝑦 ∈ No (( -s‘𝐴) ·s 𝑦) = 1s )
12 simprl 783 . . . . . . . . 9 (((𝐴 ∈ No ∧ 0s <s ( -s‘𝐴)) ∧ (𝑦 ∈ No ∧ (( -s‘𝐴) ·s 𝑦) = 1s )) → 𝑦 ∈ No)
1312negscld 28482 . . . . . . . 8 (((𝐴 ∈ No ∧ 0s <s ( -s‘𝐴)) ∧ (𝑦 ∈ No ∧ (( -s‘𝐴) ·s 𝑦) = 1s )) → ( -s‘𝑦) ∈ No)
14 simpll 779 . . . . . . . . . . . . 13 (((𝐴 ∈ No ∧ 0s <s ( -s‘𝐴)) ∧ 𝑦 ∈ No) → 𝐴 ∈ No)
15 simpr 490 . . . . . . . . . . . . 13 (((𝐴 ∈ No ∧ 0s <s ( -s‘𝐴)) ∧ 𝑦 ∈ No) → 𝑦 ∈ No)
1614, 15mulnegs1d 28605 . . . . . . . . . . . 12 (((𝐴 ∈ No ∧ 0s <s ( -s‘𝐴)) ∧ 𝑦 ∈ No) → (( -s‘𝐴) ·s 𝑦) = ( -s‘(𝐴 ·s 𝑦)))
1714, 15mulnegs2d 28606 . . . . . . . . . . . 12 (((𝐴 ∈ No ∧ 0s <s ( -s‘𝐴)) ∧ 𝑦 ∈ No) → (𝐴 ·s ( -s‘𝑦)) = ( -s‘(𝐴 ·s 𝑦)))
1816, 17eqtr4d 2804 . . . . . . . . . . 11 (((𝐴 ∈ No ∧ 0s <s ( -s‘𝐴)) ∧ 𝑦 ∈ No) → (( -s‘𝐴) ·s 𝑦) = (𝐴 ·s ( -s‘𝑦)))
1918eqeq1d 2768 . . . . . . . . . 10 (((𝐴 ∈ No ∧ 0s <s ( -s‘𝐴)) ∧ 𝑦 ∈ No) → ((( -s‘𝐴) ·s 𝑦) = 1s ↔ (𝐴 ·s ( -s‘𝑦)) = 1s ))
2019biimpd 232 . . . . . . . . 9 (((𝐴 ∈ No ∧ 0s <s ( -s‘𝐴)) ∧ 𝑦 ∈ No) → ((( -s‘𝐴) ·s 𝑦) = 1s → (𝐴 ·s ( -s‘𝑦)) = 1s ))
2120impr 460 . . . . . . . 8 (((𝐴 ∈ No ∧ 0s <s ( -s‘𝐴)) ∧ (𝑦 ∈ No ∧ (( -s‘𝐴) ·s 𝑦) = 1s )) → (𝐴 ·s ( -s‘𝑦)) = 1s )
22 oveq2 7458 . . . . . . . . . 10 (𝑥 = ( -s‘𝑦) → (𝐴 ·s 𝑥) = (𝐴 ·s ( -s‘𝑦)))
2322eqeq1d 2768 . . . . . . . . 9 (𝑥 = ( -s‘𝑦) → ((𝐴 ·s 𝑥) = 1s ↔ (𝐴 ·s ( -s‘𝑦)) = 1s ))
2423rspcev 3579 . . . . . . . 8 ((( -s‘𝑦) ∈ No ∧ (𝐴 ·s ( -s‘𝑦)) = 1s ) → ∃𝑥 ∈ No (𝐴 ·s 𝑥) = 1s )
2513, 21, 24syl2anc 596 . . . . . . 7 (((𝐴 ∈ No ∧ 0s <s ( -s‘𝐴)) ∧ (𝑦 ∈ No ∧ (( -s‘𝐴) ·s 𝑦) = 1s )) → ∃𝑥 ∈ No (𝐴 ·s 𝑥) = 1s )
2611, 25rexlimddv 3176 . . . . . 6 ((𝐴 ∈ No ∧ 0s <s ( -s‘𝐴)) → ∃𝑥 ∈ No (𝐴 ·s 𝑥) = 1s )
2726ex 418 . . . . 5 (𝐴 ∈ No → ( 0s <s ( -s‘𝐴) → ∃𝑥 ∈ No (𝐴 ·s 𝑥) = 1s ))
288, 27sylbid 243 . . . 4 (𝐴 ∈ No → (𝐴 <s 0s → ∃𝑥 ∈ No (𝐴 ·s 𝑥) = 1s ))
29 precsex 28663 . . . . 5 ((𝐴 ∈ No ∧ 0s <s 𝐴) → ∃𝑥 ∈ No (𝐴 ·s 𝑥) = 1s )
3029ex 418 . . . 4 (𝐴 ∈ No → ( 0s <s 𝐴 → ∃𝑥 ∈ No (𝐴 ·s 𝑥) = 1s ))
3128, 30jaod 873 . . 3 (𝐴 ∈ No → ((𝐴 <s 0s ∨ 0s <s 𝐴) → ∃𝑥 ∈ No (𝐴 ·s 𝑥) = 1s ))
323, 31sylbid 243 . 2 (𝐴 ∈ No → (𝐴 ≠ 0s → ∃𝑥 ∈ No (𝐴 ·s 𝑥) = 1s ))
3332imp 412 1 ((𝐴 ∈ No ∧ 𝐴 ≠ 0s ) → ∃𝑥 ∈ No (𝐴 ·s 𝑥) = 1s )
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1572   ∈ wcel 2150   ≠ wne 2962  ∃wrex 3093   class class class wbr 5107  ‘cfv 6565  (class class class)co 7450  Nocsur 28056   <s clts 28057   0s c0s 28250   1s c1s 28251   -scnegs 28464   ·s cmuls 28551
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782  ax-dc 10562
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-tp 4592  df-op 4840  df-ot 4863  df-uni 4872  df-int 4912  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-se 5611  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-pred 6329  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-riota 7407  df-ov 7453  df-oprab 7454  df-mpo 7455  df-om 7911  df-1st 8034  df-2nd 8035  df-frecs 8336  df-wrecs 8367  df-recs 8416  df-rdg 8455  df-1o 8513  df-2o 8514  df-oadd 8517  df-nadd 8712  df-no 28059  df-lts 28060  df-bday 28061  df-les 28161  df-slts 28203  df-cuts 28205  df-0s 28252  df-1s 28253  df-made 28272  df-old 28273  df-left 28275  df-right 28276  df-norec 28383  df-norec2 28394  df-adds 28405  df-negs 28466  df-subs 28467  df-muls 28552  df-divs 28633
This theorem is used by:  recsexd  28665  divmuls  28666  divscl  28668
  Copyright terms: Public domain W3C validator