Theorem bdaypw2n0bnd 28460

Description: Upper bound for the birthday of a proper fraction of a power of two. This is actually a strict equality when 𝐴 is odd, but we do not need this for the rest of our development. (Contributed by Scott Fenton, 22-Feb-2026.)

Assertion

Ref	Expression
bdaypw2n0bnd	⊢ ((𝐴 ∈ ℕ0s ∧ 𝑁 ∈ ℕ0s ∧ 𝐴 <s (2s↑s𝑁)) → ( bday ‘(𝐴 /su (2s↑s𝑁))) ⊆ suc ( bday ‘𝑁))

Proof of Theorem bdaypw2n0bnd

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		n0s0suc 28338	. . 3 ⊢ (𝑁 ∈ ℕ0s → (𝑁 = 0s ∨ ∃𝑥 ∈ ℕ0s 𝑁 = (𝑥 +s 1s )))
2		n0lts1e0 28364	. . . . . 6 ⊢ (𝐴 ∈ ℕ0s → (𝐴 <s 1s ↔ 𝐴 = 0s ))
3		oveq1 7365	. . . . . . . . . 10 ⊢ (𝐴 = 0s → (𝐴 /su 1s ) = ( 0s /su 1s ))
4		0no 27805	. . . . . . . . . . 11 ⊢ 0s ∈ No
5		divs1 28200	. . . . . . . . . . 11 ⊢ ( 0s ∈ No → ( 0s /su 1s ) = 0s )
6	4, 5	ax-mp 5	. . . . . . . . . 10 ⊢ ( 0s /su 1s ) = 0s
7	3, 6	eqtrdi 2787	. . . . . . . . 9 ⊢ (𝐴 = 0s → (𝐴 /su 1s ) = 0s )
8	7	fveq2d 6838	. . . . . . . 8 ⊢ (𝐴 = 0s → ( bday ‘(𝐴 /su 1s )) = ( bday ‘ 0s ))
9		bday0 27807	. . . . . . . 8 ⊢ ( bday ‘ 0s ) = ∅
10	8, 9	eqtrdi 2787	. . . . . . 7 ⊢ (𝐴 = 0s → ( bday ‘(𝐴 /su 1s )) = ∅)
11		0ss 4352	. . . . . . 7 ⊢ ∅ ⊆ suc ∅
12	10, 11	eqsstrdi 3978	. . . . . 6 ⊢ (𝐴 = 0s → ( bday ‘(𝐴 /su 1s )) ⊆ suc ∅)
13	2, 12	biimtrdi 253	. . . . 5 ⊢ (𝐴 ∈ ℕ0s → (𝐴 <s 1s → ( bday ‘(𝐴 /su 1s )) ⊆ suc ∅))
14		oveq2 7366	. . . . . . . 8 ⊢ (𝑁 = 0s → (2s↑s𝑁) = (2s↑s 0s ))
15		2no 28415	. . . . . . . . 9 ⊢ 2s ∈ No
16		exps0 28423	. . . . . . . . 9 ⊢ (2s ∈ No → (2s↑s 0s ) = 1s )
17	15, 16	ax-mp 5	. . . . . . . 8 ⊢ (2s↑s 0s ) = 1s
18	14, 17	eqtrdi 2787	. . . . . . 7 ⊢ (𝑁 = 0s → (2s↑s𝑁) = 1s )
19	18	breq2d 5110	. . . . . 6 ⊢ (𝑁 = 0s → (𝐴 <s (2s↑s𝑁) ↔ 𝐴 <s 1s ))
20	18	oveq2d 7374	. . . . . . . 8 ⊢ (𝑁 = 0s → (𝐴 /su (2s↑s𝑁)) = (𝐴 /su 1s ))
21	20	fveq2d 6838	. . . . . . 7 ⊢ (𝑁 = 0s → ( bday ‘(𝐴 /su (2s↑s𝑁))) = ( bday ‘(𝐴 /su 1s )))
22		fveq2 6834	. . . . . . . . 9 ⊢ (𝑁 = 0s → ( bday ‘𝑁) = ( bday ‘ 0s ))
23	22, 9	eqtrdi 2787	. . . . . . . 8 ⊢ (𝑁 = 0s → ( bday ‘𝑁) = ∅)
24	23	suceqd 6384	. . . . . . 7 ⊢ (𝑁 = 0s → suc ( bday ‘𝑁) = suc ∅)
25	21, 24	sseq12d 3967	. . . . . 6 ⊢ (𝑁 = 0s → (( bday ‘(𝐴 /su (2s↑s𝑁))) ⊆ suc ( bday ‘𝑁) ↔ ( bday ‘(𝐴 /su 1s )) ⊆ suc ∅))
26	19, 25	imbi12d 344	. . . . 5 ⊢ (𝑁 = 0s → ((𝐴 <s (2s↑s𝑁) → ( bday ‘(𝐴 /su (2s↑s𝑁))) ⊆ suc ( bday ‘𝑁)) ↔ (𝐴 <s 1s → ( bday ‘(𝐴 /su 1s )) ⊆ suc ∅)))
27	13, 26	imbitrrid 246	. . . 4 ⊢ (𝑁 = 0s → (𝐴 ∈ ℕ0s → (𝐴 <s (2s↑s𝑁) → ( bday ‘(𝐴 /su (2s↑s𝑁))) ⊆ suc ( bday ‘𝑁))))
28		bdaypw2n0bndlem 28459	. . . . . . . 8 ⊢ ((𝐴 ∈ ℕ0s ∧ 𝑥 ∈ ℕ0s ∧ 𝐴 <s (2s↑s(𝑥 +s 1s ))) → ( bday ‘(𝐴 /su (2s↑s(𝑥 +s 1s )))) ⊆ suc ( bday ‘(𝑥 +s 1s )))
29	28	3exp 1119	. . . . . . 7 ⊢ (𝐴 ∈ ℕ0s → (𝑥 ∈ ℕ0s → (𝐴 <s (2s↑s(𝑥 +s 1s )) → ( bday ‘(𝐴 /su (2s↑s(𝑥 +s 1s )))) ⊆ suc ( bday ‘(𝑥 +s 1s )))))
30	29	com12 32	. . . . . 6 ⊢ (𝑥 ∈ ℕ0s → (𝐴 ∈ ℕ0s → (𝐴 <s (2s↑s(𝑥 +s 1s )) → ( bday ‘(𝐴 /su (2s↑s(𝑥 +s 1s )))) ⊆ suc ( bday ‘(𝑥 +s 1s )))))
31		oveq2 7366	. . . . . . . . 9 ⊢ (𝑁 = (𝑥 +s 1s ) → (2s↑s𝑁) = (2s↑s(𝑥 +s 1s )))
32	31	breq2d 5110	. . . . . . . 8 ⊢ (𝑁 = (𝑥 +s 1s ) → (𝐴 <s (2s↑s𝑁) ↔ 𝐴 <s (2s↑s(𝑥 +s 1s ))))
33	31	oveq2d 7374	. . . . . . . . . 10 ⊢ (𝑁 = (𝑥 +s 1s ) → (𝐴 /su (2s↑s𝑁)) = (𝐴 /su (2s↑s(𝑥 +s 1s ))))
34	33	fveq2d 6838	. . . . . . . . 9 ⊢ (𝑁 = (𝑥 +s 1s ) → ( bday ‘(𝐴 /su (2s↑s𝑁))) = ( bday ‘(𝐴 /su (2s↑s(𝑥 +s 1s )))))
35		fveq2 6834	. . . . . . . . . 10 ⊢ (𝑁 = (𝑥 +s 1s ) → ( bday ‘𝑁) = ( bday ‘(𝑥 +s 1s )))
36	35	suceqd 6384	. . . . . . . . 9 ⊢ (𝑁 = (𝑥 +s 1s ) → suc ( bday ‘𝑁) = suc ( bday ‘(𝑥 +s 1s )))
37	34, 36	sseq12d 3967	. . . . . . . 8 ⊢ (𝑁 = (𝑥 +s 1s ) → (( bday ‘(𝐴 /su (2s↑s𝑁))) ⊆ suc ( bday ‘𝑁) ↔ ( bday ‘(𝐴 /su (2s↑s(𝑥 +s 1s )))) ⊆ suc ( bday ‘(𝑥 +s 1s ))))
38	32, 37	imbi12d 344	. . . . . . 7 ⊢ (𝑁 = (𝑥 +s 1s ) → ((𝐴 <s (2s↑s𝑁) → ( bday ‘(𝐴 /su (2s↑s𝑁))) ⊆ suc ( bday ‘𝑁)) ↔ (𝐴 <s (2s↑s(𝑥 +s 1s )) → ( bday ‘(𝐴 /su (2s↑s(𝑥 +s 1s )))) ⊆ suc ( bday ‘(𝑥 +s 1s )))))
39	38	imbi2d 340	. . . . . 6 ⊢ (𝑁 = (𝑥 +s 1s ) → ((𝐴 ∈ ℕ0s → (𝐴 <s (2s↑s𝑁) → ( bday ‘(𝐴 /su (2s↑s𝑁))) ⊆ suc ( bday ‘𝑁))) ↔ (𝐴 ∈ ℕ0s → (𝐴 <s (2s↑s(𝑥 +s 1s )) → ( bday ‘(𝐴 /su (2s↑s(𝑥 +s 1s )))) ⊆ suc ( bday ‘(𝑥 +s 1s ))))))
40	30, 39	syl5ibrcom 247	. . . . 5 ⊢ (𝑥 ∈ ℕ0s → (𝑁 = (𝑥 +s 1s ) → (𝐴 ∈ ℕ0s → (𝐴 <s (2s↑s𝑁) → ( bday ‘(𝐴 /su (2s↑s𝑁))) ⊆ suc ( bday ‘𝑁)))))
41	40	rexlimiv 3130	. . . 4 ⊢ (∃𝑥 ∈ ℕ0s 𝑁 = (𝑥 +s 1s ) → (𝐴 ∈ ℕ0s → (𝐴 <s (2s↑s𝑁) → ( bday ‘(𝐴 /su (2s↑s𝑁))) ⊆ suc ( bday ‘𝑁))))
42	27, 41	jaoi 857	. . 3 ⊢ ((𝑁 = 0s ∨ ∃𝑥 ∈ ℕ0s 𝑁 = (𝑥 +s 1s )) → (𝐴 ∈ ℕ0s → (𝐴 <s (2s↑s𝑁) → ( bday ‘(𝐴 /su (2s↑s𝑁))) ⊆ suc ( bday ‘𝑁))))
43	1, 42	syl 17	. 2 ⊢ (𝑁 ∈ ℕ0s → (𝐴 ∈ ℕ0s → (𝐴 <s (2s↑s𝑁) → ( bday ‘(𝐴 /su (2s↑s𝑁))) ⊆ suc ( bday ‘𝑁))))
44	43	3imp21 1113	1 ⊢ ((𝐴 ∈ ℕ0s ∧ 𝑁 ∈ ℕ0s ∧ 𝐴 <s (2s↑s𝑁)) → ( bday ‘(𝐴 /su (2s↑s𝑁))) ⊆ suc ( bday ‘𝑁))

