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

Theorem eqscut 27868
Description: Condition for equality to a surreal cut. (Contributed by Scott Fenton, 8-Aug-2024.)
Assertion
Ref Expression
eqscut ((𝐿 <<s 𝑅𝑋 No ) → ((𝐿 |s 𝑅) = 𝑋 ↔ (𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅 ∧ ( bday 𝑋) = ( bday “ {𝑦 No ∣ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)}))))
Distinct variable groups:   𝑦,𝐿   𝑦,𝑅
Allowed substitution hint:   𝑋(𝑦)

Proof of Theorem eqscut
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 scutval 27863 . . . . 5 (𝐿 <<s 𝑅 → (𝐿 |s 𝑅) = (𝑥 ∈ {𝑦 No ∣ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)})))
21adantr 480 . . . 4 ((𝐿 <<s 𝑅𝑋 No ) → (𝐿 |s 𝑅) = (𝑥 ∈ {𝑦 No ∣ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)})))
3 sneq 4658 . . . . . . 7 (𝑥 = 𝑦 → {𝑥} = {𝑦})
43breq2d 5178 . . . . . 6 (𝑥 = 𝑦 → (𝐿 <<s {𝑥} ↔ 𝐿 <<s {𝑦}))
53breq1d 5176 . . . . . 6 (𝑥 = 𝑦 → ({𝑥} <<s 𝑅 ↔ {𝑦} <<s 𝑅))
64, 5anbi12d 631 . . . . 5 (𝑥 = 𝑦 → ((𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅) ↔ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)))
76riotarab 7447 . . . 4 (𝑥 ∈ {𝑦 No ∣ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)})) = (𝑥 No ((𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅) ∧ ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)})))
82, 7eqtrdi 2796 . . 3 ((𝐿 <<s 𝑅𝑋 No ) → (𝐿 |s 𝑅) = (𝑥 No ((𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅) ∧ ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)}))))
98eqeq1d 2742 . 2 ((𝐿 <<s 𝑅𝑋 No ) → ((𝐿 |s 𝑅) = 𝑋 ↔ (𝑥 No ((𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅) ∧ ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)}))) = 𝑋))
10 conway 27862 . . . 4 (𝐿 <<s 𝑅 → ∃!𝑥 ∈ {𝑦 No ∣ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)}))
116reurab 3723 . . . 4 (∃!𝑥 ∈ {𝑦 No ∣ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)} ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)}) ↔ ∃!𝑥 No ((𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅) ∧ ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)})))
1210, 11sylib 218 . . 3 (𝐿 <<s 𝑅 → ∃!𝑥 No ((𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅) ∧ ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)})))
13 df-3an 1089 . . . . . 6 ((𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅 ∧ ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)})) ↔ ((𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅) ∧ ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)})))
14 sneq 4658 . . . . . . . 8 (𝑥 = 𝑋 → {𝑥} = {𝑋})
1514breq2d 5178 . . . . . . 7 (𝑥 = 𝑋 → (𝐿 <<s {𝑥} ↔ 𝐿 <<s {𝑋}))
1614breq1d 5176 . . . . . . 7 (𝑥 = 𝑋 → ({𝑥} <<s 𝑅 ↔ {𝑋} <<s 𝑅))
17 fveqeq2 6929 . . . . . . 7 (𝑥 = 𝑋 → (( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)}) ↔ ( bday 𝑋) = ( bday “ {𝑦 No ∣ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)})))
1815, 16, 173anbi123d 1436 . . . . . 6 (𝑥 = 𝑋 → ((𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅 ∧ ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)})) ↔ (𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅 ∧ ( bday 𝑋) = ( bday “ {𝑦 No ∣ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)}))))
1913, 18bitr3id 285 . . . . 5 (𝑥 = 𝑋 → (((𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅) ∧ ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)})) ↔ (𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅 ∧ ( bday 𝑋) = ( bday “ {𝑦 No ∣ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)}))))
2019riota2 7430 . . . 4 ((𝑋 No ∧ ∃!𝑥 No ((𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅) ∧ ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)}))) → ((𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅 ∧ ( bday 𝑋) = ( bday “ {𝑦 No ∣ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)})) ↔ (𝑥 No ((𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅) ∧ ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)}))) = 𝑋))
2120ancoms 458 . . 3 ((∃!𝑥 No ((𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅) ∧ ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)})) ∧ 𝑋 No ) → ((𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅 ∧ ( bday 𝑋) = ( bday “ {𝑦 No ∣ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)})) ↔ (𝑥 No ((𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅) ∧ ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)}))) = 𝑋))
2212, 21sylan 579 . 2 ((𝐿 <<s 𝑅𝑋 No ) → ((𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅 ∧ ( bday 𝑋) = ( bday “ {𝑦 No ∣ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)})) ↔ (𝑥 No ((𝐿 <<s {𝑥} ∧ {𝑥} <<s 𝑅) ∧ ( bday 𝑥) = ( bday “ {𝑦 No ∣ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)}))) = 𝑋))
239, 22bitr4d 282 1 ((𝐿 <<s 𝑅𝑋 No ) → ((𝐿 |s 𝑅) = 𝑋 ↔ (𝐿 <<s {𝑋} ∧ {𝑋} <<s 𝑅 ∧ ( bday 𝑋) = ( bday “ {𝑦 No ∣ (𝐿 <<s {𝑦} ∧ {𝑦} <<s 𝑅)}))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1087   = wceq 1537  wcel 2108  ∃!wreu 3386  {crab 3443  {csn 4648   cint 4970   class class class wbr 5166  cima 5703  cfv 6573  crio 7403  (class class class)co 7448   No csur 27702   bday cbday 27704   <<s csslt 27843   |s cscut 27845
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-rep 5303  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rmo 3388  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-tp 4653  df-op 4655  df-uni 4932  df-int 4971  df-br 5167  df-opab 5229  df-mpt 5250  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-ord 6398  df-on 6399  df-suc 6401  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-riota 7404  df-ov 7451  df-oprab 7452  df-mpo 7453  df-1o 8522  df-2o 8523  df-no 27705  df-slt 27706  df-bday 27707  df-sslt 27844  df-scut 27846
This theorem is referenced by:  eqscut2  27869  cuteq0  27895  madebdaylemlrcut  27955  cofcut1  27972
  Copyright terms: Public domain W3C validator