Theorem lrold 27905

Description: The union of the left and right options of a surreal make its old set. (Contributed by Scott Fenton, 9-Oct-2024.)

Assertion

Ref	Expression
lrold	⊢ (( L ‘𝐴) ∪ ( R ‘𝐴)) = ( O ‘( bday ‘𝐴))

Proof of Theorem lrold

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		leftval 27857	. . . . 5 ⊢ ( L ‘𝐴) = {𝑥 ∈ ( O ‘( bday ‘𝐴)) ∣ 𝑥 <s 𝐴}
2		rightval 27858	. . . . 5 ⊢ ( R ‘𝐴) = {𝑥 ∈ ( O ‘( bday ‘𝐴)) ∣ 𝐴 <s 𝑥}
3	1, 2	uneq12i 4120	. . . 4 ⊢ (( L ‘𝐴) ∪ ( R ‘𝐴)) = ({𝑥 ∈ ( O ‘( bday ‘𝐴)) ∣ 𝑥 <s 𝐴} ∪ {𝑥 ∈ ( O ‘( bday ‘𝐴)) ∣ 𝐴 <s 𝑥})
4		unrab 4269	. . . 4 ⊢ ({𝑥 ∈ ( O ‘( bday ‘𝐴)) ∣ 𝑥 <s 𝐴} ∪ {𝑥 ∈ ( O ‘( bday ‘𝐴)) ∣ 𝐴 <s 𝑥}) = {𝑥 ∈ ( O ‘( bday ‘𝐴)) ∣ (𝑥 <s 𝐴 ∨ 𝐴 <s 𝑥)}
5	3, 4	eqtri 2760	. . 3 ⊢ (( L ‘𝐴) ∪ ( R ‘𝐴)) = {𝑥 ∈ ( O ‘( bday ‘𝐴)) ∣ (𝑥 <s 𝐴 ∨ 𝐴 <s 𝑥)}
6		oldirr 27898	. . . . . . . 8 ⊢ ¬ 𝐴 ∈ ( O ‘( bday ‘𝐴))
7		eleq1 2825	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ ( O ‘( bday ‘𝐴)) ↔ 𝐴 ∈ ( O ‘( bday ‘𝐴))))
8	6, 7	mtbiri 327	. . . . . . 7 ⊢ (𝑥 = 𝐴 → ¬ 𝑥 ∈ ( O ‘( bday ‘𝐴)))
9	8	necon2ai 2962	. . . . . 6 ⊢ (𝑥 ∈ ( O ‘( bday ‘𝐴)) → 𝑥 ≠ 𝐴)
10	9	adantl 481	. . . . 5 ⊢ ((𝐴 ∈ No ∧ 𝑥 ∈ ( O ‘( bday ‘𝐴))) → 𝑥 ≠ 𝐴)
11		oldno 27852	. . . . . 6 ⊢ (𝑥 ∈ ( O ‘( bday ‘𝐴)) → 𝑥 ∈ No )
12		ltstrine 27731	. . . . . . 7 ⊢ ((𝑥 ∈ No ∧ 𝐴 ∈ No ) → (𝑥 ≠ 𝐴 ↔ (𝑥 <s 𝐴 ∨ 𝐴 <s 𝑥)))
13	12	ancoms 458	. . . . . 6 ⊢ ((𝐴 ∈ No ∧ 𝑥 ∈ No ) → (𝑥 ≠ 𝐴 ↔ (𝑥 <s 𝐴 ∨ 𝐴 <s 𝑥)))
14	11, 13	sylan2 594	. . . . 5 ⊢ ((𝐴 ∈ No ∧ 𝑥 ∈ ( O ‘( bday ‘𝐴))) → (𝑥 ≠ 𝐴 ↔ (𝑥 <s 𝐴 ∨ 𝐴 <s 𝑥)))
15	10, 14	mpbid 232	. . . 4 ⊢ ((𝐴 ∈ No ∧ 𝑥 ∈ ( O ‘( bday ‘𝐴))) → (𝑥 <s 𝐴 ∨ 𝐴 <s 𝑥))
16	15	rabeqcda 3412	. . 3 ⊢ (𝐴 ∈ No → {𝑥 ∈ ( O ‘( bday ‘𝐴)) ∣ (𝑥 <s 𝐴 ∨ 𝐴 <s 𝑥)} = ( O ‘( bday ‘𝐴)))
17	5, 16	eqtrid 2784	. 2 ⊢ (𝐴 ∈ No → (( L ‘𝐴) ∪ ( R ‘𝐴)) = ( O ‘( bday ‘𝐴)))
18		un0 4348	. . 3 ⊢ (∅ ∪ ∅) = ∅
19		leftf 27863	. . . . . . 7 ⊢ L : No ⟶𝒫 No
20	19	fdmi 6681	. . . . . 6 ⊢ dom L = No
21	20	eleq2i 2829	. . . . 5 ⊢ (𝐴 ∈ dom L ↔ 𝐴 ∈ No )
22		ndmfv 6874	. . . . 5 ⊢ (¬ 𝐴 ∈ dom L → ( L ‘𝐴) = ∅)
23	21, 22	sylnbir 331	. . . 4 ⊢ (¬ 𝐴 ∈ No → ( L ‘𝐴) = ∅)
24		rightf 27864	. . . . . . 7 ⊢ R : No ⟶𝒫 No
25	24	fdmi 6681	. . . . . 6 ⊢ dom R = No
26	25	eleq2i 2829	. . . . 5 ⊢ (𝐴 ∈ dom R ↔ 𝐴 ∈ No )
27		ndmfv 6874	. . . . 5 ⊢ (¬ 𝐴 ∈ dom R → ( R ‘𝐴) = ∅)
28	26, 27	sylnbir 331	. . . 4 ⊢ (¬ 𝐴 ∈ No → ( R ‘𝐴) = ∅)
29	23, 28	uneq12d 4123	. . 3 ⊢ (¬ 𝐴 ∈ No → (( L ‘𝐴) ∪ ( R ‘𝐴)) = (∅ ∪ ∅))
30		bdaydm 27758	. . . . . . 7 ⊢ dom bday = No
31	30	eleq2i 2829	. . . . . 6 ⊢ (𝐴 ∈ dom bday ↔ 𝐴 ∈ No )
32		ndmfv 6874	. . . . . 6 ⊢ (¬ 𝐴 ∈ dom bday → ( bday ‘𝐴) = ∅)
33	31, 32	sylnbir 331	. . . . 5 ⊢ (¬ 𝐴 ∈ No → ( bday ‘𝐴) = ∅)
34	33	fveq2d 6846	. . . 4 ⊢ (¬ 𝐴 ∈ No → ( O ‘( bday ‘𝐴)) = ( O ‘∅))
35		old0 27847	. . . 4 ⊢ ( O ‘∅) = ∅
36	34, 35	eqtrdi 2788	. . 3 ⊢ (¬ 𝐴 ∈ No → ( O ‘( bday ‘𝐴)) = ∅)
37	18, 29, 36	3eqtr4a 2798	. 2 ⊢ (¬ 𝐴 ∈ No → (( L ‘𝐴) ∪ ( R ‘𝐴)) = ( O ‘( bday ‘𝐴)))
38	17, 37	pm2.61i 182	1 ⊢ (( L ‘𝐴) ∪ ( R ‘𝐴)) = ( O ‘( bday ‘𝐴))

Syntax hints:  ¬ wn 3   ↔ wb 206   ∧ wa 395   ∨ wo 848   = wceq 1542   ∈ wcel 2114   ≠ wne 2933  {crab 3401   ∪ cun 3901  ∅c0 4287  𝒫 cpw 4556   class class class wbr 5100  dom cdm 5632  ‘cfv 6500   No csur 27619   <s clts 27620   bday cbday 27621   O cold 27831   L cleft 27833   R cright 27834

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-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-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-made 27835  df-old 27836  df-left 27838  df-right 27839

This theorem is referenced by:  lruneq  27915  bdayiun  27923  lrrecval2  27948  addbdaylem  28025  negbdaylem  28064  onleft  28268  ltonold  28269  oncutlt  28272