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

Theorem addsrid 27972
Description: Surreal addition to zero is identity. Part of Theorem 3 of [Conway] p. 17. (Contributed by Scott Fenton, 20-Aug-2024.)
Assertion
Ref Expression
addsrid (𝐴 No → (𝐴 +s 0s ) = 𝐴)

Proof of Theorem addsrid
Dummy variables 𝑎 𝑏 𝑤 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oveq1 7375 . . 3 (𝑎 = 𝑏 → (𝑎 +s 0s ) = (𝑏 +s 0s ))
2 id 22 . . 3 (𝑎 = 𝑏𝑎 = 𝑏)
31, 2eqeq12d 2753 . 2 (𝑎 = 𝑏 → ((𝑎 +s 0s ) = 𝑎 ↔ (𝑏 +s 0s ) = 𝑏))
4 oveq1 7375 . . 3 (𝑎 = 𝐴 → (𝑎 +s 0s ) = (𝐴 +s 0s ))
5 id 22 . . 3 (𝑎 = 𝐴𝑎 = 𝐴)
64, 5eqeq12d 2753 . 2 (𝑎 = 𝐴 → ((𝑎 +s 0s ) = 𝑎 ↔ (𝐴 +s 0s ) = 𝐴))
7 0no 27817 . . . . . 6 0s No
8 addsval 27970 . . . . . 6 ((𝑎 No ∧ 0s No ) → (𝑎 +s 0s ) = (({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝑎)𝑥 = (𝑦 +s 0s )} ∪ {𝑧 ∣ ∃𝑦 ∈ ( L ‘ 0s )𝑧 = (𝑎 +s 𝑦)}) |s ({𝑥 ∣ ∃𝑤 ∈ ( R ‘𝑎)𝑥 = (𝑤 +s 0s )} ∪ {𝑧 ∣ ∃𝑤 ∈ ( R ‘ 0s )𝑧 = (𝑎 +s 𝑤)})))
97, 8mpan2 692 . . . . 5 (𝑎 No → (𝑎 +s 0s ) = (({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝑎)𝑥 = (𝑦 +s 0s )} ∪ {𝑧 ∣ ∃𝑦 ∈ ( L ‘ 0s )𝑧 = (𝑎 +s 𝑦)}) |s ({𝑥 ∣ ∃𝑤 ∈ ( R ‘𝑎)𝑥 = (𝑤 +s 0s )} ∪ {𝑧 ∣ ∃𝑤 ∈ ( R ‘ 0s )𝑧 = (𝑎 +s 𝑤)})))
109adantr 480 . . . 4 ((𝑎 No ∧ ∀𝑏 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))(𝑏 +s 0s ) = 𝑏) → (𝑎 +s 0s ) = (({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝑎)𝑥 = (𝑦 +s 0s )} ∪ {𝑧 ∣ ∃𝑦 ∈ ( L ‘ 0s )𝑧 = (𝑎 +s 𝑦)}) |s ({𝑥 ∣ ∃𝑤 ∈ ( R ‘𝑎)𝑥 = (𝑤 +s 0s )} ∪ {𝑧 ∣ ∃𝑤 ∈ ( R ‘ 0s )𝑧 = (𝑎 +s 𝑤)})))
11 elun1 4136 . . . . . . . . . . . . 13 (𝑦 ∈ ( L ‘𝑎) → 𝑦 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎)))
12 simpr 484 . . . . . . . . . . . . 13 ((𝑎 No ∧ ∀𝑏 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))(𝑏 +s 0s ) = 𝑏) → ∀𝑏 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))(𝑏 +s 0s ) = 𝑏)
13 oveq1 7375 . . . . . . . . . . . . . . 15 (𝑏 = 𝑦 → (𝑏 +s 0s ) = (𝑦 +s 0s ))
14 id 22 . . . . . . . . . . . . . . 15 (𝑏 = 𝑦𝑏 = 𝑦)
1513, 14eqeq12d 2753 . . . . . . . . . . . . . 14 (𝑏 = 𝑦 → ((𝑏 +s 0s ) = 𝑏 ↔ (𝑦 +s 0s ) = 𝑦))
1615rspcva 3576 . . . . . . . . . . . . 13 ((𝑦 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎)) ∧ ∀𝑏 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))(𝑏 +s 0s ) = 𝑏) → (𝑦 +s 0s ) = 𝑦)
1711, 12, 16syl2anr 598 . . . . . . . . . . . 12 (((𝑎 No ∧ ∀𝑏 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))(𝑏 +s 0s ) = 𝑏) ∧ 𝑦 ∈ ( L ‘𝑎)) → (𝑦 +s 0s ) = 𝑦)
1817eqeq2d 2748 . . . . . . . . . . 11 (((𝑎 No ∧ ∀𝑏 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))(𝑏 +s 0s ) = 𝑏) ∧ 𝑦 ∈ ( L ‘𝑎)) → (𝑥 = (𝑦 +s 0s ) ↔ 𝑥 = 𝑦))
19 equcom 2020 . . . . . . . . . . 11 (𝑥 = 𝑦𝑦 = 𝑥)
2018, 19bitrdi 287 . . . . . . . . . 10 (((𝑎 No ∧ ∀𝑏 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))(𝑏 +s 0s ) = 𝑏) ∧ 𝑦 ∈ ( L ‘𝑎)) → (𝑥 = (𝑦 +s 0s ) ↔ 𝑦 = 𝑥))
2120rexbidva 3160 . . . . . . . . 9 ((𝑎 No ∧ ∀𝑏 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))(𝑏 +s 0s ) = 𝑏) → (∃𝑦 ∈ ( L ‘𝑎)𝑥 = (𝑦 +s 0s ) ↔ ∃𝑦 ∈ ( L ‘𝑎)𝑦 = 𝑥))
22 risset 3213 . . . . . . . . 9 (𝑥 ∈ ( L ‘𝑎) ↔ ∃𝑦 ∈ ( L ‘𝑎)𝑦 = 𝑥)
2321, 22bitr4di 289 . . . . . . . 8 ((𝑎 No ∧ ∀𝑏 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))(𝑏 +s 0s ) = 𝑏) → (∃𝑦 ∈ ( L ‘𝑎)𝑥 = (𝑦 +s 0s ) ↔ 𝑥 ∈ ( L ‘𝑎)))
2423eqabcdv 2871 . . . . . . 7 ((𝑎 No ∧ ∀𝑏 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))(𝑏 +s 0s ) = 𝑏) → {𝑥 ∣ ∃𝑦 ∈ ( L ‘𝑎)𝑥 = (𝑦 +s 0s )} = ( L ‘𝑎))
25 rex0 4314 . . . . . . . . . 10 ¬ ∃𝑦 ∈ ∅ 𝑧 = (𝑎 +s 𝑦)
26 left0s 27901 . . . . . . . . . . 11 ( L ‘ 0s ) = ∅
2726rexeqi 3297 . . . . . . . . . 10 (∃𝑦 ∈ ( L ‘ 0s )𝑧 = (𝑎 +s 𝑦) ↔ ∃𝑦 ∈ ∅ 𝑧 = (𝑎 +s 𝑦))
2825, 27mtbir 323 . . . . . . . . 9 ¬ ∃𝑦 ∈ ( L ‘ 0s )𝑧 = (𝑎 +s 𝑦)
2928abf 4360 . . . . . . . 8 {𝑧 ∣ ∃𝑦 ∈ ( L ‘ 0s )𝑧 = (𝑎 +s 𝑦)} = ∅
3029a1i 11 . . . . . . 7 ((𝑎 No ∧ ∀𝑏 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))(𝑏 +s 0s ) = 𝑏) → {𝑧 ∣ ∃𝑦 ∈ ( L ‘ 0s )𝑧 = (𝑎 +s 𝑦)} = ∅)
3124, 30uneq12d 4123 . . . . . 6 ((𝑎 No ∧ ∀𝑏 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))(𝑏 +s 0s ) = 𝑏) → ({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝑎)𝑥 = (𝑦 +s 0s )} ∪ {𝑧 ∣ ∃𝑦 ∈ ( L ‘ 0s )𝑧 = (𝑎 +s 𝑦)}) = (( L ‘𝑎) ∪ ∅))
32 un0 4348 . . . . . 6 (( L ‘𝑎) ∪ ∅) = ( L ‘𝑎)
3331, 32eqtrdi 2788 . . . . 5 ((𝑎 No ∧ ∀𝑏 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))(𝑏 +s 0s ) = 𝑏) → ({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝑎)𝑥 = (𝑦 +s 0s )} ∪ {𝑧 ∣ ∃𝑦 ∈ ( L ‘ 0s )𝑧 = (𝑎 +s 𝑦)}) = ( L ‘𝑎))
34 elun2 4137 . . . . . . . . . . . . 13 (𝑤 ∈ ( R ‘𝑎) → 𝑤 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎)))
35 oveq1 7375 . . . . . . . . . . . . . . 15 (𝑏 = 𝑤 → (𝑏 +s 0s ) = (𝑤 +s 0s ))
36 id 22 . . . . . . . . . . . . . . 15 (𝑏 = 𝑤𝑏 = 𝑤)
3735, 36eqeq12d 2753 . . . . . . . . . . . . . 14 (𝑏 = 𝑤 → ((𝑏 +s 0s ) = 𝑏 ↔ (𝑤 +s 0s ) = 𝑤))
3837rspcva 3576 . . . . . . . . . . . . 13 ((𝑤 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎)) ∧ ∀𝑏 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))(𝑏 +s 0s ) = 𝑏) → (𝑤 +s 0s ) = 𝑤)
3934, 12, 38syl2anr 598 . . . . . . . . . . . 12 (((𝑎 No ∧ ∀𝑏 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))(𝑏 +s 0s ) = 𝑏) ∧ 𝑤 ∈ ( R ‘𝑎)) → (𝑤 +s 0s ) = 𝑤)
4039eqeq2d 2748 . . . . . . . . . . 11 (((𝑎 No ∧ ∀𝑏 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))(𝑏 +s 0s ) = 𝑏) ∧ 𝑤 ∈ ( R ‘𝑎)) → (𝑥 = (𝑤 +s 0s ) ↔ 𝑥 = 𝑤))
41 equcom 2020 . . . . . . . . . . 11 (𝑥 = 𝑤𝑤 = 𝑥)
4240, 41bitrdi 287 . . . . . . . . . 10 (((𝑎 No ∧ ∀𝑏 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))(𝑏 +s 0s ) = 𝑏) ∧ 𝑤 ∈ ( R ‘𝑎)) → (𝑥 = (𝑤 +s 0s ) ↔ 𝑤 = 𝑥))
4342rexbidva 3160 . . . . . . . . 9 ((𝑎 No ∧ ∀𝑏 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))(𝑏 +s 0s ) = 𝑏) → (∃𝑤 ∈ ( R ‘𝑎)𝑥 = (𝑤 +s 0s ) ↔ ∃𝑤 ∈ ( R ‘𝑎)𝑤 = 𝑥))
44 risset 3213 . . . . . . . . 9 (𝑥 ∈ ( R ‘𝑎) ↔ ∃𝑤 ∈ ( R ‘𝑎)𝑤 = 𝑥)
4543, 44bitr4di 289 . . . . . . . 8 ((𝑎 No ∧ ∀𝑏 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))(𝑏 +s 0s ) = 𝑏) → (∃𝑤 ∈ ( R ‘𝑎)𝑥 = (𝑤 +s 0s ) ↔ 𝑥 ∈ ( R ‘𝑎)))
4645eqabcdv 2871 . . . . . . 7 ((𝑎 No ∧ ∀𝑏 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))(𝑏 +s 0s ) = 𝑏) → {𝑥 ∣ ∃𝑤 ∈ ( R ‘𝑎)𝑥 = (𝑤 +s 0s )} = ( R ‘𝑎))
47 rex0 4314 . . . . . . . . . 10 ¬ ∃𝑤 ∈ ∅ 𝑧 = (𝑎 +s 𝑤)
48 right0s 27902 . . . . . . . . . . 11 ( R ‘ 0s ) = ∅
4948rexeqi 3297 . . . . . . . . . 10 (∃𝑤 ∈ ( R ‘ 0s )𝑧 = (𝑎 +s 𝑤) ↔ ∃𝑤 ∈ ∅ 𝑧 = (𝑎 +s 𝑤))
5047, 49mtbir 323 . . . . . . . . 9 ¬ ∃𝑤 ∈ ( R ‘ 0s )𝑧 = (𝑎 +s 𝑤)
5150abf 4360 . . . . . . . 8 {𝑧 ∣ ∃𝑤 ∈ ( R ‘ 0s )𝑧 = (𝑎 +s 𝑤)} = ∅
5251a1i 11 . . . . . . 7 ((𝑎 No ∧ ∀𝑏 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))(𝑏 +s 0s ) = 𝑏) → {𝑧 ∣ ∃𝑤 ∈ ( R ‘ 0s )𝑧 = (𝑎 +s 𝑤)} = ∅)
5346, 52uneq12d 4123 . . . . . 6 ((𝑎 No ∧ ∀𝑏 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))(𝑏 +s 0s ) = 𝑏) → ({𝑥 ∣ ∃𝑤 ∈ ( R ‘𝑎)𝑥 = (𝑤 +s 0s )} ∪ {𝑧 ∣ ∃𝑤 ∈ ( R ‘ 0s )𝑧 = (𝑎 +s 𝑤)}) = (( R ‘𝑎) ∪ ∅))
54 un0 4348 . . . . . 6 (( R ‘𝑎) ∪ ∅) = ( R ‘𝑎)
5553, 54eqtrdi 2788 . . . . 5 ((𝑎 No ∧ ∀𝑏 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))(𝑏 +s 0s ) = 𝑏) → ({𝑥 ∣ ∃𝑤 ∈ ( R ‘𝑎)𝑥 = (𝑤 +s 0s )} ∪ {𝑧 ∣ ∃𝑤 ∈ ( R ‘ 0s )𝑧 = (𝑎 +s 𝑤)}) = ( R ‘𝑎))
5633, 55oveq12d 7386 . . . 4 ((𝑎 No ∧ ∀𝑏 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))(𝑏 +s 0s ) = 𝑏) → (({𝑥 ∣ ∃𝑦 ∈ ( L ‘𝑎)𝑥 = (𝑦 +s 0s )} ∪ {𝑧 ∣ ∃𝑦 ∈ ( L ‘ 0s )𝑧 = (𝑎 +s 𝑦)}) |s ({𝑥 ∣ ∃𝑤 ∈ ( R ‘𝑎)𝑥 = (𝑤 +s 0s )} ∪ {𝑧 ∣ ∃𝑤 ∈ ( R ‘ 0s )𝑧 = (𝑎 +s 𝑤)})) = (( L ‘𝑎) |s ( R ‘𝑎)))
57 lrcut 27912 . . . . 5 (𝑎 No → (( L ‘𝑎) |s ( R ‘𝑎)) = 𝑎)
5857adantr 480 . . . 4 ((𝑎 No ∧ ∀𝑏 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))(𝑏 +s 0s ) = 𝑏) → (( L ‘𝑎) |s ( R ‘𝑎)) = 𝑎)
5910, 56, 583eqtrd 2776 . . 3 ((𝑎 No ∧ ∀𝑏 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))(𝑏 +s 0s ) = 𝑏) → (𝑎 +s 0s ) = 𝑎)
6059ex 412 . 2 (𝑎 No → (∀𝑏 ∈ (( L ‘𝑎) ∪ ( R ‘𝑎))(𝑏 +s 0s ) = 𝑏 → (𝑎 +s 0s ) = 𝑎))
613, 6, 60noinds 27953 1 (𝐴 No → (𝐴 +s 0s ) = 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  {cab 2715  wral 3052  wrex 3062  cun 3901  c0 4287  cfv 6500  (class class class)co 7368   No csur 27619   |s ccuts 27767   0s c0s 27813   L cleft 27833   R cright 27834   +s cadds 27967
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-tp 4587  df-op 4589  df-uni 4866  df-int 4905  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-se 5586  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-riota 7325  df-ov 7371  df-oprab 7372  df-mpo 7373  df-1st 7943  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-1o 8407  df-2o 8408  df-no 27622  df-lts 27623  df-bday 27624  df-slts 27766  df-cuts 27768  df-0s 27815  df-made 27835  df-old 27836  df-left 27838  df-right 27839  df-norec2 27957  df-adds 27968
This theorem is referenced by:  addsridd  27973  addslid  27976  addsfo  27991  addsgt0d  28022  subsfo  28073  subsid1  28076  precsexlem11  28225  twocut  28431
  Copyright terms: Public domain W3C validator