MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  bdaypw2n0bnd Structured version   Visualization version   GIF version

Theorem bdaypw2n0bnd 28470
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 (2ss𝑁)) → ( bday ‘(𝐴 /su (2ss𝑁))) ⊆ suc ( bday 𝑁))

Proof of Theorem bdaypw2n0bnd
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 n0s0suc 28348 . . 3 (𝑁 ∈ ℕ0s → (𝑁 = 0s ∨ ∃𝑥 ∈ ℕ0s 𝑁 = (𝑥 +s 1s )))
2 n0lts1e0 28374 . . . . . 6 (𝐴 ∈ ℕ0s → (𝐴 <s 1s𝐴 = 0s ))
3 oveq1 7367 . . . . . . . . . 10 (𝐴 = 0s → (𝐴 /su 1s ) = ( 0s /su 1s ))
4 0no 27815 . . . . . . . . . . 11 0s No
5 divs1 28210 . . . . . . . . . . 11 ( 0s No → ( 0s /su 1s ) = 0s )
64, 5ax-mp 5 . . . . . . . . . 10 ( 0s /su 1s ) = 0s
73, 6eqtrdi 2788 . . . . . . . . 9 (𝐴 = 0s → (𝐴 /su 1s ) = 0s )
87fveq2d 6838 . . . . . . . 8 (𝐴 = 0s → ( bday ‘(𝐴 /su 1s )) = ( bday ‘ 0s ))
9 bday0 27817 . . . . . . . 8 ( bday ‘ 0s ) = ∅
108, 9eqtrdi 2788 . . . . . . 7 (𝐴 = 0s → ( bday ‘(𝐴 /su 1s )) = ∅)
11 0ss 4341 . . . . . . 7 ∅ ⊆ suc ∅
1210, 11eqsstrdi 3967 . . . . . 6 (𝐴 = 0s → ( bday ‘(𝐴 /su 1s )) ⊆ suc ∅)
132, 12biimtrdi 253 . . . . 5 (𝐴 ∈ ℕ0s → (𝐴 <s 1s → ( bday ‘(𝐴 /su 1s )) ⊆ suc ∅))
14 oveq2 7368 . . . . . . . 8 (𝑁 = 0s → (2ss𝑁) = (2ss 0s ))
15 2no 28425 . . . . . . . . 9 2s No
16 exps0 28433 . . . . . . . . 9 (2s No → (2ss 0s ) = 1s )
1715, 16ax-mp 5 . . . . . . . 8 (2ss 0s ) = 1s
1814, 17eqtrdi 2788 . . . . . . 7 (𝑁 = 0s → (2ss𝑁) = 1s )
1918breq2d 5098 . . . . . 6 (𝑁 = 0s → (𝐴 <s (2ss𝑁) ↔ 𝐴 <s 1s ))
2018oveq2d 7376 . . . . . . . 8 (𝑁 = 0s → (𝐴 /su (2ss𝑁)) = (𝐴 /su 1s ))
2120fveq2d 6838 . . . . . . 7 (𝑁 = 0s → ( bday ‘(𝐴 /su (2ss𝑁))) = ( bday ‘(𝐴 /su 1s )))
22 fveq2 6834 . . . . . . . . 9 (𝑁 = 0s → ( bday 𝑁) = ( bday ‘ 0s ))
2322, 9eqtrdi 2788 . . . . . . . 8 (𝑁 = 0s → ( bday 𝑁) = ∅)
2423suceqd 6384 . . . . . . 7 (𝑁 = 0s → suc ( bday 𝑁) = suc ∅)
2521, 24sseq12d 3956 . . . . . 6 (𝑁 = 0s → (( bday ‘(𝐴 /su (2ss𝑁))) ⊆ suc ( bday 𝑁) ↔ ( bday ‘(𝐴 /su 1s )) ⊆ suc ∅))
2619, 25imbi12d 344 . . . . 5 (𝑁 = 0s → ((𝐴 <s (2ss𝑁) → ( bday ‘(𝐴 /su (2ss𝑁))) ⊆ suc ( bday 𝑁)) ↔ (𝐴 <s 1s → ( bday ‘(𝐴 /su 1s )) ⊆ suc ∅)))
2713, 26imbitrrid 246 . . . 4 (𝑁 = 0s → (𝐴 ∈ ℕ0s → (𝐴 <s (2ss𝑁) → ( bday ‘(𝐴 /su (2ss𝑁))) ⊆ suc ( bday 𝑁))))
28 bdaypw2n0bndlem 28469 . . . . . . . 8 ((𝐴 ∈ ℕ0s𝑥 ∈ ℕ0s𝐴 <s (2ss(𝑥 +s 1s ))) → ( bday ‘(𝐴 /su (2ss(𝑥 +s 1s )))) ⊆ suc ( bday ‘(𝑥 +s 1s )))
29283exp 1120 . . . . . . 7 (𝐴 ∈ ℕ0s → (𝑥 ∈ ℕ0s → (𝐴 <s (2ss(𝑥 +s 1s )) → ( bday ‘(𝐴 /su (2ss(𝑥 +s 1s )))) ⊆ suc ( bday ‘(𝑥 +s 1s )))))
3029com12 32 . . . . . 6 (𝑥 ∈ ℕ0s → (𝐴 ∈ ℕ0s → (𝐴 <s (2ss(𝑥 +s 1s )) → ( bday ‘(𝐴 /su (2ss(𝑥 +s 1s )))) ⊆ suc ( bday ‘(𝑥 +s 1s )))))
31 oveq2 7368 . . . . . . . . 9 (𝑁 = (𝑥 +s 1s ) → (2ss𝑁) = (2ss(𝑥 +s 1s )))
3231breq2d 5098 . . . . . . . 8 (𝑁 = (𝑥 +s 1s ) → (𝐴 <s (2ss𝑁) ↔ 𝐴 <s (2ss(𝑥 +s 1s ))))
3331oveq2d 7376 . . . . . . . . . 10 (𝑁 = (𝑥 +s 1s ) → (𝐴 /su (2ss𝑁)) = (𝐴 /su (2ss(𝑥 +s 1s ))))
3433fveq2d 6838 . . . . . . . . 9 (𝑁 = (𝑥 +s 1s ) → ( bday ‘(𝐴 /su (2ss𝑁))) = ( bday ‘(𝐴 /su (2ss(𝑥 +s 1s )))))
35 fveq2 6834 . . . . . . . . . 10 (𝑁 = (𝑥 +s 1s ) → ( bday 𝑁) = ( bday ‘(𝑥 +s 1s )))
3635suceqd 6384 . . . . . . . . 9 (𝑁 = (𝑥 +s 1s ) → suc ( bday 𝑁) = suc ( bday ‘(𝑥 +s 1s )))
3734, 36sseq12d 3956 . . . . . . . 8 (𝑁 = (𝑥 +s 1s ) → (( bday ‘(𝐴 /su (2ss𝑁))) ⊆ suc ( bday 𝑁) ↔ ( bday ‘(𝐴 /su (2ss(𝑥 +s 1s )))) ⊆ suc ( bday ‘(𝑥 +s 1s ))))
3832, 37imbi12d 344 . . . . . . 7 (𝑁 = (𝑥 +s 1s ) → ((𝐴 <s (2ss𝑁) → ( bday ‘(𝐴 /su (2ss𝑁))) ⊆ suc ( bday 𝑁)) ↔ (𝐴 <s (2ss(𝑥 +s 1s )) → ( bday ‘(𝐴 /su (2ss(𝑥 +s 1s )))) ⊆ suc ( bday ‘(𝑥 +s 1s )))))
3938imbi2d 340 . . . . . 6 (𝑁 = (𝑥 +s 1s ) → ((𝐴 ∈ ℕ0s → (𝐴 <s (2ss𝑁) → ( bday ‘(𝐴 /su (2ss𝑁))) ⊆ suc ( bday 𝑁))) ↔ (𝐴 ∈ ℕ0s → (𝐴 <s (2ss(𝑥 +s 1s )) → ( bday ‘(𝐴 /su (2ss(𝑥 +s 1s )))) ⊆ suc ( bday ‘(𝑥 +s 1s ))))))
4030, 39syl5ibrcom 247 . . . . 5 (𝑥 ∈ ℕ0s → (𝑁 = (𝑥 +s 1s ) → (𝐴 ∈ ℕ0s → (𝐴 <s (2ss𝑁) → ( bday ‘(𝐴 /su (2ss𝑁))) ⊆ suc ( bday 𝑁)))))
4140rexlimiv 3132 . . . 4 (∃𝑥 ∈ ℕ0s 𝑁 = (𝑥 +s 1s ) → (𝐴 ∈ ℕ0s → (𝐴 <s (2ss𝑁) → ( bday ‘(𝐴 /su (2ss𝑁))) ⊆ suc ( bday 𝑁))))
4227, 41jaoi 858 . . 3 ((𝑁 = 0s ∨ ∃𝑥 ∈ ℕ0s 𝑁 = (𝑥 +s 1s )) → (𝐴 ∈ ℕ0s → (𝐴 <s (2ss𝑁) → ( bday ‘(𝐴 /su (2ss𝑁))) ⊆ suc ( bday 𝑁))))
431, 42syl 17 . 2 (𝑁 ∈ ℕ0s → (𝐴 ∈ ℕ0s → (𝐴 <s (2ss𝑁) → ( bday ‘(𝐴 /su (2ss𝑁))) ⊆ suc ( bday 𝑁))))
44433imp21 1114 1 ((𝐴 ∈ ℕ0s𝑁 ∈ ℕ0s𝐴 <s (2ss𝑁)) → ( bday ‘(𝐴 /su (2ss𝑁))) ⊆ suc ( bday 𝑁))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wo 848  w3a 1087   = wceq 1542  wcel 2114  wrex 3062  wss 3890  c0 4274   class class class wbr 5086  suc csuc 6319  cfv 6492  (class class class)co 7360   No csur 27617   <s clts 27618   bday cbday 27619   0s c0s 27811   1s c1s 27812   +s cadds 27965   /su cdivs 28193  0scn0s 28318  2sc2s 28416  scexps 28418
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 5302  ax-pr 5370  ax-un 7682  ax-dc 10359
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 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 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-om 7811  df-1st 7935  df-2nd 7936  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-rdg 8342  df-1o 8398  df-2o 8399  df-oadd 8402  df-nadd 8595  df-no 27620  df-lts 27621  df-bday 27622  df-les 27723  df-slts 27764  df-cuts 27766  df-0s 27813  df-1s 27814  df-made 27833  df-old 27834  df-left 27836  df-right 27837  df-norec 27944  df-norec2 27955  df-adds 27966  df-negs 28027  df-subs 28028  df-muls 28113  df-divs 28194  df-ons 28258  df-seqs 28290  df-n0s 28320  df-nns 28321  df-zs 28385  df-2s 28417  df-exps 28419
This theorem is referenced by:  bdaypw2bnd  28471  z12bdaylem2  28477  z12bdaylem  28490
  Copyright terms: Public domain W3C validator