| 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 27924 | . . 3 ⊢ (𝑋 ∈ No → ( bday ‘𝑋) = ∪ 𝑦 ∈ ( O ‘( bday ‘𝑋))suc ( bday ‘𝑦)) | |
| 2 | 1 | sseq1d 3954 | . 2 ⊢ (𝑋 ∈ No → (( bday ‘𝑋) ⊆ 𝑂 ↔ ∪ 𝑦 ∈ ( O ‘( bday ‘𝑋))suc ( bday ‘𝑦) ⊆ 𝑂)) |
| 3 | iunss 4988 | . . 3 ⊢ (∪ 𝑦 ∈ ( O ‘( bday ‘𝑋))suc ( bday ‘𝑦) ⊆ 𝑂 ↔ ∀𝑦 ∈ ( O ‘( bday ‘𝑋))suc ( bday ‘𝑦) ⊆ 𝑂) | |
| 4 | fvex 6848 | . . . . 5 ⊢ ( bday ‘𝑦) ∈ V | |
| 5 | ordelsuc 7765 | . . . . 5 ⊢ ((( bday ‘𝑦) ∈ V ∧ Ord 𝑂) → (( bday ‘𝑦) ∈ 𝑂 ↔ suc ( bday ‘𝑦) ⊆ 𝑂)) | |
| 6 | 4, 5 | mpan 691 | . . . 4 ⊢ (Ord 𝑂 → (( bday ‘𝑦) ∈ 𝑂 ↔ suc ( bday ‘𝑦) ⊆ 𝑂)) |
| 7 | 6 | ralbidv 3161 | . . 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 2114 ∀wral 3052 Vcvv 3430 ⊆ wss 3890 ∪ ciun 4934 Ord word 6317 suc csuc 6320 ‘cfv 6493 No csur 27620 bday cbday 27622 O cold 27832 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5213 ax-sep 5232 ax-nul 5242 ax-pow 5303 ax-pr 5371 ax-un 7683 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-tp 4573 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7318 df-ov 7364 df-oprab 7365 df-mpo 7366 df-2nd 7937 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-1o 8399 df-2o 8400 df-no 27623 df-lts 27624 df-bday 27625 df-slts 27767 df-cuts 27769 df-made 27836 df-old 27837 df-left 27839 df-right 27840 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |