Theorem upciclem1 50001

Description: Lemma for upcic 50005, upeu 50006, and upeu2 50007. (Contributed by Zhi Wang, 16-Sep-2025.) (Proof shortened by Zhi Wang, 5-Nov-2025.)

Hypotheses

Ref	Expression
upciclem1.1	⊢ (𝜑 → ∀𝑦 ∈ 𝐵 ∀𝑛 ∈ (𝑍𝐽(𝐹‘𝑦))∃!𝑘 ∈ (𝑋𝐻𝑦)𝑛 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑀))
upciclem1.y	⊢ (𝜑 → 𝑌 ∈ 𝐵)
upciclem1.n	⊢ (𝜑 → 𝑁 ∈ (𝑍𝐽(𝐹‘𝑌)))

Assertion

Ref	Expression
upciclem1	⊢ (𝜑 → ∃!𝑙 ∈ (𝑋𝐻𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑙)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀))

Distinct variable groups:   𝑦,𝐵   𝑘,𝐹   𝐹,𝑙   𝑛,𝐹,𝑦,𝑘   𝑘,𝐺   𝐺,𝑙   𝑛,𝐺,𝑦   𝑘,𝐻   𝐻,𝑙   𝑛,𝐻,𝑦   𝑛,𝐽,𝑦   𝑘,𝑀   𝑀,𝑙   𝑛,𝑀,𝑦   𝑘,𝑁   𝑁,𝑙   𝑛,𝑁   𝑘,𝑂   𝑂,𝑙   𝑛,𝑂,𝑦   𝑘,𝑋   𝑋,𝑙   𝑛,𝑋,𝑦   𝑘,𝑌   𝑌,𝑙   𝑛,𝑌,𝑦   𝑘,𝑍   𝑍,𝑙   𝑛,𝑍,𝑦

Allowed substitution hints:   𝜑(𝑦, 𝑘, 𝑛, 𝑙)   𝐵(𝑘, 𝑛, 𝑙)   𝐽(𝑘, 𝑙)   𝑁(𝑦)

Proof of Theorem upciclem1

