| 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 28108 | . . 3 ⊢ (𝑋 ∈ No → ( bday ‘𝑋) = ∪ 𝑦 ∈ ( O ‘( bday ‘𝑋))suc ( bday ‘𝑦)) | |
| 2 | 1 | sseq1d 3968 | . 2 ⊢ (𝑋 ∈ No → (( bday ‘𝑋) ⊆ 𝑂 ↔ ∪ 𝑦 ∈ ( O ‘( bday ‘𝑋))suc ( bday ‘𝑦) ⊆ 𝑂)) |
| 3 | iunss 5009 | . . 3 ⊢ (∪ 𝑦 ∈ ( O ‘( bday ‘𝑋))suc ( bday ‘𝑦) ⊆ 𝑂 ↔ ∀𝑦 ∈ ( O ‘( bday ‘𝑋))suc ( bday ‘𝑦) ⊆ 𝑂) | |
| 4 | fvex 6894 | . . . . 5 ⊢ ( bday ‘𝑦) ∈ V | |
| 5 | ordelsuc 7812 | . . . . 5 ⊢ ((( bday ‘𝑦) ∈ V ∧ Ord 𝑂) → (( bday ‘𝑦) ∈ 𝑂 ↔ suc ( bday ‘𝑦) ⊆ 𝑂)) | |
| 6 | 4, 5 | mpan 702 | . . . 4 ⊢ (Ord 𝑂 → (( bday ‘𝑦) ∈ 𝑂 ↔ suc ( bday ‘𝑦) ⊆ 𝑂)) |
| 7 | 6 | ralbidv 3188 | . . 3 ⊢ (Ord 𝑂 → (∀𝑦 ∈ ( O ‘( bday ‘𝑋))( bday ‘𝑦) ∈ 𝑂 ↔ ∀𝑦 ∈ ( O ‘( bday ‘𝑋))suc ( bday ‘𝑦) ⊆ 𝑂)) |
| 8 | 3, 7 | bitr4id 293 | . 2 ⊢ (Ord 𝑂 → (∪ 𝑦 ∈ ( O ‘( bday ‘𝑋))suc ( bday ‘𝑦) ⊆ 𝑂 ↔ ∀𝑦 ∈ ( O ‘( bday ‘𝑋))( bday ‘𝑦) ∈ 𝑂)) |
| 9 | 2, 8 | sylan9bb 518 | 1 ⊢ ((𝑋 ∈ No ∧ Ord 𝑂) → (( bday ‘𝑋) ⊆ 𝑂 ↔ ∀𝑦 ∈ ( O ‘( bday ‘𝑋))( bday ‘𝑦) ∈ 𝑂)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∈ wcel 2143 ∀wral 3079 Vcvv 3455 ⊆ wss 3905 ∪ ciun 4956 Ord word 6359 suc csuc 6362 ‘cfv 6536 No csur 27804 bday cbday 27806 O cold 28016 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-tp 4594 df-op 4596 df-uni 4873 df-int 4913 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-1o 8449 df-2o 8450 df-no 27807 df-lts 27808 df-bday 27809 df-slts 27951 df-cuts 27953 df-made 28020 df-old 28021 df-left 28023 df-right 28024 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |