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

Theorem recsne0 28511
Description: If a surreal has a reciprocal, then it is nonzero. (Contributed by Scott Fenton, 5-Sep-2025.)
Hypotheses
Ref Expression
recsne0.1 (𝜑 → 𝐴 ∈ No )
recsne0.2 (𝜑 → ∃𝑥 ∈ No (𝐴 ·s 𝑥) = 1s )
Assertion
Ref Expression
recsne0 (𝜑 → 𝐴 ≠ 0s )
Distinct variable group:   𝑥,𝐴
Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem recsne0
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 recsne0.2 . . 3 (𝜑 → ∃𝑥 ∈ No (𝐴 ·s 𝑥) = 1s )
2 oveq2 7416 . . . . 5 (𝑥 = 𝑦 → (𝐴 ·s 𝑥) = (𝐴 ·s 𝑦))
32eqeq1d 2762 . . . 4 (𝑥 = 𝑦 → ((𝐴 ·s 𝑥) = 1s ↔ (𝐴 ·s 𝑦) = 1s ))
43cbvrexvw 3241 . . 3 (∃𝑥 ∈ No (𝐴 ·s 𝑥) = 1s ↔ ∃𝑦 ∈ No (𝐴 ·s 𝑦) = 1s )
51, 4sylib 221 . 2 (𝜑 → ∃𝑦 ∈ No (𝐴 ·s 𝑦) = 1s )
6 simprr 785 . . . . 5 ((𝜑 ∧ (𝑦 ∈ No ∧ (𝐴 ·s 𝑦) = 1s )) → (𝐴 ·s 𝑦) = 1s )
7 1ne0s 28139 . . . . . 6 1s ≠ 0s
87a1i 11 . . . . 5 ((𝜑 ∧ (𝑦 ∈ No ∧ (𝐴 ·s 𝑦) = 1s )) → 1s ≠ 0s )
96, 8eqnetrd 3022 . . . 4 ((𝜑 ∧ (𝑦 ∈ No ∧ (𝐴 ·s 𝑦) = 1s )) → (𝐴 ·s 𝑦) ≠ 0s )
10 recsne0.1 . . . . . 6 (𝜑 → 𝐴 ∈ No )
1110adantr 486 . . . . 5 ((𝜑 ∧ (𝑦 ∈ No ∧ (𝐴 ·s 𝑦) = 1s )) → 𝐴 ∈ No )
12 simprl 783 . . . . 5 ((𝜑 ∧ (𝑦 ∈ No ∧ (𝐴 ·s 𝑦) = 1s )) → 𝑦 ∈ No )
1311, 12mulsne0bd 28505 . . . 4 ((𝜑 ∧ (𝑦 ∈ No ∧ (𝐴 ·s 𝑦) = 1s )) → ((𝐴 ·s 𝑦) ≠ 0s ↔ (𝐴 ≠ 0s ∧ 𝑦 ≠ 0s )))
149, 13mpbid 235 . . 3 ((𝜑 ∧ (𝑦 ∈ No ∧ (𝐴 ·s 𝑦) = 1s )) → (𝐴 ≠ 0s ∧ 𝑦 ≠ 0s ))
1514simpld 500 . 2 ((𝜑 ∧ (𝑦 ∈ No ∧ (𝐴 ·s 𝑦) = 1s )) → 𝐴 ≠ 0s )
165, 15rexlimddv 3169 1 (𝜑 → 𝐴 ≠ 0s )
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ≠ wne 2955  ∃wrex 3086  (class class class)co 7408   No csur 27930   0s c0s 28124   1s c1s 28125   ·s cmuls 28425
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7734
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-tp 4588  df-op 4590  df-ot 4592  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-se 5601  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-pred 6293  df-ord 6354  df-on 6355  df-suc 6357  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-f1 6532  df-fo 6533  df-f1o 6534  df-fv 6535  df-riota 7365  df-ov 7411  df-oprab 7412  df-mpo 7413  df-1st 7984  df-2nd 7985  df-frecs 8277  df-wrecs 8308  df-recs 8357  df-1o 8454  df-2o 8455  df-nadd 8653  df-no 27933  df-lts 27934  df-bday 27935  df-les 28035  df-slts 28077  df-cuts 28079  df-0s 28126  df-1s 28127  df-made 28146  df-old 28147  df-left 28149  df-right 28150  df-norec 28257  df-norec2 28268  df-adds 28279  df-negs 28340  df-subs 28341  df-muls 28426
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator