| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > bdayle | Structured version Visualization version GIF version | ||
| Description: A condition for bounding a birthday above. (Contributed by Scott Fenton, 22-Nov-2025.) |
| Ref | Expression |
|---|---|
| bdayle | ⊢ ((𝑋 ∈ No ∧ Ord 𝑂) → (( bday ‘𝑋) ⊆ 𝑂 ↔ ∀𝑦 ∈ ( O ‘( bday ‘𝑋))( bday ‘𝑦) ∈ 𝑂)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bdayiun 27887 | . . 3 ⊢ (𝑋 ∈ No → ( bday ‘𝑋) = ∪ 𝑦 ∈ ( O ‘( bday ‘𝑋))suc ( bday ‘𝑦)) | |
| 2 | 1 | sseq1d 3963 | . 2 ⊢ (𝑋 ∈ No → (( bday ‘𝑋) ⊆ 𝑂 ↔ ∪ 𝑦 ∈ ( O ‘( bday ‘𝑋))suc ( bday ‘𝑦) ⊆ 𝑂)) |
| 3 | iunss 4998 | . . 3 ⊢ (∪ 𝑦 ∈ ( O ‘( bday ‘𝑋))suc ( bday ‘𝑦) ⊆ 𝑂 ↔ ∀𝑦 ∈ ( O ‘( bday ‘𝑋))suc ( bday ‘𝑦) ⊆ 𝑂) | |
| 4 | fvex 6845 | . . . . 5 ⊢ ( bday ‘𝑦) ∈ V | |
| 5 | ordelsuc 7760 | . . . . 5 ⊢ ((( bday ‘𝑦) ∈ V ∧ Ord 𝑂) → (( bday ‘𝑦) ∈ 𝑂 ↔ suc ( bday ‘𝑦) ⊆ 𝑂)) | |
| 6 | 4, 5 | mpan 690 | . . . 4 ⊢ (Ord 𝑂 → (( bday ‘𝑦) ∈ 𝑂 ↔ suc ( bday ‘𝑦) ⊆ 𝑂)) |
| 7 | 6 | ralbidv 3157 | . . 3 ⊢ (Ord 𝑂 → (∀𝑦 ∈ ( O ‘( bday ‘𝑋))( bday ‘𝑦) ∈ 𝑂 ↔ ∀𝑦 ∈ ( O ‘( bday ‘𝑋))suc ( bday ‘𝑦) ⊆ 𝑂)) |
| 8 | 3, 7 | bitr4id 290 | . 2 ⊢ (Ord 𝑂 → (∪ 𝑦 ∈ ( O ‘( bday ‘𝑋))suc ( bday ‘𝑦) ⊆ 𝑂 ↔ ∀𝑦 ∈ ( O ‘( bday ‘𝑋))( bday ‘𝑦) ∈ 𝑂)) |
| 9 | 2, 8 | sylan9bb 509 | 1 ⊢ ((𝑋 ∈ No ∧ Ord 𝑂) → (( bday ‘𝑋) ⊆ 𝑂 ↔ ∀𝑦 ∈ ( O ‘( bday ‘𝑋))( bday ‘𝑦) ∈ 𝑂)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∈ wcel 2113 ∀wral 3049 Vcvv 3438 ⊆ wss 3899 ∪ ciun 4944 Ord word 6314 suc csuc 6317 ‘cfv 6490 No csur 27605 bday cbday 27607 O cold 27811 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-rep 5222 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-ral 3050 df-rex 3059 df-rmo 3348 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-tp 4583 df-op 4585 df-uni 4862 df-int 4901 df-iun 4946 df-br 5097 df-opab 5159 df-mpt 5178 df-tr 5204 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-1o 8395 df-2o 8396 df-no 27608 df-slt 27609 df-bday 27610 df-sslt 27748 df-scut 27750 df-made 27815 df-old 27816 df-left 27818 df-right 27819 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |