| 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 28464 | . 2 ⊢ ((𝐴 ∈ ℤs[1/2] ∧ 0s ≤s 𝐴) → ( bday ‘𝐴) ∈ ω) | |
| 2 | 0no 27789 | . . . . . 6 ⊢ 0s ∈ No | |
| 3 | z12no 28456 | . . . . . 6 ⊢ (𝐴 ∈ ℤs[1/2] → 𝐴 ∈ No ) | |
| 4 | lestric 27720 | . . . . . 6 ⊢ (( 0s ∈ No ∧ 𝐴 ∈ No ) → ( 0s ≤s 𝐴 ∨ 𝐴 ≤s 0s )) | |
| 5 | 2, 3, 4 | sylancr 588 | . . . . 5 ⊢ (𝐴 ∈ ℤs[1/2] → ( 0s ≤s 𝐴 ∨ 𝐴 ≤s 0s )) |
| 6 | 5 | ord 865 | . . . 4 ⊢ (𝐴 ∈ ℤs[1/2] → (¬ 0s ≤s 𝐴 → 𝐴 ≤s 0s )) |
| 7 | lenegs 28026 | . . . . . . 7 ⊢ ((𝐴 ∈ No ∧ 0s ∈ No ) → (𝐴 ≤s 0s ↔ ( -us ‘ 0s ) ≤s ( -us ‘𝐴))) | |
| 8 | 3, 2, 7 | sylancl 587 | . . . . . 6 ⊢ (𝐴 ∈ ℤs[1/2] → (𝐴 ≤s 0s ↔ ( -us ‘ 0s ) ≤s ( -us ‘𝐴))) |
| 9 | neg0s 28006 | . . . . . . 7 ⊢ ( -us ‘ 0s ) = 0s | |
| 10 | 9 | breq1i 5093 | . . . . . 6 ⊢ (( -us ‘ 0s ) ≤s ( -us ‘𝐴) ↔ 0s ≤s ( -us ‘𝐴)) |
| 11 | 8, 10 | bitrdi 287 | . . . . 5 ⊢ (𝐴 ∈ ℤs[1/2] → (𝐴 ≤s 0s ↔ 0s ≤s ( -us ‘𝐴))) |
| 12 | z12negscl 28458 | . . . . . . 7 ⊢ (𝐴 ∈ ℤs[1/2] → ( -us ‘𝐴) ∈ ℤs[1/2]) | |
| 13 | z12bdaylem 28464 | . . . . . . . 8 ⊢ ((( -us ‘𝐴) ∈ ℤs[1/2] ∧ 0s ≤s ( -us ‘𝐴)) → ( bday ‘( -us ‘𝐴)) ∈ ω) | |
| 14 | 13 | ex 412 | . . . . . . 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 28037 | . . . . . . . 8 ⊢ (𝐴 ∈ No → ( bday ‘( -us ‘𝐴)) = ( bday ‘𝐴)) | |
| 17 | 3, 16 | syl 17 | . . . . . . 7 ⊢ (𝐴 ∈ ℤs[1/2] → ( bday ‘( -us ‘𝐴)) = ( bday ‘𝐴)) |
| 18 | 17 | eleq1d 2822 | . . . . . 6 ⊢ (𝐴 ∈ ℤs[1/2] → (( bday ‘( -us ‘𝐴)) ∈ ω ↔ ( bday ‘𝐴) ∈ ω)) |
| 19 | 15, 18 | sylibd 239 | . . . . 5 ⊢ (𝐴 ∈ ℤs[1/2] → ( 0s ≤s ( -us ‘𝐴) → ( bday ‘𝐴) ∈ ω)) |
| 20 | 11, 19 | sylbid 240 | . . . 4 ⊢ (𝐴 ∈ ℤs[1/2] → (𝐴 ≤s 0s → ( bday ‘𝐴) ∈ ω)) |
| 21 | 6, 20 | syld 47 | . . 3 ⊢ (𝐴 ∈ ℤs[1/2] → (¬ 0s ≤s 𝐴 → ( bday ‘𝐴) ∈ ω)) |
| 22 | 21 | imp 406 | . 2 ⊢ ((𝐴 ∈ ℤs[1/2] ∧ ¬ 0s ≤s 𝐴) → ( bday ‘𝐴) ∈ ω) |
| 23 | 1, 22 | pm2.61dan 813 | 1 ⊢ (𝐴 ∈ ℤs[1/2] → ( bday ‘𝐴) ∈ ω) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∨ wo 848 = wceq 1542 ∈ wcel 2114 class class class wbr 5086 ‘cfv 6490 ωcom 7808 No csur 27591 bday cbday 27593 ≤s cles 27696 0s c0s 27785 -us cnegs 27999 ℤs[1/2]cz12s 28394 |
| 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 5212 ax-sep 5231 ax-nul 5241 ax-pow 5300 ax-pr 5368 ax-un 7680 ax-dc 10357 |
| 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-ot 4577 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-se 5576 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-lim 6320 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 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8222 df-wrecs 8253 df-recs 8302 df-rdg 8340 df-1o 8396 df-2o 8397 df-oadd 8400 df-nadd 8593 df-no 27594 df-lts 27595 df-bday 27596 df-les 27697 df-slts 27738 df-cuts 27740 df-0s 27787 df-1s 27788 df-made 27807 df-old 27808 df-left 27810 df-right 27811 df-norec 27918 df-norec2 27929 df-adds 27940 df-negs 28001 df-subs 28002 df-muls 28087 df-divs 28168 df-ons 28232 df-seqs 28264 df-n0s 28294 df-nns 28295 df-zs 28359 df-2s 28391 df-exps 28393 df-z12s 28395 |
| This theorem is referenced by: bdayfin 28467 |
| Copyright terms: Public domain | W3C validator |