Dummy variable 𝑚 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqeq1 2769	. . . 4 ⊢ (𝑛 = 𝑁 → (𝑛 = (((𝑋𝐺𝑌)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀) ↔ 𝑁 = (((𝑋𝐺𝑌)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀)))
2	1	reubidv 3387	. . 3 ⊢ (𝑛 = 𝑁 → (∃!𝑘 ∈ (𝑋𝐻𝑌)𝑛 = (((𝑋𝐺𝑌)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀) ↔ ∃!𝑘 ∈ (𝑋𝐻𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀)))
3		fveq2 6885	. . . . . 6 ⊢ (𝑦 = 𝑌 → (𝐹‘𝑦) = (𝐹‘𝑌))
4	3	oveq2d 7435	. . . . 5 ⊢ (𝑦 = 𝑌 → (𝑍𝐽(𝐹‘𝑦)) = (𝑍𝐽(𝐹‘𝑌)))
5		oveq2 7427	. . . . . 6 ⊢ (𝑦 = 𝑌 → (𝑋𝐻𝑦) = (𝑋𝐻𝑌))
6	3	oveq2d 7435	. . . . . . . 8 ⊢ (𝑦 = 𝑌 → (⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦)) = (⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌)))
7		oveq2 7427	. . . . . . . . 9 ⊢ (𝑦 = 𝑌 → (𝑋𝐺𝑦) = (𝑋𝐺𝑌))
8	7	fveq1d 6887	. . . . . . . 8 ⊢ (𝑦 = 𝑌 → ((𝑋𝐺𝑦)‘𝑘) = ((𝑋𝐺𝑌)‘𝑘))
9		eqidd 2766	. . . . . . . 8 ⊢ (𝑦 = 𝑌 → 𝑀 = 𝑀)
10	6, 8, 9	oveq123d 7440	. . . . . . 7 ⊢ (𝑦 = 𝑌 → (((𝑋𝐺𝑦)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑀) = (((𝑋𝐺𝑌)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀))
11	10	eqeq2d 2776	. . . . . 6 ⊢ (𝑦 = 𝑌 → (𝑛 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑀) ↔ 𝑛 = (((𝑋𝐺𝑌)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀)))
12	5, 11	reueqbidv 3407	. . . . 5 ⊢ (𝑦 = 𝑌 → (∃!𝑘 ∈ (𝑋𝐻𝑦)𝑛 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑀) ↔ ∃!𝑘 ∈ (𝑋𝐻𝑌)𝑛 = (((𝑋𝐺𝑌)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀)))
13	4, 12	raleqbidv 3340	. . . 4 ⊢ (𝑦 = 𝑌 → (∀𝑛 ∈ (𝑍𝐽(𝐹‘𝑦))∃!𝑘 ∈ (𝑋𝐻𝑦)𝑛 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑀) ↔ ∀𝑛 ∈ (𝑍𝐽(𝐹‘𝑌))∃!𝑘 ∈ (𝑋𝐻𝑌)𝑛 = (((𝑋𝐺𝑌)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀)))
14		upciclem1.1	. . . 4 ⊢ (𝜑 → ∀𝑦 ∈ 𝐵 ∀𝑛 ∈ (𝑍𝐽(𝐹‘𝑦))∃!𝑘 ∈ (𝑋𝐻𝑦)𝑛 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑀))
15		upciclem1.y	. . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
16	13, 14, 15	rspcdva 3584	. . 3 ⊢ (𝜑 → ∀𝑛 ∈ (𝑍𝐽(𝐹‘𝑌))∃!𝑘 ∈ (𝑋𝐻𝑌)𝑛 = (((𝑋𝐺𝑌)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀))
17		upciclem1.n	. . 3 ⊢ (𝜑 → 𝑁 ∈ (𝑍𝐽(𝐹‘𝑌)))
18	2, 16, 17	rspcdva 3584	. 2 ⊢ (𝜑 → ∃!𝑘 ∈ (𝑋𝐻𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀))
19		fveq2 6885	. . . . . 6 ⊢ (𝑘 = 𝑚 → ((𝑋𝐺𝑌)‘𝑘) = ((𝑋𝐺𝑌)‘𝑚))
20	19	oveq1d 7434	. . . . 5 ⊢ (𝑘 = 𝑚 → (((𝑋𝐺𝑌)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀) = (((𝑋𝐺𝑌)‘𝑚)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀))
21	20	eqeq2d 2776	. . . 4 ⊢ (𝑘 = 𝑚 → (𝑁 = (((𝑋𝐺𝑌)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀) ↔ 𝑁 = (((𝑋𝐺𝑌)‘𝑚)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀)))
22	21	cbvreuvw 3393	. . 3 ⊢ (∃!𝑘 ∈ (𝑋𝐻𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀) ↔ ∃!𝑚 ∈ (𝑋𝐻𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑚)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀))
23		fveq2 6885	. . . . . 6 ⊢ (𝑚 = 𝑙 → ((𝑋𝐺𝑌)‘𝑚) = ((𝑋𝐺𝑌)‘𝑙))
24	23	oveq1d 7434	. . . . 5 ⊢ (𝑚 = 𝑙 → (((𝑋𝐺𝑌)‘𝑚)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀) = (((𝑋𝐺𝑌)‘𝑙)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀))
25	24	eqeq2d 2776	. . . 4 ⊢ (𝑚 = 𝑙 → (𝑁 = (((𝑋𝐺𝑌)‘𝑚)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀) ↔ 𝑁 = (((𝑋𝐺𝑌)‘𝑙)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀)))
26	25	cbvreuvw 3393	. . 3 ⊢ (∃!𝑚 ∈ (𝑋𝐻𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑚)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀) ↔ ∃!𝑙 ∈ (𝑋𝐻𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑙)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀))
27	22, 26	bitri 278	. 2 ⊢ (∃!𝑘 ∈ (𝑋𝐻𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀) ↔ ∃!𝑙 ∈ (𝑋𝐻𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑙)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀))
28	18, 27	sylib 221	1 ⊢ (𝜑 → ∃!𝑙 ∈ (𝑋𝐻𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑙)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2146  ∀wral 3081  ∃!wreu 3369  ⟨cop 4597  ‘cfv 6540  (class class class)co 7419

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-ext 2737

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 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3082  df-reu 3372  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-iota 6496  df-fv 6548  df-ov 7422

This theorem is used by:  upciclem3  50003  upciclem4  50004  upeu  50006  upeu2  50007