Syntax hints:   → wi 4   ∨ wo 847   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113  ∃wrex 3060   ⊆ wss 3901  ∅c0 4285   class class class wbr 5098  suc csuc 6319  ‘cfv 6492  (class class class)co 7358   No csur 27607   <s clts 27608   bday cbday 27609   0_s c0s 27801   1_s c1s 27802   +_s cadds 27955   /_su cdivs 28183  ℕ_0scn0s 28308  2_sc2s 28406  ↑_scexps 28408

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-rep 5224  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680  ax-dc 10356

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rmo 3350  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-pss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-tp 4585  df-op 4587  df-ot 4589  df-uni 4864  df-int 4903  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-tr 5206  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-se 5578  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7315  df-ov 7361  df-oprab 7362  df-mpo 7363  df-om 7809  df-1st 7933  df-2nd 7934  df-frecs 8223  df-wrecs 8254  df-recs 8303  df-rdg 8341  df-1o 8397  df-2o 8398  df-oadd 8401  df-nadd 8594  df-no 27610  df-lts 27611  df-bday 27612  df-les 27713  df-slts 27754  df-cuts 27756  df-0s 27803  df-1s 27804  df-made 27823  df-old 27824  df-left 27826  df-right 27827  df-norec 27934  df-norec2 27945  df-adds 27956  df-negs 28017  df-subs 28018  df-muls 28103  df-divs 28184  df-ons 28248  df-seqs 28280  df-n0s 28310  df-nns 28311  df-zs 28375  df-2s 28407  df-exps 28409

This theorem is referenced by:  bdaypw2bnd  28461  z12bdaylem2  28467  z12bdaylem  28480