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

Theorem negsproplem3 28416
Description: Lemma for surreal negation. Give the cut properties of surreal negation. (Contributed by Scott Fenton, 2-Feb-2025.)
Hypotheses
Ref Expression
negsproplem.1 (𝜑 → ∀𝑥 ∈ No ∀𝑦 ∈ No (((bday‘𝑥) ∪ (bday‘𝑦)) ∈ ((bday‘𝐴) ∪ (bday‘𝐵)) → (( -s‘𝑥) ∈ No ∧ (𝑥 <s 𝑦 → ( -s‘𝑦) <s ( -s‘𝑥)))))
negsproplem2.1 (𝜑 → 𝐴 ∈ No)
Assertion
Ref Expression
negsproplem3 (𝜑 → (( -s‘𝐴) ∈ No ∧ ( -s “ (R‘𝐴)) <<s {( -s‘𝐴)} ∧ {( -s‘𝐴)} <<s ( -s “ (L‘𝐴))))
Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦
Allowed substitution hints:   𝜑(𝑥, 𝑦)

Proof of Theorem negsproplem3
StepHypRef Expression
1 negsproplem.1 . . . 4 (𝜑 → ∀𝑥 ∈ No ∀𝑦 ∈ No (((bday‘𝑥) ∪ (bday‘𝑦)) ∈ ((bday‘𝐴) ∪ (bday‘𝐵)) → (( -s‘𝑥) ∈ No ∧ (𝑥 <s 𝑦 → ( -s‘𝑦) <s ( -s‘𝑥)))))
2 negsproplem2.1 . . . 4 (𝜑 → 𝐴 ∈ No)
31, 2negsproplem2 28415 . . 3 (𝜑 → ( -s “ (R‘𝐴)) <<s ( -s “ (L‘𝐴)))
4 cutcuts 28167 . . 3 (( -s “ (R‘𝐴)) <<s ( -s “ (L‘𝐴)) → ((( -s “ (R‘𝐴)) |s ( -s “ (L‘𝐴))) ∈ No ∧ ( -s “ (R‘𝐴)) <<s {(( -s “ (R‘𝐴)) |s ( -s “ (L‘𝐴)))} ∧ {(( -s “ (R‘𝐴)) |s ( -s “ (L‘𝐴)))} <<s ( -s “ (L‘𝐴))))
53, 4syl 18 . 2 (𝜑 → ((( -s “ (R‘𝐴)) |s ( -s “ (L‘𝐴))) ∈ No ∧ ( -s “ (R‘𝐴)) <<s {(( -s “ (R‘𝐴)) |s ( -s “ (L‘𝐴)))} ∧ {(( -s “ (R‘𝐴)) |s ( -s “ (L‘𝐴)))} <<s ( -s “ (L‘𝐴))))
6 negsval 28411 . . . . 5 (𝐴 ∈ No → ( -s‘𝐴) = (( -s “ (R‘𝐴)) |s ( -s “ (L‘𝐴))))
72, 6syl 18 . . . 4 (𝜑 → ( -s‘𝐴) = (( -s “ (R‘𝐴)) |s ( -s “ (L‘𝐴))))
87eleq1d 2846 . . 3 (𝜑 → (( -s‘𝐴) ∈ No ↔ (( -s “ (R‘𝐴)) |s ( -s “ (L‘𝐴))) ∈ No))
97sneqd 4596 . . . 4 (𝜑 → {( -s‘𝐴)} = {(( -s “ (R‘𝐴)) |s ( -s “ (L‘𝐴)))})
109breq2d 5115 . . 3 (𝜑 → (( -s “ (R‘𝐴)) <<s {( -s‘𝐴)} ↔ ( -s “ (R‘𝐴)) <<s {(( -s “ (R‘𝐴)) |s ( -s “ (L‘𝐴)))}))
119breq1d 5113 . . 3 (𝜑 → ({( -s‘𝐴)} <<s ( -s “ (L‘𝐴)) ↔ {(( -s “ (R‘𝐴)) |s ( -s “ (L‘𝐴)))} <<s ( -s “ (L‘𝐴))))
128, 10, 113anbi123d 1464 . 2 (𝜑 → ((( -s‘𝐴) ∈ No ∧ ( -s “ (R‘𝐴)) <<s {( -s‘𝐴)} ∧ {( -s‘𝐴)} <<s ( -s “ (L‘𝐴))) ↔ ((( -s “ (R‘𝐴)) |s ( -s “ (L‘𝐴))) ∈ No ∧ ( -s “ (R‘𝐴)) <<s {(( -s “ (R‘𝐴)) |s ( -s “ (L‘𝐴)))} ∧ {(( -s “ (R‘𝐴)) |s ( -s “ (L‘𝐴)))} <<s ( -s “ (L‘𝐴)))))
135, 12mpbird 260 1 (𝜑 → (( -s‘𝐴) ∈ No ∧ ( -s “ (R‘𝐴)) <<s {( -s‘𝐴)} ∧ {( -s‘𝐴)} <<s ( -s “ (L‘𝐴))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3077   ∪ cun 3897  {csn 4584   class class class wbr 5103   “ cima 5654  ‘cfv 6538  (class class class)co 7420  Nocsur 27997   <s clts 27998  bdaycbday 27999   <<s cslts 28143   |s ccuts 28145  Lcleft 28211  Rcright 28212   -scnegs 28405
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 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-se 5605  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6304  df-ord 6365  df-on 6366  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-2nd 8002  df-frecs 8299  df-wrecs 8330  df-recs 8379  df-1o 8476  df-2o 8477  df-no 28000  df-lts 28001  df-bday 28002  df-slts 28144  df-cuts 28146  df-0s 28193  df-made 28213  df-old 28214  df-left 28216  df-right 28217  df-norec 28324  df-negs 28407
This theorem is used by:  negsproplem4  28417  negsproplem5  28418  negsproplem6  28419  negsprop  28421  negcut  28425
  Copyright terms: Public domain W3C validator