| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nobdaymin | Structured version Visualization version GIF version | ||
| Description: Any non-empty class of surreals has a birthday-minimal element. (Contributed by Scott Fenton, 11-Dec-2025.) |
| Ref | Expression |
|---|---|
| nobdaymin | ⊢ ((𝐴 ⊆ No ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 ( bday ‘𝑥) = ∩ ( bday “ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | imassrn 6197 | . . . 4 ⊢ ( bday “ 𝐴) ⊆ ran bday | |
| 2 | bdayrn 28137 | . . . 4 ⊢ ran bday = On | |
| 3 | 1, 2 | sseqtri 3979 | . . 3 ⊢ ( bday “ 𝐴) ⊆ On |
| 4 | n0 4300 | . . . . 5 ⊢ (𝐴 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴) | |
| 5 | bdaydm 28135 | . . . . . . . . 9 ⊢ dom bday = No | |
| 6 | 5 | sseq2i 3960 | . . . . . . . 8 ⊢ (𝐴 ⊆ dom bday ↔ 𝐴 ⊆ No ) |
| 7 | bdayfun 28133 | . . . . . . . . 9 ⊢ Fun bday | |
| 8 | funfvima2 7237 | . . . . . . . . 9 ⊢ ((Fun bday ∧ 𝐴 ⊆ dom bday ) → (𝑥 ∈ 𝐴 → ( bday ‘𝑥) ∈ ( bday “ 𝐴))) | |
| 9 | 7, 8 | mpan 703 | . . . . . . . 8 ⊢ (𝐴 ⊆ dom bday → (𝑥 ∈ 𝐴 → ( bday ‘𝑥) ∈ ( bday “ 𝐴))) |
| 10 | 6, 9 | sylbir 238 | . . . . . . 7 ⊢ (𝐴 ⊆ No → (𝑥 ∈ 𝐴 → ( bday ‘𝑥) ∈ ( bday “ 𝐴))) |
| 11 | ne0i 4287 | . . . . . . 7 ⊢ (( bday ‘𝑥) ∈ ( bday “ 𝐴) → ( bday “ 𝐴) ≠ ∅) | |
| 12 | 10, 11 | syl6 36 | . . . . . 6 ⊢ (𝐴 ⊆ No → (𝑥 ∈ 𝐴 → ( bday “ 𝐴) ≠ ∅)) |
| 13 | 12 | exlimdv 1966 | . . . . 5 ⊢ (𝐴 ⊆ No → (∃𝑥 𝑥 ∈ 𝐴 → ( bday “ 𝐴) ≠ ∅)) |
| 14 | 4, 13 | biimtrid 245 | . . . 4 ⊢ (𝐴 ⊆ No → (𝐴 ≠ ∅ → ( bday “ 𝐴) ≠ ∅)) |
| 15 | 14 | imp 412 | . . 3 ⊢ ((𝐴 ⊆ No ∧ 𝐴 ≠ ∅) → ( bday “ 𝐴) ≠ ∅) |
| 16 | onint 7804 | . . 3 ⊢ ((( bday “ 𝐴) ⊆ On ∧ ( bday “ 𝐴) ≠ ∅) → ∩ ( bday “ 𝐴) ∈ ( bday “ 𝐴)) | |
| 17 | 3, 15, 16 | sylancr 599 | . 2 ⊢ ((𝐴 ⊆ No ∧ 𝐴 ≠ ∅) → ∩ ( bday “ 𝐴) ∈ ( bday “ 𝐴)) |
| 18 | bdayfn 28134 | . . . 4 ⊢ bday Fn No | |
| 19 | fvelimab 6957 | . . . 4 ⊢ (( bday Fn No ∧ 𝐴 ⊆ No ) → (∩ ( bday “ 𝐴) ∈ ( bday “ 𝐴) ↔ ∃𝑥 ∈ 𝐴 ( bday ‘𝑥) = ∩ ( bday “ 𝐴))) | |
| 20 | 18, 19 | mpan 703 | . . 3 ⊢ (𝐴 ⊆ No → (∩ ( bday “ 𝐴) ∈ ( bday “ 𝐴) ↔ ∃𝑥 ∈ 𝐴 ( bday ‘𝑥) = ∩ ( bday “ 𝐴))) |
| 21 | 20 | adantr 486 | . 2 ⊢ ((𝐴 ⊆ No ∧ 𝐴 ≠ ∅) → (∩ ( bday “ 𝐴) ∈ ( bday “ 𝐴) ↔ ∃𝑥 ∈ 𝐴 ( bday ‘𝑥) = ∩ ( bday “ 𝐴))) |
| 22 | 17, 21 | mpbid 235 | 1 ⊢ ((𝐴 ⊆ No ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐴 ( bday ‘𝑥) = ∩ ( bday “ 𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∃wex 1812 ∈ wcel 2145 ≠ wne 2956 ∃wrex 3087 ⊆ wss 3899 ∅c0 4279 ∩ cint 4907 dom cdm 5651 ran crn 5652 “ cima 5654 Oncon0 6362 Fun wfun 6532 Fn wfn 6533 ‘cfv 6538 No csur 27997 bday cbday 27999 |
| 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-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751 |
| 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-rab 3414 df-v 3453 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-op 4591 df-uni 4868 df-int 4908 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-ord 6365 df-on 6366 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-fo 6544 df-fv 6546 df-1o 8476 df-no 28000 df-bday 28002 |
| This theorem is used by: nocvxmin 28141 |
| Copyright terms: Public domain | W3C validator |