Theorem bdayfin 28691

Description: A surreal has a finite birthday iff it is a dyadic fraction. (Contributed by Scott Fenton, 26-Feb-2026.)

Assertion

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

Proof of Theorem bdayfin

Step	Hyp	Ref	Expression
1		z12bday 28689	. 2 ⊢ (𝐴 ∈ ℤs[1/2] → ( bday ‘𝐴) ∈ ω)
2		bdayfinlem 28690	. . . 4 ⊢ ((𝐴 ∈ No ∧ 0s ≤s 𝐴 ∧ ( bday ‘𝐴) ∈ ω) → 𝐴 ∈ ℤs[1/2])
3	2	3exp 1136	. . 3 ⊢ (𝐴 ∈ No → ( 0s ≤s 𝐴 → (( bday ‘𝐴) ∈ ω → 𝐴 ∈ ℤs[1/2])))
4		negscl 28240	. . . . . 6 ⊢ (𝐴 ∈ No → ( -us ‘𝐴) ∈ No )
5		bdayfinlem 28690	. . . . . . 7 ⊢ ((( -us ‘𝐴) ∈ No ∧ 0s ≤s ( -us ‘𝐴) ∧ ( bday ‘( -us ‘𝐴)) ∈ ω) → ( -us ‘𝐴) ∈ ℤs[1/2])
6	5	3expib 1139	. . . . . 6 ⊢ (( -us ‘𝐴) ∈ No → (( 0s ≤s ( -us ‘𝐴) ∧ ( bday ‘( -us ‘𝐴)) ∈ ω) → ( -us ‘𝐴) ∈ ℤs[1/2]))
7	4, 6	syl 18	. . . . 5 ⊢ (𝐴 ∈ No → (( 0s ≤s ( -us ‘𝐴) ∧ ( bday ‘( -us ‘𝐴)) ∈ ω) → ( -us ‘𝐴) ∈ ℤs[1/2]))
8		0no 28013	. . . . . . . 8 ⊢ 0s ∈ No
9		lenegs 28250	. . . . . . . 8 ⊢ ((𝐴 ∈ No ∧ 0s ∈ No ) → (𝐴 ≤s 0s ↔ ( -us ‘ 0s ) ≤s ( -us ‘𝐴)))
10	8, 9	mpan2 703	. . . . . . 7 ⊢ (𝐴 ∈ No → (𝐴 ≤s 0s ↔ ( -us ‘ 0s ) ≤s ( -us ‘𝐴)))
11		neg0s 28230	. . . . . . . 8 ⊢ ( -us ‘ 0s ) = 0s
12	11	breq1i 5115	. . . . . . 7 ⊢ (( -us ‘ 0s ) ≤s ( -us ‘𝐴) ↔ 0s ≤s ( -us ‘𝐴))
13	10, 12	bitrdi 290	. . . . . 6 ⊢ (𝐴 ∈ No → (𝐴 ≤s 0s ↔ 0s ≤s ( -us ‘𝐴)))
14		negbday 28261	. . . . . . . 8 ⊢ (𝐴 ∈ No → ( bday ‘( -us ‘𝐴)) = ( bday ‘𝐴))
15	14	eqcomd 2768	. . . . . . 7 ⊢ (𝐴 ∈ No → ( bday ‘𝐴) = ( bday ‘( -us ‘𝐴)))
16	15	eleq1d 2847	. . . . . 6 ⊢ (𝐴 ∈ No → (( bday ‘𝐴) ∈ ω ↔ ( bday ‘( -us ‘𝐴)) ∈ ω))
17	13, 16	anbi12d 643	. . . . 5 ⊢ (𝐴 ∈ No → ((𝐴 ≤s 0s ∧ ( bday ‘𝐴) ∈ ω) ↔ ( 0s ≤s ( -us ‘𝐴) ∧ ( bday ‘( -us ‘𝐴)) ∈ ω)))
18		z12negsclb 28685	. . . . 5 ⊢ (𝐴 ∈ No → (𝐴 ∈ ℤs[1/2] ↔ ( -us ‘𝐴) ∈ ℤs[1/2]))
19	7, 17, 18	3imtr4d 297	. . . 4 ⊢ (𝐴 ∈ No → ((𝐴 ≤s 0s ∧ ( bday ‘𝐴) ∈ ω) → 𝐴 ∈ ℤs[1/2]))
20	19	expd 420	. . 3 ⊢ (𝐴 ∈ No → (𝐴 ≤s 0s → (( bday ‘𝐴) ∈ ω → 𝐴 ∈ ℤs[1/2])))
21		lestric 27943	. . . 4 ⊢ (( 0s ∈ No ∧ 𝐴 ∈ No ) → ( 0s ≤s 𝐴 ∨ 𝐴 ≤s 0s ))
22	8, 21	mpan 702	. . 3 ⊢ (𝐴 ∈ No → ( 0s ≤s 𝐴 ∨ 𝐴 ≤s 0s ))
23	3, 20, 22	mpjaod 873	. 2 ⊢ (𝐴 ∈ No → (( bday ‘𝐴) ∈ ω → 𝐴 ∈ ℤs[1/2]))
24	1, 23	impbid2 229	1 ⊢ (𝐴 ∈ No → (𝐴 ∈ ℤs[1/2] ↔ ( bday ‘𝐴) ∈ ω))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400   ∨ wo 860   ∈ wcel 2142   class class class wbr 5108  ‘cfv 6536  ωcom 7860   No csur 27815   bday cbday 27817   ≤s cles 27919   0_s c0s 28009   -u_s cnegs 28223  ℤ_s[1/2]cz12s 28618

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734  ax-dc 10436  ax-ac2 10453

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1103  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4595  df-ot 4597  df-uni 4872  df-int 4912  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5555  df-eprel 5560  df-po 5568  df-so 5569  df-fr 5613  df-se 5614  df-we 5615  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-isom 6545  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7861  df-1st 7984  df-2nd 7985  df-frecs 8276  df-wrecs 8307  df-recs 8356  df-rdg 8395  df-1o 8451  df-2o 8452  df-oadd 8455  df-nadd 8650  df-er 8692  df-map 8824  df-en 8942  df-dom 8943  df-fin 8945  df-card 9932  df-acn 9935  df-ac 10107  df-no 27818  df-lts 27819  df-bday 27820  df-les 27920  df-slts 27962  df-cuts 27964  df-0s 28011  df-1s 28012  df-made 28031  df-old 28032  df-left 28034  df-right 28035  df-norec 28142  df-norec2 28153  df-adds 28164  df-negs 28225  df-subs 28226  df-muls 28311  df-divs 28392  df-ons 28456  df-seqs 28488  df-n0s 28518  df-nns 28519  df-zs 28583  df-2s 28615  df-exps 28617  df-z12s 28619

This theorem is used by:  dfz12s2  28692