Metamath Proof Explorer


Theorem bdayfin

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

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

Proof

Step Hyp Ref Expression
1 zs12bday ( 𝐴 ∈ ℤs[1/2] → ( bday 𝐴 ) ∈ ω )
2 bdayfinlem ( ( 𝐴 No ∧ 0s ≤s 𝐴 ∧ ( bday 𝐴 ) ∈ ω ) → 𝐴 ∈ ℤs[1/2] )
3 2 3exp ( 𝐴 No → ( 0s ≤s 𝐴 → ( ( bday 𝐴 ) ∈ ω → 𝐴 ∈ ℤs[1/2] ) ) )
4 negscl ( 𝐴 No → ( -us𝐴 ) ∈ No )
5 bdayfinlem ( ( ( -us𝐴 ) ∈ No ∧ 0s ≤s ( -us𝐴 ) ∧ ( bday ‘ ( -us𝐴 ) ) ∈ ω ) → ( -us𝐴 ) ∈ ℤs[1/2] )
6 5 3expib ( ( -us𝐴 ) ∈ No → ( ( 0s ≤s ( -us𝐴 ) ∧ ( bday ‘ ( -us𝐴 ) ) ∈ ω ) → ( -us𝐴 ) ∈ ℤs[1/2] ) )
7 4 6 syl ( 𝐴 No → ( ( 0s ≤s ( -us𝐴 ) ∧ ( bday ‘ ( -us𝐴 ) ) ∈ ω ) → ( -us𝐴 ) ∈ ℤs[1/2] ) )
8 0sno 0s No
9 sleneg ( ( 𝐴 No ∧ 0s No ) → ( 𝐴 ≤s 0s ↔ ( -us ‘ 0s ) ≤s ( -us𝐴 ) ) )
10 8 9 mpan2 ( 𝐴 No → ( 𝐴 ≤s 0s ↔ ( -us ‘ 0s ) ≤s ( -us𝐴 ) ) )
11 negs0s ( -us ‘ 0s ) = 0s
12 11 breq1i ( ( -us ‘ 0s ) ≤s ( -us𝐴 ) ↔ 0s ≤s ( -us𝐴 ) )
13 10 12 bitrdi ( 𝐴 No → ( 𝐴 ≤s 0s ↔ 0s ≤s ( -us𝐴 ) ) )
14 negsbday ( 𝐴 No → ( bday ‘ ( -us𝐴 ) ) = ( bday 𝐴 ) )
15 14 eqcomd ( 𝐴 No → ( bday 𝐴 ) = ( bday ‘ ( -us𝐴 ) ) )
16 15 eleq1d ( 𝐴 No → ( ( bday 𝐴 ) ∈ ω ↔ ( bday ‘ ( -us𝐴 ) ) ∈ ω ) )
17 13 16 anbi12d ( 𝐴 No → ( ( 𝐴 ≤s 0s ∧ ( bday 𝐴 ) ∈ ω ) ↔ ( 0s ≤s ( -us𝐴 ) ∧ ( bday ‘ ( -us𝐴 ) ) ∈ ω ) ) )
18 zs12negsclb ( 𝐴 No → ( 𝐴 ∈ ℤs[1/2] ↔ ( -us𝐴 ) ∈ ℤs[1/2] ) )
19 7 17 18 3imtr4d ( 𝐴 No → ( ( 𝐴 ≤s 0s ∧ ( bday 𝐴 ) ∈ ω ) → 𝐴 ∈ ℤs[1/2] ) )
20 19 expd ( 𝐴 No → ( 𝐴 ≤s 0s → ( ( bday 𝐴 ) ∈ ω → 𝐴 ∈ ℤs[1/2] ) ) )
21 sletric ( ( 0s No 𝐴 No ) → ( 0s ≤s 𝐴𝐴 ≤s 0s ) )
22 8 21 mpan ( 𝐴 No → ( 0s ≤s 𝐴𝐴 ≤s 0s ) )
23 3 20 22 mpjaod ( 𝐴 No → ( ( bday 𝐴 ) ∈ ω → 𝐴 ∈ ℤs[1/2] ) )
24 1 23 impbid2 ( 𝐴 No → ( 𝐴 ∈ ℤs[1/2] ↔ ( bday 𝐴 ) ∈ ω ) )