Theorem z12bday 28753

Description: A dyadic fraction has a finite birthday. (Contributed by Scott Fenton, 20-Aug-2025.) (Proof shortened by Scott Fenton, 22-Feb-2026.)

Assertion

Ref	Expression
z12bday	⊢ (𝐴 ∈ ℤs[1/2] → ( bday ‘𝐴) ∈ ω)

Proof of Theorem z12bday

Step	Hyp	Ref	Expression
1		z12bdaylem 28752	. 2 ⊢ ((𝐴 ∈ ℤs[1/2] ∧ 0s ≤s 𝐴) → ( bday ‘𝐴) ∈ ω)
2		0no 28077	. . . . . 6 ⊢ 0s ∈ No
3		z12no 28744	. . . . . 6 ⊢ (𝐴 ∈ ℤs[1/2] → 𝐴 ∈ No )
4		lestric 28007	. . . . . 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 28314	. . . . . . 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 28294	. . . . . . 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 28746	. . . . . . 7 ⊢ (𝐴 ∈ ℤs[1/2] → ( -us ‘𝐴) ∈ ℤs[1/2])
13		z12bdaylem 28752	. . . . . . . 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 28325	. . . . . . . 8 ⊢ (𝐴 ∈ No → ( bday ‘( -us ‘𝐴)) = ( bday ‘𝐴))
17	3, 16	syl 18	. . . . . . 7 ⊢ (𝐴 ∈ ℤs[1/2] → ( bday ‘( -us ‘𝐴)) = ( bday ‘𝐴))
18	17	eleq1d 2845	. . . . . 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 ‘𝐴) ∈ ω)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∨ wo 861   = wceq 1570   ∈ wcel 2145   class class class wbr 5103  ‘cfv 6533  ωcom 7863   No csur 27879   bday cbday 27881   ≤s cles 27983   0_s c0s 28073   -u_s cnegs 28287  ℤ_s[1/2]cz12s 28682

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 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737  ax-dc 10451

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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  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 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-se 5609  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6299  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7371  df-ov 7417  df-oprab 7418  df-mpo 7419  df-om 7864  df-1st 7987  df-2nd 7988  df-frecs 8281  df-wrecs 8312  df-recs 8361  df-rdg 8400  df-1o 8458  df-2o 8459  df-oadd 8462  df-nadd 8657  df-no 27882  df-lts 27883  df-bday 27884  df-les 27984  df-slts 28026  df-cuts 28028  df-0s 28075  df-1s 28076  df-made 28095  df-old 28096  df-left 28098  df-right 28099  df-norec 28206  df-norec2 28217  df-adds 28228  df-negs 28289  df-subs 28290  df-muls 28375  df-divs 28456  df-ons 28520  df-seqs 28552  df-n0s 28582  df-nns 28583  df-zs 28647  df-2s 28679  df-exps 28681  df-z12s 28683

This theorem is used by:  bdayfin  28755