| 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 28554 | . 2 ⊢ ((𝐴 ∈ ℤs[1/2] ∧ 0s ≤s 𝐴) → ( bday ‘𝐴) ∈ ω) | |
| 2 | 0no 27879 | . . . . . 6 ⊢ 0s ∈ No | |
| 3 | z12no 28546 | . . . . . 6 ⊢ (𝐴 ∈ ℤs[1/2] → 𝐴 ∈ No ) | |
| 4 | lestric 27809 | . . . . . 6 ⊢ (( 0s ∈ No ∧ 𝐴 ∈ No ) → ( 0s ≤s 𝐴 ∨ 𝐴 ≤s 0s )) | |
| 5 | 2, 3, 4 | sylancr 596 | . . . . 5 ⊢ (𝐴 ∈ ℤs[1/2] → ( 0s ≤s 𝐴 ∨ 𝐴 ≤s 0s )) |
| 6 | 5 | ord 875 | . . . 4 ⊢ (𝐴 ∈ ℤs[1/2] → (¬ 0s ≤s 𝐴 → 𝐴 ≤s 0s )) |
| 7 | lenegs 28116 | . . . . . . 7 ⊢ ((𝐴 ∈ No ∧ 0s ∈ No ) → (𝐴 ≤s 0s ↔ ( -us ‘ 0s ) ≤s ( -us ‘𝐴))) | |
| 8 | 3, 2, 7 | sylancl 595 | . . . . . 6 ⊢ (𝐴 ∈ ℤs[1/2] → (𝐴 ≤s 0s ↔ ( -us ‘ 0s ) ≤s ( -us ‘𝐴))) |
| 9 | neg0s 28096 | . . . . . . 7 ⊢ ( -us ‘ 0s ) = 0s | |
| 10 | 9 | breq1i 5106 | . . . . . 6 ⊢ (( -us ‘ 0s ) ≤s ( -us ‘𝐴) ↔ 0s ≤s ( -us ‘𝐴)) |
| 11 | 8, 10 | bitrdi 289 | . . . . 5 ⊢ (𝐴 ∈ ℤs[1/2] → (𝐴 ≤s 0s ↔ 0s ≤s ( -us ‘𝐴))) |
| 12 | z12negscl 28548 | . . . . . . 7 ⊢ (𝐴 ∈ ℤs[1/2] → ( -us ‘𝐴) ∈ ℤs[1/2]) | |
| 13 | z12bdaylem 28554 | . . . . . . . 8 ⊢ ((( -us ‘𝐴) ∈ ℤs[1/2] ∧ 0s ≤s ( -us ‘𝐴)) → ( bday ‘( -us ‘𝐴)) ∈ ω) | |
| 14 | 13 | ex 416 | . . . . . . 7 ⊢ (( -us ‘𝐴) ∈ ℤs[1/2] → ( 0s ≤s ( -us ‘𝐴) → ( bday ‘( -us ‘𝐴)) ∈ ω)) |
| 15 | 12, 14 | syl 17 | . . . . . 6 ⊢ (𝐴 ∈ ℤs[1/2] → ( 0s ≤s ( -us ‘𝐴) → ( bday ‘( -us ‘𝐴)) ∈ ω)) |
| 16 | negbday 28127 | . . . . . . . 8 ⊢ (𝐴 ∈ No → ( bday ‘( -us ‘𝐴)) = ( bday ‘𝐴)) | |
| 17 | 3, 16 | syl 17 | . . . . . . 7 ⊢ (𝐴 ∈ ℤs[1/2] → ( bday ‘( -us ‘𝐴)) = ( bday ‘𝐴)) |
| 18 | 17 | eleq1d 2846 | . . . . . 6 ⊢ (𝐴 ∈ ℤs[1/2] → (( bday ‘( -us ‘𝐴)) ∈ ω ↔ ( bday ‘𝐴) ∈ ω)) |
| 19 | 15, 18 | sylibd 241 | . . . . 5 ⊢ (𝐴 ∈ ℤs[1/2] → ( 0s ≤s ( -us ‘𝐴) → ( bday ‘𝐴) ∈ ω)) |
| 20 | 11, 19 | sylbid 242 | . . . 4 ⊢ (𝐴 ∈ ℤs[1/2] → (𝐴 ≤s 0s → ( bday ‘𝐴) ∈ ω)) |
| 21 | 6, 20 | syld 47 | . . 3 ⊢ (𝐴 ∈ ℤs[1/2] → (¬ 0s ≤s 𝐴 → ( bday ‘𝐴) ∈ ω)) |
| 22 | 21 | imp 410 | . 2 ⊢ ((𝐴 ∈ ℤs[1/2] ∧ ¬ 0s ≤s 𝐴) → ( bday ‘𝐴) ∈ ω) |
| 23 | 1, 22 | pm2.61dan 822 | 1 ⊢ (𝐴 ∈ ℤs[1/2] → ( bday ‘𝐴) ∈ ω) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∨ wo 858 = wceq 1559 ∈ wcel 2141 class class class wbr 5099 ‘cfv 6517 ωcom 7842 No csur 27681 bday cbday 27683 ≤s cles 27785 0s c0s 27875 -us cnegs 28089 ℤs[1/2]cz12s 28484 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7714 ax-dc 10400 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-tp 4586 df-op 4588 df-ot 4590 df-uni 4865 df-int 4905 df-iun 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5540 df-eprel 5545 df-po 5553 df-so 5554 df-fr 5598 df-se 5599 df-we 5600 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-pred 6284 df-ord 6345 df-on 6346 df-lim 6347 df-suc 6348 df-iota 6473 df-fun 6519 df-fn 6520 df-f 6521 df-f1 6522 df-fo 6523 df-f1o 6524 df-fv 6525 df-riota 7349 df-ov 7395 df-oprab 7396 df-mpo 7397 df-om 7843 df-1st 7966 df-2nd 7967 df-frecs 8257 df-wrecs 8288 df-recs 8337 df-rdg 8376 df-1o 8432 df-2o 8433 df-oadd 8436 df-nadd 8631 df-no 27684 df-lts 27685 df-bday 27686 df-les 27786 df-slts 27828 df-cuts 27830 df-0s 27877 df-1s 27878 df-made 27897 df-old 27898 df-left 27900 df-right 27901 df-norec 28008 df-norec2 28019 df-adds 28030 df-negs 28091 df-subs 28092 df-muls 28177 df-divs 28258 df-ons 28322 df-seqs 28354 df-n0s 28384 df-nns 28385 df-zs 28449 df-2s 28481 df-exps 28483 df-z12s 28485 |
| This theorem is referenced by: bdayfin 28557 |
| Copyright terms: Public domain | W3C validator |