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

Theorem bdaypw2bnd 28442
Description: Birthday bounding rule for non-negative dyadic rationals. (Contributed by Scott Fenton, 25-Feb-2026.)
Hypotheses
Ref Expression
bdaypw2bnd.1 (𝜑𝑁 ∈ ℕ0s)
bdaypw2bnd.2 (𝜑𝑋 ∈ ℕ0s)
bdaypw2bnd.3 (𝜑𝑌 ∈ ℕ0s)
bdaypw2bnd.4 (𝜑𝑃 ∈ ℕ0s)
bdaypw2bnd.5 (𝜑𝑌 <s (2ss𝑃))
bdaypw2bnd.6 (𝜑 → (𝑋 +s 𝑃) <s 𝑁)
Assertion
Ref Expression
bdaypw2bnd (𝜑 → ( bday ‘(𝑋 +s (𝑌 /su (2ss𝑃)))) ⊆ ( bday 𝑁))

Proof of Theorem bdaypw2bnd
StepHypRef Expression
1 bdaypw2bnd.2 . . . 4 (𝜑𝑋 ∈ ℕ0s)
21n0snod 28304 . . 3 (𝜑𝑋 No )
3 bdaypw2bnd.3 . . . . 5 (𝜑𝑌 ∈ ℕ0s)
43n0snod 28304 . . . 4 (𝜑𝑌 No )
5 bdaypw2bnd.4 . . . 4 (𝜑𝑃 ∈ ℕ0s)
64, 5pw2divscld 28416 . . 3 (𝜑 → (𝑌 /su (2ss𝑃)) ∈ No )
7 addsbday 27998 . . 3 ((𝑋 No ∧ (𝑌 /su (2ss𝑃)) ∈ No ) → ( bday ‘(𝑋 +s (𝑌 /su (2ss𝑃)))) ⊆ (( bday 𝑋) +no ( bday ‘(𝑌 /su (2ss𝑃)))))
82, 6, 7syl2anc 585 . 2 (𝜑 → ( bday ‘(𝑋 +s (𝑌 /su (2ss𝑃)))) ⊆ (( bday 𝑋) +no ( bday ‘(𝑌 /su (2ss𝑃)))))
9 bdaypw2bnd.5 . . . . 5 (𝜑𝑌 <s (2ss𝑃))
10 bdaypw2n0sbnd 28441 . . . . 5 ((𝑌 ∈ ℕ0s𝑃 ∈ ℕ0s𝑌 <s (2ss𝑃)) → ( bday ‘(𝑌 /su (2ss𝑃))) ⊆ suc ( bday 𝑃))
113, 5, 9, 10syl3anc 1374 . . . 4 (𝜑 → ( bday ‘(𝑌 /su (2ss𝑃))) ⊆ suc ( bday 𝑃))
12 bdayelon 27750 . . . . 5 ( bday ‘(𝑌 /su (2ss𝑃))) ∈ On
13 bdayelon 27750 . . . . . 6 ( bday 𝑃) ∈ On
1413onsuci 7781 . . . . 5 suc ( bday 𝑃) ∈ On
15 bdayelon 27750 . . . . 5 ( bday 𝑋) ∈ On
16 naddss2 8618 . . . . 5 ((( bday ‘(𝑌 /su (2ss𝑃))) ∈ On ∧ suc ( bday 𝑃) ∈ On ∧ ( bday 𝑋) ∈ On) → (( bday ‘(𝑌 /su (2ss𝑃))) ⊆ suc ( bday 𝑃) ↔ (( bday 𝑋) +no ( bday ‘(𝑌 /su (2ss𝑃)))) ⊆ (( bday 𝑋) +no suc ( bday 𝑃))))
1712, 14, 15, 16mp3an 1464 . . . 4 (( bday ‘(𝑌 /su (2ss𝑃))) ⊆ suc ( bday 𝑃) ↔ (( bday 𝑋) +no ( bday ‘(𝑌 /su (2ss𝑃)))) ⊆ (( bday 𝑋) +no suc ( bday 𝑃)))
1811, 17sylib 218 . . 3 (𝜑 → (( bday 𝑋) +no ( bday ‘(𝑌 /su (2ss𝑃)))) ⊆ (( bday 𝑋) +no suc ( bday 𝑃)))
19 bdayn0p1 28346 . . . . . 6 (𝑃 ∈ ℕ0s → ( bday ‘(𝑃 +s 1s )) = suc ( bday 𝑃))
205, 19syl 17 . . . . 5 (𝜑 → ( bday ‘(𝑃 +s 1s )) = suc ( bday 𝑃))
2120oveq2d 7374 . . . 4 (𝜑 → (( bday 𝑋) +no ( bday ‘(𝑃 +s 1s ))) = (( bday 𝑋) +no suc ( bday 𝑃)))
22 n0ons 28314 . . . . . . 7 (𝑋 ∈ ℕ0s𝑋 ∈ Ons)
231, 22syl 17 . . . . . 6 (𝜑𝑋 ∈ Ons)
24 peano2n0s 28309 . . . . . . . 8 (𝑃 ∈ ℕ0s → (𝑃 +s 1s ) ∈ ℕ0s)
255, 24syl 17 . . . . . . 7 (𝜑 → (𝑃 +s 1s ) ∈ ℕ0s)
26 n0ons 28314 . . . . . . 7 ((𝑃 +s 1s ) ∈ ℕ0s → (𝑃 +s 1s ) ∈ Ons)
2725, 26syl 17 . . . . . 6 (𝜑 → (𝑃 +s 1s ) ∈ Ons)
28 addsonbday 28258 . . . . . 6 ((𝑋 ∈ Ons ∧ (𝑃 +s 1s ) ∈ Ons) → ( bday ‘(𝑋 +s (𝑃 +s 1s ))) = (( bday 𝑋) +no ( bday ‘(𝑃 +s 1s ))))
2923, 27, 28syl2anc 585 . . . . 5 (𝜑 → ( bday ‘(𝑋 +s (𝑃 +s 1s ))) = (( bday 𝑋) +no ( bday ‘(𝑃 +s 1s ))))
30 bdaypw2bnd.6 . . . . . 6 (𝜑 → (𝑋 +s 𝑃) <s 𝑁)
31 bdaypw2bnd.1 . . . . . . . . . 10 (𝜑𝑁 ∈ ℕ0s)
32 n0ons 28314 . . . . . . . . . 10 (𝑁 ∈ ℕ0s𝑁 ∈ Ons)
3331, 32syl 17 . . . . . . . . 9 (𝜑𝑁 ∈ Ons)
34 n0addscl 28322 . . . . . . . . . . 11 ((𝑋 ∈ ℕ0s ∧ (𝑃 +s 1s ) ∈ ℕ0s) → (𝑋 +s (𝑃 +s 1s )) ∈ ℕ0s)
351, 25, 34syl2anc 585 . . . . . . . . . 10 (𝜑 → (𝑋 +s (𝑃 +s 1s )) ∈ ℕ0s)
36 n0ons 28314 . . . . . . . . . 10 ((𝑋 +s (𝑃 +s 1s )) ∈ ℕ0s → (𝑋 +s (𝑃 +s 1s )) ∈ Ons)
3735, 36syl 17 . . . . . . . . 9 (𝜑 → (𝑋 +s (𝑃 +s 1s )) ∈ Ons)
38 onslt 28246 . . . . . . . . 9 ((𝑁 ∈ Ons ∧ (𝑋 +s (𝑃 +s 1s )) ∈ Ons) → (𝑁 <s (𝑋 +s (𝑃 +s 1s )) ↔ ( bday 𝑁) ∈ ( bday ‘(𝑋 +s (𝑃 +s 1s )))))
3933, 37, 38syl2anc 585 . . . . . . . 8 (𝜑 → (𝑁 <s (𝑋 +s (𝑃 +s 1s )) ↔ ( bday 𝑁) ∈ ( bday ‘(𝑋 +s (𝑃 +s 1s )))))
4039notbid 318 . . . . . . 7 (𝜑 → (¬ 𝑁 <s (𝑋 +s (𝑃 +s 1s )) ↔ ¬ ( bday 𝑁) ∈ ( bday ‘(𝑋 +s (𝑃 +s 1s )))))
41 n0addscl 28322 . . . . . . . . . 10 ((𝑋 ∈ ℕ0s𝑃 ∈ ℕ0s) → (𝑋 +s 𝑃) ∈ ℕ0s)
421, 5, 41syl2anc 585 . . . . . . . . 9 (𝜑 → (𝑋 +s 𝑃) ∈ ℕ0s)
43 n0sltp1le 28342 . . . . . . . . 9 (((𝑋 +s 𝑃) ∈ ℕ0s𝑁 ∈ ℕ0s) → ((𝑋 +s 𝑃) <s 𝑁 ↔ ((𝑋 +s 𝑃) +s 1s ) ≤s 𝑁))
4442, 31, 43syl2anc 585 . . . . . . . 8 (𝜑 → ((𝑋 +s 𝑃) <s 𝑁 ↔ ((𝑋 +s 𝑃) +s 1s ) ≤s 𝑁))
455n0snod 28304 . . . . . . . . . 10 (𝜑𝑃 No )
46 1sno 27806 . . . . . . . . . . 11 1s No
4746a1i 11 . . . . . . . . . 10 (𝜑 → 1s No )
482, 45, 47addsassd 27986 . . . . . . . . 9 (𝜑 → ((𝑋 +s 𝑃) +s 1s ) = (𝑋 +s (𝑃 +s 1s )))
4948breq1d 5107 . . . . . . . 8 (𝜑 → (((𝑋 +s 𝑃) +s 1s ) ≤s 𝑁 ↔ (𝑋 +s (𝑃 +s 1s )) ≤s 𝑁))
5035n0snod 28304 . . . . . . . . 9 (𝜑 → (𝑋 +s (𝑃 +s 1s )) ∈ No )
5131n0snod 28304 . . . . . . . . 9 (𝜑𝑁 No )
52 slenlt 27722 . . . . . . . . 9 (((𝑋 +s (𝑃 +s 1s )) ∈ No 𝑁 No ) → ((𝑋 +s (𝑃 +s 1s )) ≤s 𝑁 ↔ ¬ 𝑁 <s (𝑋 +s (𝑃 +s 1s ))))
5350, 51, 52syl2anc 585 . . . . . . . 8 (𝜑 → ((𝑋 +s (𝑃 +s 1s )) ≤s 𝑁 ↔ ¬ 𝑁 <s (𝑋 +s (𝑃 +s 1s ))))
5444, 49, 533bitrd 305 . . . . . . 7 (𝜑 → ((𝑋 +s 𝑃) <s 𝑁 ↔ ¬ 𝑁 <s (𝑋 +s (𝑃 +s 1s ))))
55 bdayelon 27750 . . . . . . . . 9 ( bday ‘(𝑋 +s (𝑃 +s 1s ))) ∈ On
56 bdayelon 27750 . . . . . . . . 9 ( bday 𝑁) ∈ On
57 ontri1 6350 . . . . . . . . 9 ((( bday ‘(𝑋 +s (𝑃 +s 1s ))) ∈ On ∧ ( bday 𝑁) ∈ On) → (( bday ‘(𝑋 +s (𝑃 +s 1s ))) ⊆ ( bday 𝑁) ↔ ¬ ( bday 𝑁) ∈ ( bday ‘(𝑋 +s (𝑃 +s 1s )))))
5855, 56, 57mp2an 693 . . . . . . . 8 (( bday ‘(𝑋 +s (𝑃 +s 1s ))) ⊆ ( bday 𝑁) ↔ ¬ ( bday 𝑁) ∈ ( bday ‘(𝑋 +s (𝑃 +s 1s ))))
5958a1i 11 . . . . . . 7 (𝜑 → (( bday ‘(𝑋 +s (𝑃 +s 1s ))) ⊆ ( bday 𝑁) ↔ ¬ ( bday 𝑁) ∈ ( bday ‘(𝑋 +s (𝑃 +s 1s )))))
6040, 54, 593bitr4d 311 . . . . . 6 (𝜑 → ((𝑋 +s 𝑃) <s 𝑁 ↔ ( bday ‘(𝑋 +s (𝑃 +s 1s ))) ⊆ ( bday 𝑁)))
6130, 60mpbid 232 . . . . 5 (𝜑 → ( bday ‘(𝑋 +s (𝑃 +s 1s ))) ⊆ ( bday 𝑁))
6229, 61eqsstrrd 3968 . . . 4 (𝜑 → (( bday 𝑋) +no ( bday ‘(𝑃 +s 1s ))) ⊆ ( bday 𝑁))
6321, 62eqsstrrd 3968 . . 3 (𝜑 → (( bday 𝑋) +no suc ( bday 𝑃)) ⊆ ( bday 𝑁))
6418, 63sstrd 3943 . 2 (𝜑 → (( bday 𝑋) +no ( bday ‘(𝑌 /su (2ss𝑃)))) ⊆ ( bday 𝑁))
658, 64sstrd 3943 1 (𝜑 → ( bday ‘(𝑋 +s (𝑌 /su (2ss𝑃)))) ⊆ ( bday 𝑁))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206   = wceq 1542  wcel 2114  wss 3900   class class class wbr 5097  Oncon0 6316  suc csuc 6318  cfv 6491  (class class class)co 7358   +no cnadd 8593   No csur 27609   <s cslt 27610   bday cbday 27611   ≤s csle 27714   1s c1s 27802   +s cadds 27939   /su cdivs 28167  Onscons 28230  0scnn0s 28291  2sc2s 28387  scexps 28389
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 2183  ax-ext 2707  ax-rep 5223  ax-sep 5240  ax-nul 5250  ax-pow 5309  ax-pr 5376  ax-un 7680  ax-dc 10358
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 2538  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2810  df-nfc 2884  df-ne 2932  df-ral 3051  df-rex 3060  df-rmo 3349  df-reu 3350  df-rab 3399  df-v 3441  df-sbc 3740  df-csb 3849  df-dif 3903  df-un 3905  df-in 3907  df-ss 3917  df-pss 3920  df-nul 4285  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-tp 4584  df-op 4586  df-ot 4588  df-uni 4863  df-int 4902  df-iun 4947  df-br 5098  df-opab 5160  df-mpt 5179  df-tr 5205  df-id 5518  df-eprel 5523  df-po 5531  df-so 5532  df-fr 5576  df-se 5577  df-we 5578  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-pred 6258  df-ord 6319  df-on 6320  df-lim 6321  df-suc 6322  df-iota 6447  df-fun 6493  df-fn 6494  df-f 6495  df-f1 6496  df-fo 6497  df-f1o 6498  df-fv 6499  df-isom 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 27612  df-slt 27613  df-bday 27614  df-sle 27715  df-sslt 27756  df-scut 27758  df-0s 27803  df-1s 27804  df-made 27823  df-old 27824  df-left 27826  df-right 27827  df-norec 27918  df-norec2 27929  df-adds 27940  df-negs 28001  df-subs 28002  df-muls 28087  df-divs 28168  df-ons 28231  df-seqs 28263  df-n0s 28293  df-nns 28294  df-zs 28356  df-2s 28388  df-exps 28390
This theorem is referenced by:  bdayfinbndlem1  28444
  Copyright terms: Public domain W3C validator