| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > z12bday | Structured version Visualization version GIF version | ||
| Description: A dyadic fraction has a finite birthday. (Contributed by Scott Fenton, 20-Aug-2025.) (Proof shortened by Scott Fenton, 22-Feb-2026.) |
| Ref | Expression |
|---|---|
| z12bday | ⊢ (𝐴 ∈ ℤs[1/2] → ( bday ‘𝐴) ∈ ω) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | z12bdaylem 28852 | . 2 ⊢ ((𝐴 ∈ ℤs[1/2] ∧ 0s ≤s 𝐴) → ( bday ‘𝐴) ∈ ω) | |
| 2 | 0no 28177 | . . . . . 6 ⊢ 0s ∈ No | |
| 3 | z12no 28844 | . . . . . 6 ⊢ (𝐴 ∈ ℤs[1/2] → 𝐴 ∈ No ) | |
| 4 | lestric 28107 | . . . . . 6 ⊢ (( 0s ∈ No ∧ 𝐴 ∈ No ) → ( 0s ≤s 𝐴 ∨ 𝐴 ≤s 0s )) | |
| 5 | 2, 3, 4 | sylancr 599 | . . . . 5 ⊢ (𝐴 ∈ ℤs[1/2] → ( 0s ≤s 𝐴 ∨ 𝐴 ≤s 0s )) |
| 6 | 5 | ord 878 | . . . 4 ⊢ (𝐴 ∈ ℤs[1/2] → (¬ 0s ≤s 𝐴 → 𝐴 ≤s 0s )) |
| 7 | lenegs 28414 | . . . . . . 7 ⊢ ((𝐴 ∈ No ∧ 0s ∈ No ) → (𝐴 ≤s 0s ↔ ( -us ‘ 0s ) ≤s ( -us ‘𝐴))) | |
| 8 | 3, 2, 7 | sylancl 598 | . . . . . 6 ⊢ (𝐴 ∈ ℤs[1/2] → (𝐴 ≤s 0s ↔ ( -us ‘ 0s ) ≤s ( -us ‘𝐴))) |
| 9 | neg0s 28394 | . . . . . . 7 ⊢ ( -us ‘ 0s ) = 0s | |
| 10 | 9 | breq1i 5110 | . . . . . 6 ⊢ (( -us ‘ 0s ) ≤s ( -us ‘𝐴) ↔ 0s ≤s ( -us ‘𝐴)) |
| 11 | 8, 10 | bitrdi 290 | . . . . 5 ⊢ (𝐴 ∈ ℤs[1/2] → (𝐴 ≤s 0s ↔ 0s ≤s ( -us ‘𝐴))) |
| 12 | z12negscl 28846 | . . . . . . 7 ⊢ (𝐴 ∈ ℤs[1/2] → ( -us ‘𝐴) ∈ ℤs[1/2]) | |
| 13 | z12bdaylem 28852 | . . . . . . . 8 ⊢ ((( -us ‘𝐴) ∈ ℤs[1/2] ∧ 0s ≤s ( -us ‘𝐴)) → ( bday ‘( -us ‘𝐴)) ∈ ω) | |
| 14 | 13 | ex 418 | . . . . . . 7 ⊢ (( -us ‘𝐴) ∈ ℤs[1/2] → ( 0s ≤s ( -us ‘𝐴) → ( bday ‘( -us ‘𝐴)) ∈ ω)) |
| 15 | 12, 14 | syl 18 | . . . . . 6 ⊢ (𝐴 ∈ ℤs[1/2] → ( 0s ≤s ( -us ‘𝐴) → ( bday ‘( -us ‘𝐴)) ∈ ω)) |
| 16 | negbday 28425 | . . . . . . . 8 ⊢ (𝐴 ∈ No → ( bday ‘( -us ‘𝐴)) = ( bday ‘𝐴)) | |
| 17 | 3, 16 | syl 18 | . . . . . . 7 ⊢ (𝐴 ∈ ℤs[1/2] → ( bday ‘( -us ‘𝐴)) = ( bday ‘𝐴)) |
| 18 | 17 | eleq1d 2846 | . . . . . 6 ⊢ (𝐴 ∈ ℤs[1/2] → (( bday ‘( -us ‘𝐴)) ∈ ω ↔ ( bday ‘𝐴) ∈ ω)) |
| 19 | 15, 18 | sylibd 242 | . . . . 5 ⊢ (𝐴 ∈ ℤs[1/2] → ( 0s ≤s ( -us ‘𝐴) → ( bday ‘𝐴) ∈ ω)) |
| 20 | 11, 19 | sylbid 243 | . . . 4 ⊢ (𝐴 ∈ ℤs[1/2] → (𝐴 ≤s 0s → ( bday ‘𝐴) ∈ ω)) |
| 21 | 6, 20 | syld 48 | . . 3 ⊢ (𝐴 ∈ ℤs[1/2] → (¬ 0s ≤s 𝐴 → ( bday ‘𝐴) ∈ ω)) |
| 22 | 21 | imp 412 | . 2 ⊢ ((𝐴 ∈ ℤs[1/2] ∧ ¬ 0s ≤s 𝐴) → ( bday ‘𝐴) ∈ ω) |
| 23 | 1, 22 | pm2.61dan 825 | 1 ⊢ (𝐴 ∈ ℤs[1/2] → ( bday ‘𝐴) ∈ ω) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∨ wo 861 = wceq 1570 ∈ wcel 2145 class class class wbr 5103 ‘cfv 6531 ωcom 7866 No csur 27979 bday cbday 27981 ≤s cles 28083 0s c0s 28173 -us cnegs 28387 ℤs[1/2]cz12s 28782 |
| 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-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-dc 10505 |
| 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-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 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-tp 4589 df-op 4591 df-ot 4593 df-uni 4868 df-int 4908 df-iun 4953 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-se 5605 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-pred 6297 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-1o 8460 df-2o 8461 df-oadd 8464 df-nadd 8659 df-no 27982 df-lts 27983 df-bday 27984 df-les 28084 df-slts 28126 df-cuts 28128 df-0s 28175 df-1s 28176 df-made 28195 df-old 28196 df-left 28198 df-right 28199 df-norec 28306 df-norec2 28317 df-adds 28328 df-negs 28389 df-subs 28390 df-muls 28475 df-divs 28556 df-ons 28620 df-seqs 28652 df-n0s 28682 df-nns 28683 df-zs 28747 df-2s 28779 df-exps 28781 df-z12s 28783 |
| This theorem is used by: bdayfin 28855 |
| Copyright terms: Public domain | W3C validator |