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

Theorem cuteq0 27874
Description: Condition for a surreal cut to equal zero. (Contributed by Scott Fenton, 3-Feb-2025.)
Hypotheses
Ref Expression
cuteq0.1 (𝜑𝐴 <<s { 0s })
cuteq0.2 (𝜑 → { 0s } <<s 𝐵)
Assertion
Ref Expression
cuteq0 (𝜑 → (𝐴 |s 𝐵) = 0s )

Proof of Theorem cuteq0
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cuteq0.1 . 2 (𝜑𝐴 <<s { 0s })
2 cuteq0.2 . 2 (𝜑 → { 0s } <<s 𝐵)
3 bday0 27870 . . 3 ( bday ‘ 0s ) = ∅
43a1i 11 . . . . . 6 (𝜑 → ( bday ‘ 0s ) = ∅)
5 0no 27868 . . . . . . 7 0s No
6 sneq 4582 . . . . . . . . . . 11 (𝑦 = 0s → {𝑦} = { 0s })
76breq2d 5102 . . . . . . . . . 10 (𝑦 = 0s → (𝐴 <<s {𝑦} ↔ 𝐴 <<s { 0s }))
86breq1d 5100 . . . . . . . . . 10 (𝑦 = 0s → ({𝑦} <<s 𝐵 ↔ { 0s } <<s 𝐵))
97, 8anbi12d 640 . . . . . . . . 9 (𝑦 = 0s → ((𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵) ↔ (𝐴 <<s { 0s } ∧ { 0s } <<s 𝐵)))
10 fveqeq2 6861 . . . . . . . . 9 (𝑦 = 0s → (( bday 𝑦) = ∅ ↔ ( bday ‘ 0s ) = ∅))
119, 10anbi12d 640 . . . . . . . 8 (𝑦 = 0s → (((𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵) ∧ ( bday 𝑦) = ∅) ↔ ((𝐴 <<s { 0s } ∧ { 0s } <<s 𝐵) ∧ ( bday ‘ 0s ) = ∅)))
1211rspcev 3572 . . . . . . 7 (( 0s No ∧ ((𝐴 <<s { 0s } ∧ { 0s } <<s 𝐵) ∧ ( bday ‘ 0s ) = ∅)) → ∃𝑦 No ((𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵) ∧ ( bday 𝑦) = ∅))
135, 12mpan 698 . . . . . 6 (((𝐴 <<s { 0s } ∧ { 0s } <<s 𝐵) ∧ ( bday ‘ 0s ) = ∅) → ∃𝑦 No ((𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵) ∧ ( bday 𝑦) = ∅))
141, 2, 4, 13syl21anc 846 . . . . 5 (𝜑 → ∃𝑦 No ((𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵) ∧ ( bday 𝑦) = ∅))
15 bdayfn 27807 . . . . . . 7 bday Fn No
16 ssrab2 4024 . . . . . . 7 {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)} ⊆ No
17 fvelimab 6924 . . . . . . 7 (( bday Fn No ∧ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)} ⊆ No ) → (∅ ∈ ( bday “ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)}) ↔ ∃𝑦 ∈ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)} ( bday 𝑦) = ∅))
1815, 16, 17mp2an 700 . . . . . 6 (∅ ∈ ( bday “ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)}) ↔ ∃𝑦 ∈ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)} ( bday 𝑦) = ∅)
19 sneq 4582 . . . . . . . . 9 (𝑥 = 𝑦 → {𝑥} = {𝑦})
2019breq2d 5102 . . . . . . . 8 (𝑥 = 𝑦 → (𝐴 <<s {𝑥} ↔ 𝐴 <<s {𝑦}))
2119breq1d 5100 . . . . . . . 8 (𝑥 = 𝑦 → ({𝑥} <<s 𝐵 ↔ {𝑦} <<s 𝐵))
2220, 21anbi12d 640 . . . . . . 7 (𝑥 = 𝑦 → ((𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵) ↔ (𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵)))
2322rexrab 3649 . . . . . 6 (∃𝑦 ∈ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)} ( bday 𝑦) = ∅ ↔ ∃𝑦 No ((𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵) ∧ ( bday 𝑦) = ∅))
2418, 23bitri 277 . . . . 5 (∅ ∈ ( bday “ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)}) ↔ ∃𝑦 No ((𝐴 <<s {𝑦} ∧ {𝑦} <<s 𝐵) ∧ ( bday 𝑦) = ∅))
2514, 24sylibr 236 . . . 4 (𝜑 → ∅ ∈ ( bday “ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)}))
26 int0el 4927 . . . 4 (∅ ∈ ( bday “ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)}) → ( bday “ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)}) = ∅)
2725, 26syl 17 . . 3 (𝜑 ( bday “ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)}) = ∅)
283, 27eqtr4id 2806 . 2 (𝜑 → ( bday ‘ 0s ) = ( bday “ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)}))
295elexi 3466 . . . . . 6 0s ∈ V
3029snnz 4725 . . . . 5 { 0s } ≠ ∅
31 sltstr 27846 . . . . 5 ((𝐴 <<s { 0s } ∧ { 0s } <<s 𝐵 ∧ { 0s } ≠ ∅) → 𝐴 <<s 𝐵)
3230, 31mp3an3 1461 . . . 4 ((𝐴 <<s { 0s } ∧ { 0s } <<s 𝐵) → 𝐴 <<s 𝐵)
331, 2, 32syl2anc 592 . . 3 (𝜑𝐴 <<s 𝐵)
34 eqcuts 27844 . . 3 ((𝐴 <<s 𝐵 ∧ 0s No ) → ((𝐴 |s 𝐵) = 0s ↔ (𝐴 <<s { 0s } ∧ { 0s } <<s 𝐵 ∧ ( bday ‘ 0s ) = ( bday “ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)}))))
3533, 5, 34sylancl 594 . 2 (𝜑 → ((𝐴 |s 𝐵) = 0s ↔ (𝐴 <<s { 0s } ∧ { 0s } <<s 𝐵 ∧ ( bday ‘ 0s ) = ( bday “ {𝑥 No ∣ (𝐴 <<s {𝑥} ∧ {𝑥} <<s 𝐵)}))))
361, 2, 28, 35mpbir3and 1352 1 (𝜑 → (𝐴 |s 𝐵) = 0s )
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398  w3a 1095   = wceq 1550  wcel 2132  wne 2947  wrex 3076  {crab 3404  wss 3895  c0 4276  {csn 4572   cint 4895   class class class wbr 5090  cima 5639   Fn wfn 6501  cfv 6506  (class class class)co 7381   No csur 27670   bday cbday 27672   <<s cslts 27816   |s ccuts 27818   0s c0s 27864
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1805  ax-4 1819  ax-5 1920  ax-6 1977  ax-7 2018  ax-8 2134  ax-9 2142  ax-10 2165  ax-11 2181  ax-12 2202  ax-ext 2724  ax-rep 5217  ax-sep 5236  ax-nul 5246  ax-pow 5312  ax-pr 5380  ax-un 7703
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-3or 1096  df-3an 1097  df-tru 1553  df-fal 1563  df-ex 1790  df-nf 1794  df-sb 2081  df-mo 2556  df-eu 2586  df-clab 2731  df-cleq 2744  df-clel 2827  df-nfc 2901  df-ne 2948  df-ral 3067  df-rex 3077  df-rmo 3357  df-reu 3358  df-rab 3405  df-v 3446  df-sbc 3736  df-csb 3844  df-dif 3898  df-un 3900  df-in 3902  df-ss 3912  df-pss 3915  df-nul 4277  df-if 4471  df-pw 4547  df-sn 4573  df-pr 4575  df-tp 4577  df-op 4579  df-uni 4856  df-int 4896  df-br 5091  df-opab 5153  df-mpt 5172  df-tr 5198  df-id 5531  df-eprel 5536  df-po 5544  df-so 5545  df-fr 5589  df-we 5591  df-xp 5642  df-rel 5643  df-cnv 5644  df-co 5645  df-dm 5646  df-rn 5647  df-res 5648  df-ima 5649  df-ord 6334  df-on 6335  df-suc 6337  df-iota 6462  df-fun 6508  df-fn 6509  df-f 6510  df-f1 6511  df-fo 6512  df-f1o 6513  df-fv 6514  df-riota 7338  df-ov 7384  df-oprab 7385  df-mpo 7386  df-1o 8421  df-2o 8422  df-no 27673  df-lts 27674  df-bday 27675  df-slts 27817  df-cuts 27819  df-0s 27866
This theorem is referenced by:  cutneg  27875  negsid  28100
  Copyright terms: Public domain W3C validator