Theorem bdayfinbndcbv 28879

Description: Lemma for bdayfinbnd 28882. Change some bound variables. (Contributed by Scott Fenton, 25-Feb-2026.)

Hypotheses

Ref	Expression
bdayfinbndlem.1	⊢ (𝜑 → 𝑁 ∈ ℕ0s)
bdayfinbndlem.2	⊢ (𝜑 → ∀𝑧 ∈ No (((bday‘𝑧) ⊆ (bday‘𝑁) ∧ 0s ≤s 𝑧) → (𝑧 = 𝑁 ∨ ∃𝑥 ∈ ℕ0s ∃𝑦 ∈ ℕ0s ∃𝑝 ∈ ℕ0s (𝑧 = (𝑥 +s (𝑦 /su (2s↑s𝑝))) ∧ 𝑦 <s (2s↑s𝑝) ∧ (𝑥 +s 𝑝) <s 𝑁))))

Assertion

Ref	Expression
bdayfinbndcbv	⊢ (𝜑 → ∀𝑤 ∈ No (((bday‘𝑤) ⊆ (bday‘𝑁) ∧ 0s ≤s 𝑤) → (𝑤 = 𝑁 ∨ ∃𝑎 ∈ ℕ0s ∃𝑏 ∈ ℕ0s ∃𝑞 ∈ ℕ0s (𝑤 = (𝑎 +s (𝑏 /su (2s↑s𝑞))) ∧ 𝑏 <s (2s↑s𝑞) ∧ (𝑎 +s 𝑞) <s 𝑁))))

Distinct variable group:   𝑥,𝑦,𝑝,𝑎,𝑏,𝑞,𝑧,𝑤,𝑁

Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑧, 𝑤, 𝑞, 𝑝, 𝑎, 𝑏)

Proof of Theorem bdayfinbndcbv

