Theorem made0 28093

Description: The only surreal made on day ∅ is 0_s. (Contributed by Scott Fenton, 7-Aug-2024.)

Assertion

Ref	Expression
made0	⊢ ( M ‘∅) = { 0s }

Proof of Theorem made0

Dummy variables 𝑥 𝑙 𝑟 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		0elon 6423	. . 3 ⊢ ∅ ∈ On
2		madeval2 28063	. . 3 ⊢ (∅ ∈ On → ( M ‘∅) = {𝑥 ∈ No ∣ ∃𝑙 ∈ 𝒫 ∪ ( M “ ∅)∃𝑟 ∈ 𝒫 ∪ ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥)})
3	1, 2	ax-mp 5	. 2 ⊢ ( M ‘∅) = {𝑥 ∈ No ∣ ∃𝑙 ∈ 𝒫 ∪ ( M “ ∅)∃𝑟 ∈ 𝒫 ∪ ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥)}
4		rabeqsn 4638	. . 3 ⊢ ({𝑥 ∈ No ∣ ∃𝑙 ∈ 𝒫 ∪ ( M “ ∅)∃𝑟 ∈ 𝒫 ∪ ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥)} = { 0s } ↔ ∀𝑥((𝑥 ∈ No ∧ ∃𝑙 ∈ 𝒫 ∪ ( M “ ∅)∃𝑟 ∈ 𝒫 ∪ ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥)) ↔ 𝑥 = 0s ))
5		0elpw 5331	. . . . . . . 8 ⊢ ∅ ∈ 𝒫 No
6		nulsgts 28006	. . . . . . . 8 ⊢ (∅ ∈ 𝒫 No → ∅ <<s ∅)
7	5, 6	ax-mp 5	. . . . . . 7 ⊢ ∅ <<s ∅
8		ima0 6084	. . . . . . . . . . . . 13 ⊢ ( M “ ∅) = ∅
9	8	unieqi 4889	. . . . . . . . . . . 12 ⊢ ∪ ( M “ ∅) = ∪ ∅
10		uni0 4906	. . . . . . . . . . . 12 ⊢ ∪ ∅ = ∅
11	9, 10	eqtri 2789	. . . . . . . . . . 11 ⊢ ∪ ( M “ ∅) = ∅
12	11	pweqi 4583	. . . . . . . . . 10 ⊢ 𝒫 ∪ ( M “ ∅) = 𝒫 ∅
13		pw0 4783	. . . . . . . . . 10 ⊢ 𝒫 ∅ = {∅}
14	12, 13	eqtri 2789	. . . . . . . . 9 ⊢ 𝒫 ∪ ( M “ ∅) = {∅}
15	14	rexeqi 3325	. . . . . . . 8 ⊢ (∃𝑙 ∈ 𝒫 ∪ ( M “ ∅)∃𝑟 ∈ 𝒫 ∪ ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ ∃𝑙 ∈ {∅}∃𝑟 ∈ 𝒫 ∪ ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥))
16	14	rexeqi 3325	. . . . . . . . 9 ⊢ (∃𝑟 ∈ 𝒫 ∪ ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ ∃𝑟 ∈ {∅} (𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥))
17	16	rexbii 3115	. . . . . . . 8 ⊢ (∃𝑙 ∈ {∅}∃𝑟 ∈ 𝒫 ∪ ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ ∃𝑙 ∈ {∅}∃𝑟 ∈ {∅} (𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥))
18		0ex 5275	. . . . . . . . . . 11 ⊢ ∅ ∈ V
19		breq2 5118	. . . . . . . . . . . 12 ⊢ (𝑟 = ∅ → (𝑙 <<s 𝑟 ↔ 𝑙 <<s ∅))
20		oveq2 7431	. . . . . . . . . . . . 13 ⊢ (𝑟 = ∅ → (𝑙 |s 𝑟) = (𝑙 |s ∅))
21	20	eqeq1d 2768	. . . . . . . . . . . 12 ⊢ (𝑟 = ∅ → ((𝑙 |s 𝑟) = 𝑥 ↔ (𝑙 |s ∅) = 𝑥))
22	19, 21	anbi12d 644	. . . . . . . . . . 11 ⊢ (𝑟 = ∅ → ((𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ (𝑙 <<s ∅ ∧ (𝑙 |s ∅) = 𝑥)))
23	18, 22	rexsn 4653	. . . . . . . . . 10 ⊢ (∃𝑟 ∈ {∅} (𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ (𝑙 <<s ∅ ∧ (𝑙 |s ∅) = 𝑥))
24	23	rexbii 3115	. . . . . . . . 9 ⊢ (∃𝑙 ∈ {∅}∃𝑟 ∈ {∅} (𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ ∃𝑙 ∈ {∅} (𝑙 <<s ∅ ∧ (𝑙 |s ∅) = 𝑥))
25		breq1 5117	. . . . . . . . . . 11 ⊢ (𝑙 = ∅ → (𝑙 <<s ∅ ↔ ∅ <<s ∅))
26		oveq1 7430	. . . . . . . . . . . 12 ⊢ (𝑙 = ∅ → (𝑙 |s ∅) = (∅ |s ∅))
27	26	eqeq1d 2768	. . . . . . . . . . 11 ⊢ (𝑙 = ∅ → ((𝑙 |s ∅) = 𝑥 ↔ (∅ |s ∅) = 𝑥))
28	25, 27	anbi12d 644	. . . . . . . . . 10 ⊢ (𝑙 = ∅ → ((𝑙 <<s ∅ ∧ (𝑙 |s ∅) = 𝑥) ↔ (∅ <<s ∅ ∧ (∅ |s ∅) = 𝑥)))
29	18, 28	rexsn 4653	. . . . . . . . 9 ⊢ (∃𝑙 ∈ {∅} (𝑙 <<s ∅ ∧ (𝑙 |s ∅) = 𝑥) ↔ (∅ <<s ∅ ∧ (∅ |s ∅) = 𝑥))
30	24, 29	bitri 278	. . . . . . . 8 ⊢ (∃𝑙 ∈ {∅}∃𝑟 ∈ {∅} (𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ (∅ <<s ∅ ∧ (∅ |s ∅) = 𝑥))
31	15, 17, 30	3bitri 300	. . . . . . 7 ⊢ (∃𝑙 ∈ 𝒫 ∪ ( M “ ∅)∃𝑟 ∈ 𝒫 ∪ ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ (∅ <<s ∅ ∧ (∅ |s ∅) = 𝑥))
32	7, 31	mpbiran 722	. . . . . 6 ⊢ (∃𝑙 ∈ 𝒫 ∪ ( M “ ∅)∃𝑟 ∈ 𝒫 ∪ ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ (∅ |s ∅) = 𝑥)
33		df-0s 28037	. . . . . . 7 ⊢ 0s = (∅ |s ∅)
34	33	eqeq1i 2771	. . . . . 6 ⊢ ( 0s = 𝑥 ↔ (∅ |s ∅) = 𝑥)
35		eqcom 2773	. . . . . 6 ⊢ ( 0s = 𝑥 ↔ 𝑥 = 0s )
36	32, 34, 35	3bitr2i 302	. . . . 5 ⊢ (∃𝑙 ∈ 𝒫 ∪ ( M “ ∅)∃𝑟 ∈ 𝒫 ∪ ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ 𝑥 = 0s )
37	36	anbi2i 635	. . . 4 ⊢ ((𝑥 ∈ No ∧ ∃𝑙 ∈ 𝒫 ∪ ( M “ ∅)∃𝑟 ∈ 𝒫 ∪ ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥)) ↔ (𝑥 ∈ No ∧ 𝑥 = 0s ))
38		0no 28039	. . . . . 6 ⊢ 0s ∈ No
39		eleq1 2854	. . . . . 6 ⊢ (𝑥 = 0s → (𝑥 ∈ No ↔ 0s ∈ No ))
40	38, 39	mpbiri 261	. . . . 5 ⊢ (𝑥 = 0s → 𝑥 ∈ No )
41	40	pm4.71ri 570	. . . 4 ⊢ (𝑥 = 0s ↔ (𝑥 ∈ No ∧ 𝑥 = 0s ))
42	37, 41	bitr4i 281	. . 3 ⊢ ((𝑥 ∈ No ∧ ∃𝑙 ∈ 𝒫 ∪ ( M “ ∅)∃𝑟 ∈ 𝒫 ∪ ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥)) ↔ 𝑥 = 0s )
43	4, 42	mpgbir 1832	. 2 ⊢ {𝑥 ∈ No ∣ ∃𝑙 ∈ 𝒫 ∪ ( M “ ∅)∃𝑟 ∈ 𝒫 ∪ ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥)} = { 0s }
44	3, 43	eqtri 2789	1 ⊢ ( M ‘∅) = { 0s }

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2146  ∃wrex 3092  {crab 3419  ∅c0 4289  𝒫 cpw 4567  {csn 4594  ∪ cuni 4877   class class class wbr 5114   “ cima 5669  Oncon0 6367  ‘cfv 6543  (class class class)co 7423   No csur 27841   <<s cslts 27987   |s ccuts 27989   0_s c0s 28035   M cmade 28052

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745

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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rmo 3372  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3928  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-tp 4599  df-op 4601  df-uni 4878  df-int 4918  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-tr 5224  df-id 5561  df-eprel 5566  df-po 5574  df-so 5575  df-fr 5619  df-we 5621  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-pred 6309  df-ord 6370  df-on 6371  df-suc 6373  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7380  df-ov 7426  df-oprab 7427  df-mpo 7428  df-2nd 7996  df-frecs 8287  df-wrecs 8318  df-recs 8367  df-1o 8462  df-2o 8463  df-no 27844  df-lts 27845  df-bday 27846  df-slts 27988  df-cuts 27990  df-0s 28037  df-made 28057

This theorem is used by:  new0  28094  old1  28095