Theorem made0 28231

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 6411	. . 3 ⊢ ∅ ∈ On
2		madeval2 28201	. . 3 ⊢ (∅ ∈ On → ( M ‘∅) = {𝑥 ∈ No ∣ ∃𝑙 ∈ 𝒫 ∪ ( M “ ∅)∃𝑟 ∈ 𝒫 ∪ ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥)})
3	1, 2	ax-mp 5	. 2 ⊢ ( M ‘∅) = {𝑥 ∈ No ∣ ∃𝑙 ∈ 𝒫 ∪ ( M “ ∅)∃𝑟 ∈ 𝒫 ∪ ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥)}
4		rabeqsn 4628	. . 3 ⊢ ({𝑥 ∈ No ∣ ∃𝑙 ∈ 𝒫 ∪ ( M “ ∅)∃𝑟 ∈ 𝒫 ∪ ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥)} = { 0s } ↔ ∀𝑥((𝑥 ∈ No ∧ ∃𝑙 ∈ 𝒫 ∪ ( M “ ∅)∃𝑟 ∈ 𝒫 ∪ ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥)) ↔ 𝑥 = 0s ))
5		0elpw 5317	. . . . . . . 8 ⊢ ∅ ∈ 𝒫 No
6		nulsgts 28144	. . . . . . . 8 ⊢ (∅ ∈ 𝒫 No → ∅ <<s ∅)
7	5, 6	ax-mp 5	. . . . . . 7 ⊢ ∅ <<s ∅
8		ima0 6071	. . . . . . . . . . . . 13 ⊢ ( M “ ∅) = ∅
9	8	unieqi 4879	. . . . . . . . . . . 12 ⊢ ∪ ( M “ ∅) = ∪ ∅
10		uni0 4896	. . . . . . . . . . . 12 ⊢ ∪ ∅ = ∅
11	9, 10	eqtri 2784	. . . . . . . . . . 11 ⊢ ∪ ( M “ ∅) = ∅
12	11	pweqi 4573	. . . . . . . . . 10 ⊢ 𝒫 ∪ ( M “ ∅) = 𝒫 ∅
13		pw0 4773	. . . . . . . . . 10 ⊢ 𝒫 ∅ = {∅}
14	12, 13	eqtri 2784	. . . . . . . . 9 ⊢ 𝒫 ∪ ( M “ ∅) = {∅}
15	14	rexeqi 3319	. . . . . . . 8 ⊢ (∃𝑙 ∈ 𝒫 ∪ ( M “ ∅)∃𝑟 ∈ 𝒫 ∪ ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ ∃𝑙 ∈ {∅}∃𝑟 ∈ 𝒫 ∪ ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥))
16	14	rexeqi 3319	. . . . . . . . 9 ⊢ (∃𝑟 ∈ 𝒫 ∪ ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ ∃𝑟 ∈ {∅} (𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥))
17	16	rexbii 3110	. . . . . . . 8 ⊢ (∃𝑙 ∈ {∅}∃𝑟 ∈ 𝒫 ∪ ( M “ ∅)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ ∃𝑙 ∈ {∅}∃𝑟 ∈ {∅} (𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥))
18		0ex 5261	. . . . . . . . . . 11 ⊢ ∅ ∈ V
19		breq2 5107	. . . . . . . . . . . 12 ⊢ (𝑟 = ∅ → (𝑙 <<s 𝑟 ↔ 𝑙 <<s ∅))
20		oveq2 7420	. . . . . . . . . . . . 13 ⊢ (𝑟 = ∅ → (𝑙 |s 𝑟) = (𝑙 |s ∅))
21	20	eqeq1d 2763	. . . . . . . . . . . 12 ⊢ (𝑟 = ∅ → ((𝑙 |s 𝑟) = 𝑥 ↔ (𝑙 |s ∅) = 𝑥))
22	19, 21	anbi12d 644	. . . . . . . . . . 11 ⊢ (𝑟 = ∅ → ((𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ (𝑙 <<s ∅ ∧ (𝑙 |s ∅) = 𝑥)))
23	18, 22	rexsn 4643	. . . . . . . . . 10 ⊢ (∃𝑟 ∈ {∅} (𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ (𝑙 <<s ∅ ∧ (𝑙 |s ∅) = 𝑥))
24	23	rexbii 3110	. . . . . . . . 9 ⊢ (∃𝑙 ∈ {∅}∃𝑟 ∈ {∅} (𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = 𝑥) ↔ ∃𝑙 ∈ {∅} (𝑙 <<s ∅ ∧ (𝑙 |s ∅) = 𝑥))
25		breq1 5106	. . . . . . . . . . 11 ⊢ (𝑙 = ∅ → (𝑙 <<s ∅ ↔ ∅ <<s ∅))
26		oveq1 7419	. . . . . . . . . . . 12 ⊢ (𝑙 = ∅ → (𝑙 |s ∅) = (∅ |s ∅))
27	26	eqeq1d 2763	. . . . . . . . . . 11 ⊢ (𝑙 = ∅ → ((𝑙 |s ∅) = 𝑥 ↔ (∅ |s ∅) = 𝑥))
28	25, 27	anbi12d 644	. . . . . . . . . 10 ⊢ (𝑙 = ∅ → ((𝑙 <<s ∅ ∧ (𝑙 |s ∅) = 𝑥) ↔ (∅ <<s ∅ ∧ (∅ |s ∅) = 𝑥)))
29	18, 28	rexsn 4643	. . . . . . . . 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 28175	. . . . . . 7 ⊢ 0s = (∅ |s ∅)
34	33	eqeq1i 2766	. . . . . 6 ⊢ ( 0s = 𝑥 ↔ (∅ |s ∅) = 𝑥)
35		eqcom 2768	. . . . . 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 28177	. . . . . 6 ⊢ 0s ∈ No
39		eleq1 2849	. . . . . 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 2784	1 ⊢ ( M ‘∅) = { 0s }

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∃wrex 3087  {crab 3413  ∅c0 4279  𝒫 cpw 4557  {csn 4584  ∪ cuni 4867   class class class wbr 5103   “ cima 5654  Oncon0 6355  ‘cfv 6531  (class class class)co 7412   No csur 27979   <<s cslts 28125   |s ccuts 28127   0_s c0s 28173   M cmade 28190

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6297  df-ord 6358  df-on 6359  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-2nd 7991  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-1o 8460  df-2o 8461  df-no 27982  df-lts 27983  df-bday 27984  df-slts 28126  df-cuts 28128  df-0s 28175  df-made 28195

This theorem is used by:  new0  28232  old1  28233