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

Theorem bdaypw2n0bnd 28472
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 28350 . . 3 (𝑁 ∈ ℕ0s → (𝑁 = 0s ∨ ∃𝑥 ∈ ℕ0s 𝑁 = (𝑥 +s 1s )))
2 n0lts1e0 28376 . . . . . 6 (𝐴 ∈ ℕ0s → (𝐴 <s 1s𝐴 = 0s ))
3 oveq1 7375 . . . . . . . . . 10 (𝐴 = 0s → (𝐴 /su 1s ) = ( 0s /su 1s ))
4 0no 27817 . . . . . . . . . . 11 0s No
5 divs1 28212 . . . . . . . . . . 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 6846 . . . . . . . 8 (𝐴 = 0s → ( bday ‘(𝐴 /su 1s )) = ( bday ‘ 0s ))
9 bday0 27819 . . . . . . . 8 ( bday ‘ 0s ) = ∅
108, 9eqtrdi 2788 . . . . . . 7 (𝐴 = 0s → ( bday ‘(𝐴 /su 1s )) = ∅)
11 0ss 4354 . . . . . . 7 ∅ ⊆ suc ∅
1210, 11eqsstrdi 3980 . . . . . 6 (𝐴 = 0s → ( bday ‘(𝐴 /su 1s )) ⊆ suc ∅)
132, 12biimtrdi 253 . . . . 5 (𝐴 ∈ ℕ0s → (𝐴 <s 1s → ( bday ‘(𝐴 /su 1s )) ⊆ suc ∅))
14 oveq2 7376 . . . . . . . 8 (𝑁 = 0s → (2ss𝑁) = (2ss 0s ))
15 2no 28427 . . . . . . . . 9 2s No
16 exps0 28435 . . . . . . . . 9 (2s No → (2ss 0s ) = 1s )
1715, 16ax-mp 5 . . . . . . . 8 (2ss 0s ) = 1s
1814, 17eqtrdi 2788 . . . . . . 7 (𝑁 = 0s → (2ss𝑁) = 1s )
1918breq2d 5112 . . . . . 6 (𝑁 = 0s → (𝐴 <s (2ss𝑁) ↔ 𝐴 <s 1s ))
2018oveq2d 7384 . . . . . . . 8 (𝑁 = 0s → (𝐴 /su (2ss𝑁)) = (𝐴 /su 1s ))
2120fveq2d 6846 . . . . . . 7 (𝑁 = 0s → ( bday ‘(𝐴 /su (2ss𝑁))) = ( bday ‘(𝐴 /su 1s )))
22 fveq2 6842 . . . . . . . . 9 (𝑁 = 0s → ( bday 𝑁) = ( bday ‘ 0s ))
2322, 9eqtrdi 2788 . . . . . . . 8 (𝑁 = 0s → ( bday 𝑁) = ∅)
2423suceqd 6392 . . . . . . 7 (𝑁 = 0s → suc ( bday 𝑁) = suc ∅)
2521, 24sseq12d 3969 . . . . . 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 28471 . . . . . . . 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 7376 . . . . . . . . 9 (𝑁 = (𝑥 +s 1s ) → (2ss𝑁) = (2ss(𝑥 +s 1s )))
3231breq2d 5112 . . . . . . . 8 (𝑁 = (𝑥 +s 1s ) → (𝐴 <s (2ss𝑁) ↔ 𝐴 <s (2ss(𝑥 +s 1s ))))
3331oveq2d 7384 . . . . . . . . . 10 (𝑁 = (𝑥 +s 1s ) → (𝐴 /su (2ss𝑁)) = (𝐴 /su (2ss(𝑥 +s 1s ))))
3433fveq2d 6846 . . . . . . . . 9 (𝑁 = (𝑥 +s 1s ) → ( bday ‘(𝐴 /su (2ss𝑁))) = ( bday ‘(𝐴 /su (2ss(𝑥 +s 1s )))))
35 fveq2 6842 . . . . . . . . . 10 (𝑁 = (𝑥 +s 1s ) → ( bday 𝑁) = ( bday ‘(𝑥 +s 1s )))
3635suceqd 6392 . . . . . . . . 9 (𝑁 = (𝑥 +s 1s ) → suc ( bday 𝑁) = suc ( bday ‘(𝑥 +s 1s )))
3734, 36sseq12d 3969 . . . . . . . 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 3903  c0 4287   class class class wbr 5100  suc csuc 6327  cfv 6500  (class class class)co 7368   No csur 27619   <s clts 27620   bday cbday 27621   0s c0s 27813   1s c1s 27814   +s cadds 27967   /su cdivs 28195  0scn0s 28320  2sc2s 28418  scexps 28420
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 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690  ax-dc 10368
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 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-tp 4587  df-op 4589  df-ot 4591  df-uni 4866  df-int 4905  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-se 5586  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-riota 7325  df-ov 7371  df-oprab 7372  df-mpo 7373  df-om 7819  df-1st 7943  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-rdg 8351  df-1o 8407  df-2o 8408  df-oadd 8411  df-nadd 8604  df-no 27622  df-lts 27623  df-bday 27624  df-les 27725  df-slts 27766  df-cuts 27768  df-0s 27815  df-1s 27816  df-made 27835  df-old 27836  df-left 27838  df-right 27839  df-norec 27946  df-norec2 27957  df-adds 27968  df-negs 28029  df-subs 28030  df-muls 28115  df-divs 28196  df-ons 28260  df-seqs 28292  df-n0s 28322  df-nns 28323  df-zs 28387  df-2s 28419  df-exps 28421
This theorem is referenced by:  bdaypw2bnd  28473  z12bdaylem2  28479  z12bdaylem  28492
  Copyright terms: Public domain W3C validator