Step	Hyp	Ref	Expression
1		bdayfinbndlem.2	. 2 ⊢ (𝜑 → ∀𝑧 ∈ No (((bday‘𝑧) ⊆ (bday‘𝑁) ∧ 0s ≤s 𝑧) → (𝑧 = 𝑁 ∨ ∃𝑥 ∈ ℕ0s ∃𝑦 ∈ ℕ0s ∃𝑝 ∈ ℕ0s (𝑧 = (𝑥 +s (𝑦 /su (2s↑s𝑝))) ∧ 𝑦 <s (2s↑s𝑝) ∧ (𝑥 +s 𝑝) <s 𝑁))))
2		fveq2 6905	. . . . . 6 ⊢ (𝑧 = 𝑤 → (bday‘𝑧) = (bday‘𝑤))
3	2	sseq1d 3944	. . . . 5 ⊢ (𝑧 = 𝑤 → ((bday‘𝑧) ⊆ (bday‘𝑁) ↔ (bday‘𝑤) ⊆ (bday‘𝑁)))
4		breq2 5110	. . . . 5 ⊢ (𝑧 = 𝑤 → ( 0s ≤s 𝑧 ↔ 0s ≤s 𝑤))
5	3, 4	anbi12d 644	. . . 4 ⊢ (𝑧 = 𝑤 → (((bday‘𝑧) ⊆ (bday‘𝑁) ∧ 0s ≤s 𝑧) ↔ ((bday‘𝑤) ⊆ (bday‘𝑁) ∧ 0s ≤s 𝑤)))
6		eqeq1 2767	. . . . 5 ⊢ (𝑧 = 𝑤 → (𝑧 = 𝑁 ↔ 𝑤 = 𝑁))
7		eqeq1 2767	. . . . . . . . 9 ⊢ (𝑧 = 𝑤 → (𝑧 = (𝑥 +s (𝑦 /su (2s↑s𝑝))) ↔ 𝑤 = (𝑥 +s (𝑦 /su (2s↑s𝑝)))))
8	7	3anbi1d 1469	. . . . . . . 8 ⊢ (𝑧 = 𝑤 → ((𝑧 = (𝑥 +s (𝑦 /su (2s↑s𝑝))) ∧ 𝑦 <s (2s↑s𝑝) ∧ (𝑥 +s 𝑝) <s 𝑁) ↔ (𝑤 = (𝑥 +s (𝑦 /su (2s↑s𝑝))) ∧ 𝑦 <s (2s↑s𝑝) ∧ (𝑥 +s 𝑝) <s 𝑁)))
9	8	rexbidv 3190	. . . . . . 7 ⊢ (𝑧 = 𝑤 → (∃𝑝 ∈ ℕ0s (𝑧 = (𝑥 +s (𝑦 /su (2s↑s𝑝))) ∧ 𝑦 <s (2s↑s𝑝) ∧ (𝑥 +s 𝑝) <s 𝑁) ↔ ∃𝑝 ∈ ℕ0s (𝑤 = (𝑥 +s (𝑦 /su (2s↑s𝑝))) ∧ 𝑦 <s (2s↑s𝑝) ∧ (𝑥 +s 𝑝) <s 𝑁)))
10	9	2rexbidv 3231	. . . . . 6 ⊢ (𝑧 = 𝑤 → (∃𝑥 ∈ ℕ0s ∃𝑦 ∈ ℕ0s ∃𝑝 ∈ ℕ0s (𝑧 = (𝑥 +s (𝑦 /su (2s↑s𝑝))) ∧ 𝑦 <s (2s↑s𝑝) ∧ (𝑥 +s 𝑝) <s 𝑁) ↔ ∃𝑥 ∈ ℕ0s ∃𝑦 ∈ ℕ0s ∃𝑝 ∈ ℕ0s (𝑤 = (𝑥 +s (𝑦 /su (2s↑s𝑝))) ∧ 𝑦 <s (2s↑s𝑝) ∧ (𝑥 +s 𝑝) <s 𝑁)))
11		oveq1 7447	. . . . . . . . . 10 ⊢ (𝑥 = 𝑎 → (𝑥 +s (𝑦 /su (2s↑s𝑝))) = (𝑎 +s (𝑦 /su (2s↑s𝑝))))
12	11	eqeq2d 2774	. . . . . . . . 9 ⊢ (𝑥 = 𝑎 → (𝑤 = (𝑥 +s (𝑦 /su (2s↑s𝑝))) ↔ 𝑤 = (𝑎 +s (𝑦 /su (2s↑s𝑝)))))
13		oveq1 7447	. . . . . . . . . 10 ⊢ (𝑥 = 𝑎 → (𝑥 +s 𝑝) = (𝑎 +s 𝑝))
14	13	breq1d 5116	. . . . . . . . 9 ⊢ (𝑥 = 𝑎 → ((𝑥 +s 𝑝) <s 𝑁 ↔ (𝑎 +s 𝑝) <s 𝑁))
15	12, 14	3anbi13d 1467	. . . . . . . 8 ⊢ (𝑥 = 𝑎 → ((𝑤 = (𝑥 +s (𝑦 /su (2s↑s𝑝))) ∧ 𝑦 <s (2s↑s𝑝) ∧ (𝑥 +s 𝑝) <s 𝑁) ↔ (𝑤 = (𝑎 +s (𝑦 /su (2s↑s𝑝))) ∧ 𝑦 <s (2s↑s𝑝) ∧ (𝑎 +s 𝑝) <s 𝑁)))
16	15	rexbidv 3190	. . . . . . 7 ⊢ (𝑥 = 𝑎 → (∃𝑝 ∈ ℕ0s (𝑤 = (𝑥 +s (𝑦 /su (2s↑s𝑝))) ∧ 𝑦 <s (2s↑s𝑝) ∧ (𝑥 +s 𝑝) <s 𝑁) ↔ ∃𝑝 ∈ ℕ0s (𝑤 = (𝑎 +s (𝑦 /su (2s↑s𝑝))) ∧ 𝑦 <s (2s↑s𝑝) ∧ (𝑎 +s 𝑝) <s 𝑁)))
17		oveq1 7447	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑏 → (𝑦 /su (2s↑s𝑝)) = (𝑏 /su (2s↑s𝑝)))
18	17	oveq2d 7456	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑏 → (𝑎 +s (𝑦 /su (2s↑s𝑝))) = (𝑎 +s (𝑏 /su (2s↑s𝑝))))
19	18	eqeq2d 2774	. . . . . . . . . 10 ⊢ (𝑦 = 𝑏 → (𝑤 = (𝑎 +s (𝑦 /su (2s↑s𝑝))) ↔ 𝑤 = (𝑎 +s (𝑏 /su (2s↑s𝑝)))))
20		breq1 5109	. . . . . . . . . 10 ⊢ (𝑦 = 𝑏 → (𝑦 <s (2s↑s𝑝) ↔ 𝑏 <s (2s↑s𝑝)))
21	19, 20	3anbi12d 1466	. . . . . . . . 9 ⊢ (𝑦 = 𝑏 → ((𝑤 = (𝑎 +s (𝑦 /su (2s↑s𝑝))) ∧ 𝑦 <s (2s↑s𝑝) ∧ (𝑎 +s 𝑝) <s 𝑁) ↔ (𝑤 = (𝑎 +s (𝑏 /su (2s↑s𝑝))) ∧ 𝑏 <s (2s↑s𝑝) ∧ (𝑎 +s 𝑝) <s 𝑁)))
22	21	rexbidv 3190	. . . . . . . 8 ⊢ (𝑦 = 𝑏 → (∃𝑝 ∈ ℕ0s (𝑤 = (𝑎 +s (𝑦 /su (2s↑s𝑝))) ∧ 𝑦 <s (2s↑s𝑝) ∧ (𝑎 +s 𝑝) <s 𝑁) ↔ ∃𝑝 ∈ ℕ0s (𝑤 = (𝑎 +s (𝑏 /su (2s↑s𝑝))) ∧ 𝑏 <s (2s↑s𝑝) ∧ (𝑎 +s 𝑝) <s 𝑁)))
23		oveq2 7448	. . . . . . . . . . . . 13 ⊢ (𝑝 = 𝑞 → (2s↑s𝑝) = (2s↑s𝑞))
24		oveq2 7448	. . . . . . . . . . . . 13 ⊢ ((2s↑s𝑝) = (2s↑s𝑞) → (𝑏 /su (2s↑s𝑝)) = (𝑏 /su (2s↑s𝑞)))
25	23, 24	syl 18	. . . . . . . . . . . 12 ⊢ (𝑝 = 𝑞 → (𝑏 /su (2s↑s𝑝)) = (𝑏 /su (2s↑s𝑞)))
26	25	oveq2d 7456	. . . . . . . . . . 11 ⊢ (𝑝 = 𝑞 → (𝑎 +s (𝑏 /su (2s↑s𝑝))) = (𝑎 +s (𝑏 /su (2s↑s𝑞))))
27	26	eqeq2d 2774	. . . . . . . . . 10 ⊢ (𝑝 = 𝑞 → (𝑤 = (𝑎 +s (𝑏 /su (2s↑s𝑝))) ↔ 𝑤 = (𝑎 +s (𝑏 /su (2s↑s𝑞)))))
28	23	breq2d 5118	. . . . . . . . . 10 ⊢ (𝑝 = 𝑞 → (𝑏 <s (2s↑s𝑝) ↔ 𝑏 <s (2s↑s𝑞)))
29		oveq2 7448	. . . . . . . . . . 11 ⊢ (𝑝 = 𝑞 → (𝑎 +s 𝑝) = (𝑎 +s 𝑞))
30	29	breq1d 5116	. . . . . . . . . 10 ⊢ (𝑝 = 𝑞 → ((𝑎 +s 𝑝) <s 𝑁 ↔ (𝑎 +s 𝑞) <s 𝑁))
31	27, 28, 30	3anbi123d 1465	. . . . . . . . 9 ⊢ (𝑝 = 𝑞 → ((𝑤 = (𝑎 +s (𝑏 /su (2s↑s𝑝))) ∧ 𝑏 <s (2s↑s𝑝) ∧ (𝑎 +s 𝑝) <s 𝑁) ↔ (𝑤 = (𝑎 +s (𝑏 /su (2s↑s𝑞))) ∧ 𝑏 <s (2s↑s𝑞) ∧ (𝑎 +s 𝑞) <s 𝑁)))
32	31	cbvrexvw 3245	. . . . . . . 8 ⊢ (∃𝑝 ∈ ℕ0s (𝑤 = (𝑎 +s (𝑏 /su (2s↑s𝑝))) ∧ 𝑏 <s (2s↑s𝑝) ∧ (𝑎 +s 𝑝) <s 𝑁) ↔ ∃𝑞 ∈ ℕ0s (𝑤 = (𝑎 +s (𝑏 /su (2s↑s𝑞))) ∧ 𝑏 <s (2s↑s𝑞) ∧ (𝑎 +s 𝑞) <s 𝑁))
33	22, 32	bitrdi 290	. . . . . . 7 ⊢ (𝑦 = 𝑏 → (∃𝑝 ∈ ℕ0s (𝑤 = (𝑎 +s (𝑦 /su (2s↑s𝑝))) ∧ 𝑦 <s (2s↑s𝑝) ∧ (𝑎 +s 𝑝) <s 𝑁) ↔ ∃𝑞 ∈ ℕ0s (𝑤 = (𝑎 +s (𝑏 /su (2s↑s𝑞))) ∧ 𝑏 <s (2s↑s𝑞) ∧ (𝑎 +s 𝑞) <s 𝑁)))
34	16, 33	cbvrex2vw 3249	. . . . . 6 ⊢ (∃𝑥 ∈ ℕ0s ∃𝑦 ∈ ℕ0s ∃𝑝 ∈ ℕ0s (𝑤 = (𝑥 +s (𝑦 /su (2s↑s𝑝))) ∧ 𝑦 <s (2s↑s𝑝) ∧ (𝑥 +s 𝑝) <s 𝑁) ↔ ∃𝑎 ∈ ℕ0s ∃𝑏 ∈ ℕ0s ∃𝑞 ∈ ℕ0s (𝑤 = (𝑎 +s (𝑏 /su (2s↑s𝑞))) ∧ 𝑏 <s (2s↑s𝑞) ∧ (𝑎 +s 𝑞) <s 𝑁))
35	10, 34	bitrdi 290	. . . . 5 ⊢ (𝑧 = 𝑤 → (∃𝑥 ∈ ℕ0s ∃𝑦 ∈ ℕ0s ∃𝑝 ∈ ℕ0s (𝑧 = (𝑥 +s (𝑦 /su (2s↑s𝑝))) ∧ 𝑦 <s (2s↑s𝑝) ∧ (𝑥 +s 𝑝) <s 𝑁) ↔ ∃𝑎 ∈ ℕ0s ∃𝑏 ∈ ℕ0s ∃𝑞 ∈ ℕ0s (𝑤 = (𝑎 +s (𝑏 /su (2s↑s𝑞))) ∧ 𝑏 <s (2s↑s𝑞) ∧ (𝑎 +s 𝑞) <s 𝑁)))
36	6, 35	orbi12d 932	. . . 4 ⊢ (𝑧 = 𝑤 → ((𝑧 = 𝑁 ∨ ∃𝑥 ∈ ℕ0s ∃𝑦 ∈ ℕ0s ∃𝑝 ∈ ℕ0s (𝑧 = (𝑥 +s (𝑦 /su (2s↑s𝑝))) ∧ 𝑦 <s (2s↑s𝑝) ∧ (𝑥 +s 𝑝) <s 𝑁)) ↔ (𝑤 = 𝑁 ∨ ∃𝑎 ∈ ℕ0s ∃𝑏 ∈ ℕ0s ∃𝑞 ∈ ℕ0s (𝑤 = (𝑎 +s (𝑏 /su (2s↑s𝑞))) ∧ 𝑏 <s (2s↑s𝑞) ∧ (𝑎 +s 𝑞) <s 𝑁))))
37	5, 36	imbi12d 347	. . 3 ⊢ (𝑧 = 𝑤 → ((((bday‘𝑧) ⊆ (bday‘𝑁) ∧ 0s ≤s 𝑧) → (𝑧 = 𝑁 ∨ ∃𝑥 ∈ ℕ0s ∃𝑦 ∈ ℕ0s ∃𝑝 ∈ ℕ0s (𝑧 = (𝑥 +s (𝑦 /su (2s↑s𝑝))) ∧ 𝑦 <s (2s↑s𝑝) ∧ (𝑥 +s 𝑝) <s 𝑁))) ↔ (((bday‘𝑤) ⊆ (bday‘𝑁) ∧ 0s ≤s 𝑤) → (𝑤 = 𝑁 ∨ ∃𝑎 ∈ ℕ0s ∃𝑏 ∈ ℕ0s ∃𝑞 ∈ ℕ0s (𝑤 = (𝑎 +s (𝑏 /su (2s↑s𝑞))) ∧ 𝑏 <s (2s↑s𝑞) ∧ (𝑎 +s 𝑞) <s 𝑁)))))
38	37	cbvralvw 3244	. 2 ⊢ (∀𝑧 ∈ No (((bday‘𝑧) ⊆ (bday‘𝑁) ∧ 0s ≤s 𝑧) → (𝑧 = 𝑁 ∨ ∃𝑥 ∈ ℕ0s ∃𝑦 ∈ ℕ0s ∃𝑝 ∈ ℕ0s (𝑧 = (𝑥 +s (𝑦 /su (2s↑s𝑝))) ∧ 𝑦 <s (2s↑s𝑝) ∧ (𝑥 +s 𝑝) <s 𝑁))) ↔ ∀𝑤 ∈ No (((bday‘𝑤) ⊆ (bday‘𝑁) ∧ 0s ≤s 𝑤) → (𝑤 = 𝑁 ∨ ∃𝑎 ∈ ℕ0s ∃𝑏 ∈ ℕ0s ∃𝑞 ∈ ℕ0s (𝑤 = (𝑎 +s (𝑏 /su (2s↑s𝑞))) ∧ 𝑏 <s (2s↑s𝑞) ∧ (𝑎 +s 𝑞) <s 𝑁))))
39	1, 38	sylib 221	1 ⊢ (𝜑 → ∀𝑤 ∈ No (((bday‘𝑤) ⊆ (bday‘𝑁) ∧ 0s ≤s 𝑤) → (𝑤 = 𝑁 ∨ ∃𝑎 ∈ ℕ0s ∃𝑏 ∈ ℕ0s ∃𝑞 ∈ ℕ0s (𝑤 = (𝑎 +s (𝑏 /su (2s↑s𝑞))) ∧ 𝑏 <s (2s↑s𝑞) ∧ (𝑎 +s 𝑞) <s 𝑁))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090   ⊆ wss 3900   class class class wbr 5106  ‘cfv 6555  (class class class)co 7440  Nocsur 28024   <s clts 28025  bdaycbday 28026   ≤s cles 28128   0_s c0s 28218   +_s cadds 28372   /_su cdivs 28600  ℕ_0scn0s 28725  2_sc2s 28823  ↑_scexps 28825

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-iota 6509  df-fv 6563  df-ov 7443

This theorem is used by:  bdayfinbndlem2  28881