| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > newbday | Structured version Visualization version GIF version | ||
| Description: A surreal is an element of a new set iff its birthday is equal to that ordinal. Remark in [Conway] p. 29. (Contributed by Scott Fenton, 19-Aug-2024.) |
| Ref | Expression |
|---|---|
| newbday | ⊢ ((𝐴 ∈ On ∧ 𝑋 ∈ No ) → (𝑋 ∈ ( N ‘𝐴) ↔ ( bday ‘𝑋) = 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | madebday 28166 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝑋 ∈ No ) → (𝑋 ∈ ( M ‘𝐴) ↔ ( bday ‘𝑋) ⊆ 𝐴)) | |
| 2 | oldbday 28167 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝑋 ∈ No ) → (𝑋 ∈ ( O ‘𝐴) ↔ ( bday ‘𝑋) ∈ 𝐴)) | |
| 3 | 2 | notbid 321 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝑋 ∈ No ) → (¬ 𝑋 ∈ ( O ‘𝐴) ↔ ¬ ( bday ‘𝑋) ∈ 𝐴)) |
| 4 | 1, 3 | anbi12d 644 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝑋 ∈ No ) → ((𝑋 ∈ ( M ‘𝐴) ∧ ¬ 𝑋 ∈ ( O ‘𝐴)) ↔ (( bday ‘𝑋) ⊆ 𝐴 ∧ ¬ ( bday ‘𝑋) ∈ 𝐴))) |
| 5 | newval 28101 | . . . . . 6 ⊢ ( N ‘𝐴) = (( M ‘𝐴) ∖ ( O ‘𝐴)) | |
| 6 | 5 | a1i 11 | . . . . 5 ⊢ (𝐴 ∈ On → ( N ‘𝐴) = (( M ‘𝐴) ∖ ( O ‘𝐴))) |
| 7 | 6 | eleq2d 2846 | . . . 4 ⊢ (𝐴 ∈ On → (𝑋 ∈ ( N ‘𝐴) ↔ 𝑋 ∈ (( M ‘𝐴) ∖ ( O ‘𝐴)))) |
| 8 | eldif 3909 | . . . 4 ⊢ (𝑋 ∈ (( M ‘𝐴) ∖ ( O ‘𝐴)) ↔ (𝑋 ∈ ( M ‘𝐴) ∧ ¬ 𝑋 ∈ ( O ‘𝐴))) | |
| 9 | 7, 8 | bitrdi 290 | . . 3 ⊢ (𝐴 ∈ On → (𝑋 ∈ ( N ‘𝐴) ↔ (𝑋 ∈ ( M ‘𝐴) ∧ ¬ 𝑋 ∈ ( O ‘𝐴)))) |
| 10 | 9 | adantr 486 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝑋 ∈ No ) → (𝑋 ∈ ( N ‘𝐴) ↔ (𝑋 ∈ ( M ‘𝐴) ∧ ¬ 𝑋 ∈ ( O ‘𝐴)))) |
| 11 | bdayon 28018 | . . . . 5 ⊢ ( bday ‘𝑋) ∈ On | |
| 12 | 11 | onordi 6471 | . . . 4 ⊢ Ord ( bday ‘𝑋) |
| 13 | eloni 6367 | . . . 4 ⊢ (𝐴 ∈ On → Ord 𝐴) | |
| 14 | ordtri4 6395 | . . . 4 ⊢ ((Ord ( bday ‘𝑋) ∧ Ord 𝐴) → (( bday ‘𝑋) = 𝐴 ↔ (( bday ‘𝑋) ⊆ 𝐴 ∧ ¬ ( bday ‘𝑋) ∈ 𝐴))) | |
| 15 | 12, 13, 14 | sylancr 599 | . . 3 ⊢ (𝐴 ∈ On → (( bday ‘𝑋) = 𝐴 ↔ (( bday ‘𝑋) ⊆ 𝐴 ∧ ¬ ( bday ‘𝑋) ∈ 𝐴))) |
| 16 | 15 | adantr 486 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝑋 ∈ No ) → (( bday ‘𝑋) = 𝐴 ↔ (( bday ‘𝑋) ⊆ 𝐴 ∧ ¬ ( bday ‘𝑋) ∈ 𝐴))) |
| 17 | 4, 10, 16 | 3bitr4d 314 | 1 ⊢ ((𝐴 ∈ On ∧ 𝑋 ∈ No ) → (𝑋 ∈ ( N ‘𝐴) ↔ ( bday ‘𝑋) = 𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∖ cdif 3896 ⊆ wss 3899 Ord word 6356 Oncon0 6357 ‘cfv 6533 No csur 27877 bday cbday 27879 M cmade 28088 O cold 28089 N cnew 28090 |
| 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 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 |
| 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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 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 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-2nd 7988 df-frecs 8281 df-wrecs 8312 df-recs 8361 df-1o 8456 df-2o 8457 df-no 27880 df-lts 27881 df-bday 27882 df-slts 28024 df-cuts 28026 df-made 28093 df-old 28094 df-new 28095 df-left 28096 df-right 28097 |
| This theorem is used by: newbdayim 28169 ltonold 28527 |
| Copyright terms: Public domain | W3C validator |