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

Theorem bdaypw2n0bnd 28694
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 28572 . . 3 (𝑁 ∈ ℕ0s → (𝑁 = 0s ∨ ∃𝑥 ∈ ℕ0s 𝑁 = (𝑥 +s 1s )))
2 n0lts1e0 28598 . . . . . 6 (𝐴 ∈ ℕ0s → (𝐴 <s 1s𝐴 = 0s ))
3 oveq1 7430 . . . . . . . . . 10 (𝐴 = 0s → (𝐴 /su 1s ) = ( 0s /su 1s ))
4 0no 28039 . . . . . . . . . . 11 0s No
5 divs1 28434 . . . . . . . . . . 11 ( 0s No → ( 0s /su 1s ) = 0s )
64, 5ax-mp 5 . . . . . . . . . 10 ( 0s /su 1s ) = 0s
73, 6eqtrdi 2817 . . . . . . . . 9 (𝐴 = 0s → (𝐴 /su 1s ) = 0s )
87fveq2d 6892 . . . . . . . 8 (𝐴 = 0s → ( bday ‘(𝐴 /su 1s )) = ( bday ‘ 0s ))
9 bday0 28041 . . . . . . . 8 ( bday ‘ 0s ) = ∅
108, 9eqtrdi 2817 . . . . . . 7 (𝐴 = 0s → ( bday ‘(𝐴 /su 1s )) = ∅)
11 0ss 4360 . . . . . . 7 ∅ ⊆ suc ∅
1210, 11eqsstrdi 3984 . . . . . 6 (𝐴 = 0s → ( bday ‘(𝐴 /su 1s )) ⊆ suc ∅)
132, 12biimtrdi 256 . . . . 5 (𝐴 ∈ ℕ0s → (𝐴 <s 1s → ( bday ‘(𝐴 /su 1s )) ⊆ suc ∅))
14 oveq2 7431 . . . . . . . 8 (𝑁 = 0s → (2ss𝑁) = (2ss 0s ))
15 2no 28649 . . . . . . . . 9 2s No
16 exps0 28657 . . . . . . . . 9 (2s No → (2ss 0s ) = 1s )
1715, 16ax-mp 5 . . . . . . . 8 (2ss 0s ) = 1s
1814, 17eqtrdi 2817 . . . . . . 7 (𝑁 = 0s → (2ss𝑁) = 1s )
1918breq2d 5126 . . . . . 6 (𝑁 = 0s → (𝐴 <s (2ss𝑁) ↔ 𝐴 <s 1s ))
2018oveq2d 7439 . . . . . . . 8 (𝑁 = 0s → (𝐴 /su (2ss𝑁)) = (𝐴 /su 1s ))
2120fveq2d 6892 . . . . . . 7 (𝑁 = 0s → ( bday ‘(𝐴 /su (2ss𝑁))) = ( bday ‘(𝐴 /su 1s )))
22 fveq2 6888 . . . . . . . . 9 (𝑁 = 0s → ( bday 𝑁) = ( bday ‘ 0s ))
2322, 9eqtrdi 2817 . . . . . . . 8 (𝑁 = 0s → ( bday 𝑁) = ∅)
2423suceqd 6435 . . . . . . 7 (𝑁 = 0s → suc ( bday 𝑁) = suc ∅)
2521, 24sseq12d 3973 . . . . . 6 (𝑁 = 0s → (( bday ‘(𝐴 /su (2ss𝑁))) ⊆ suc ( bday 𝑁) ↔ ( bday ‘(𝐴 /su 1s )) ⊆ suc ∅))
2619, 25imbi12d 347 . . . . 5 (𝑁 = 0s → ((𝐴 <s (2ss𝑁) → ( bday ‘(𝐴 /su (2ss𝑁))) ⊆ suc ( bday 𝑁)) ↔ (𝐴 <s 1s → ( bday ‘(𝐴 /su 1s )) ⊆ suc ∅)))
2713, 26imbitrrid 249 . . . 4 (𝑁 = 0s → (𝐴 ∈ ℕ0s → (𝐴 <s (2ss𝑁) → ( bday ‘(𝐴 /su (2ss𝑁))) ⊆ suc ( bday 𝑁))))
28 bdaypw2n0bndlem 28693 . . . . . . . 8 ((𝐴 ∈ ℕ0s𝑥 ∈ ℕ0s𝐴 <s (2ss(𝑥 +s 1s ))) → ( bday ‘(𝐴 /su (2ss(𝑥 +s 1s )))) ⊆ suc ( bday ‘(𝑥 +s 1s )))
29283exp 1137 . . . . . . 7 (𝐴 ∈ ℕ0s → (𝑥 ∈ ℕ0s → (𝐴 <s (2ss(𝑥 +s 1s )) → ( bday ‘(𝐴 /su (2ss(𝑥 +s 1s )))) ⊆ suc ( bday ‘(𝑥 +s 1s )))))
3029com12 33 . . . . . 6 (𝑥 ∈ ℕ0s → (𝐴 ∈ ℕ0s → (𝐴 <s (2ss(𝑥 +s 1s )) → ( bday ‘(𝐴 /su (2ss(𝑥 +s 1s )))) ⊆ suc ( bday ‘(𝑥 +s 1s )))))
31 oveq2 7431 . . . . . . . . 9 (𝑁 = (𝑥 +s 1s ) → (2ss𝑁) = (2ss(𝑥 +s 1s )))
3231breq2d 5126 . . . . . . . 8 (𝑁 = (𝑥 +s 1s ) → (𝐴 <s (2ss𝑁) ↔ 𝐴 <s (2ss(𝑥 +s 1s ))))
3331oveq2d 7439 . . . . . . . . . 10 (𝑁 = (𝑥 +s 1s ) → (𝐴 /su (2ss𝑁)) = (𝐴 /su (2ss(𝑥 +s 1s ))))
3433fveq2d 6892 . . . . . . . . 9 (𝑁 = (𝑥 +s 1s ) → ( bday ‘(𝐴 /su (2ss𝑁))) = ( bday ‘(𝐴 /su (2ss(𝑥 +s 1s )))))
35 fveq2 6888 . . . . . . . . . 10 (𝑁 = (𝑥 +s 1s ) → ( bday 𝑁) = ( bday ‘(𝑥 +s 1s )))
3635suceqd 6435 . . . . . . . . 9 (𝑁 = (𝑥 +s 1s ) → suc ( bday 𝑁) = suc ( bday ‘(𝑥 +s 1s )))
3734, 36sseq12d 3973 . . . . . . . 8 (𝑁 = (𝑥 +s 1s ) → (( bday ‘(𝐴 /su (2ss𝑁))) ⊆ suc ( bday 𝑁) ↔ ( bday ‘(𝐴 /su (2ss(𝑥 +s 1s )))) ⊆ suc ( bday ‘(𝑥 +s 1s ))))
3832, 37imbi12d 347 . . . . . . 7 (𝑁 = (𝑥 +s 1s ) → ((𝐴 <s (2ss𝑁) → ( bday ‘(𝐴 /su (2ss𝑁))) ⊆ suc ( bday 𝑁)) ↔ (𝐴 <s (2ss(𝑥 +s 1s )) → ( bday ‘(𝐴 /su (2ss(𝑥 +s 1s )))) ⊆ suc ( bday ‘(𝑥 +s 1s )))))
3938imbi2d 343 . . . . . 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 250 . . . . 5 (𝑥 ∈ ℕ0s → (𝑁 = (𝑥 +s 1s ) → (𝐴 ∈ ℕ0s → (𝐴 <s (2ss𝑁) → ( bday ‘(𝐴 /su (2ss𝑁))) ⊆ suc ( bday 𝑁)))))
4140rexlimiv 3162 . . . 4 (∃𝑥 ∈ ℕ0s 𝑁 = (𝑥 +s 1s ) → (𝐴 ∈ ℕ0s → (𝐴 <s (2ss𝑁) → ( bday ‘(𝐴 /su (2ss𝑁))) ⊆ suc ( bday 𝑁))))
4227, 41jaoi 871 . . 3 ((𝑁 = 0s ∨ ∃𝑥 ∈ ℕ0s 𝑁 = (𝑥 +s 1s )) → (𝐴 ∈ ℕ0s → (𝐴 <s (2ss𝑁) → ( bday ‘(𝐴 /su (2ss𝑁))) ⊆ suc ( bday 𝑁))))
431, 42syl 18 . 2 (𝑁 ∈ ℕ0s → (𝐴 ∈ ℕ0s → (𝐴 <s (2ss𝑁) → ( bday ‘(𝐴 /su (2ss𝑁))) ⊆ suc ( bday 𝑁))))
44433imp21 1131 1 ((𝐴 ∈ ℕ0s𝑁 ∈ ℕ0s𝐴 <s (2ss𝑁)) → ( bday ‘(𝐴 /su (2ss𝑁))) ⊆ suc ( bday 𝑁))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wo 861  w3a 1103   = wceq 1570  wcel 2146  wrex 3092  wss 3908  c0 4289   class class class wbr 5114  suc csuc 6369  cfv 6543  (class class class)co 7423   No csur 27841   <s clts 27842   bday cbday 27843   0s c0s 28035   1s c1s 28036   +s cadds 28189   /su cdivs 28417  0scn0s 28542  2sc2s 28640  scexps 28642
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745  ax-dc 10448
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rmo 3372  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3928  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-tp 4599  df-op 4601  df-ot 4603  df-uni 4878  df-int 4918  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-tr 5224  df-id 5561  df-eprel 5566  df-po 5574  df-so 5575  df-fr 5619  df-se 5620  df-we 5621  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-pred 6309  df-ord 6370  df-on 6371  df-lim 6372  df-suc 6373  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7380  df-ov 7426  df-oprab 7427  df-mpo 7428  df-om 7872  df-1st 7995  df-2nd 7996  df-frecs 8287  df-wrecs 8318  df-recs 8367  df-rdg 8406  df-1o 8462  df-2o 8463  df-oadd 8466  df-nadd 8661  df-no 27844  df-lts 27845  df-bday 27846  df-les 27946  df-slts 27988  df-cuts 27990  df-0s 28037  df-1s 28038  df-made 28057  df-old 28058  df-left 28060  df-right 28061  df-norec 28168  df-norec2 28179  df-adds 28190  df-negs 28251  df-subs 28252  df-muls 28337  df-divs 28418  df-ons 28482  df-seqs 28514  df-n0s 28544  df-nns 28545  df-zs 28609  df-2s 28641  df-exps 28643
This theorem is used by:  bdaypw2bnd  28695  z12bdaylem2  28701  z12bdaylem  28714
  Copyright terms: Public domain W3C validator