| 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 28144 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝑋 ∈ No ) → (𝑋 ∈ ( M ‘𝐴) ↔ ( bday ‘𝑋) ⊆ 𝐴)) | |
| 2 | oldbday 28145 | . . . 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 28079 | . . . . . 6 ⊢ ( N ‘𝐴) = (( M ‘𝐴) ∖ ( O ‘𝐴)) | |
| 6 | 5 | a1i 11 | . . . . 5 ⊢ (𝐴 ∈ On → ( N ‘𝐴) = (( M ‘𝐴) ∖ ( O ‘𝐴))) |
| 7 | 6 | eleq2d 2851 | . . . 4 ⊢ (𝐴 ∈ On → (𝑋 ∈ ( N ‘𝐴) ↔ 𝑋 ∈ (( M ‘𝐴) ∖ ( O ‘𝐴)))) |
| 8 | eldif 3916 | . . . 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 27996 | . . . . 5 ⊢ ( bday ‘𝑋) ∈ On | |
| 12 | 11 | onordi 6478 | . . . 4 ⊢ Ord ( bday ‘𝑋) |
| 13 | eloni 6374 | . . . 4 ⊢ (𝐴 ∈ On → Ord 𝐴) | |
| 14 | ordtri4 6402 | . . . 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 2146 ∖ cdif 3903 ⊆ wss 3906 Ord word 6363 Oncon0 6364 ‘cfv 6540 No csur 27855 bday cbday 27857 M cmade 28066 O cold 28067 N cnew 28068 |
| 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 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-tp 4596 df-op 4598 df-uni 4875 df-int 4915 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-2nd 7993 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-1o 8459 df-2o 8460 df-no 27858 df-lts 27859 df-bday 27860 df-slts 28002 df-cuts 28004 df-made 28071 df-old 28072 df-new 28073 df-left 28074 df-right 28075 |
| This theorem is used by: newbdayim 28147 ltonold 28505 |
| Copyright terms: Public domain | W3C validator |