Users' Mathboxes Mathbox for Zhi Wang < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  upciclem1 Structured version   Visualization version   GIF version

Theorem upciclem1 50390
Description: Lemma for upcic 50394, upeu 50395, and upeu2 50396. (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.
StepHypRef Expression
1 eqeq1 2764 . . . 4 (𝑛 = 𝑁 → (𝑛 = (((𝑋𝐺𝑌)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀) ↔ 𝑁 = (((𝑋𝐺𝑌)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀)))
21reubidv 3381 . . 3 (𝑛 = 𝑁 → (∃!𝑘 ∈ (𝑋𝐻𝑌)𝑛 = (((𝑋𝐺𝑌)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀) ↔ ∃!𝑘 ∈ (𝑋𝐻𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀)))
3 fveq2 6890 . . . . . 6 (𝑦 = 𝑌 → (𝐹‘𝑦) = (𝐹‘𝑌))
43oveq2d 7440 . . . . 5 (𝑦 = 𝑌 → (𝑍𝐽(𝐹‘𝑦)) = (𝑍𝐽(𝐹‘𝑌)))
5 oveq2 7432 . . . . . 6 (𝑦 = 𝑌 → (𝑋𝐻𝑦) = (𝑋𝐻𝑌))
63oveq2d 7440 . . . . . . . 8 (𝑦 = 𝑌 → (⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦)) = (⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌)))
7 oveq2 7432 . . . . . . . . 9 (𝑦 = 𝑌 → (𝑋𝐺𝑦) = (𝑋𝐺𝑌))
87fveq1d 6892 . . . . . . . 8 (𝑦 = 𝑌 → ((𝑋𝐺𝑦)‘𝑘) = ((𝑋𝐺𝑌)‘𝑘))
9 eqidd 2761 . . . . . . . 8 (𝑦 = 𝑌 → 𝑀 = 𝑀)
106, 8, 9oveq123d 7445 . . . . . . 7 (𝑦 = 𝑌 → (((𝑋𝐺𝑦)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑀) = (((𝑋𝐺𝑌)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀))
1110eqeq2d 2771 . . . . . 6 (𝑦 = 𝑌 → (𝑛 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑀) ↔ 𝑛 = (((𝑋𝐺𝑌)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀)))
125, 11reueqbidv 3401 . . . . 5 (𝑦 = 𝑌 → (∃!𝑘 ∈ (𝑋𝐻𝑦)𝑛 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑀) ↔ ∃!𝑘 ∈ (𝑋𝐻𝑌)𝑛 = (((𝑋𝐺𝑌)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀)))
134, 12raleqbidv 3334 . . . 4 (𝑦 = 𝑌 → (∀𝑛 ∈ (𝑍𝐽(𝐹‘𝑦))∃!𝑘 ∈ (𝑋𝐻𝑦)𝑛 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑀) ↔ ∀𝑛 ∈ (𝑍𝐽(𝐹‘𝑌))∃!𝑘 ∈ (𝑋𝐻𝑌)𝑛 = (((𝑋𝐺𝑌)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀)))
14 upciclem1.1 . . . 4 (𝜑 → ∀𝑦 ∈ 𝐵 ∀𝑛 ∈ (𝑍𝐽(𝐹‘𝑦))∃!𝑘 ∈ (𝑋𝐻𝑦)𝑛 = (((𝑋𝐺𝑦)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑦))𝑀))
15 upciclem1.y . . . 4 (𝜑 → 𝑌 ∈ 𝐵)
1613, 14, 15rspcdva 3577 . . 3 (𝜑 → ∀𝑛 ∈ (𝑍𝐽(𝐹‘𝑌))∃!𝑘 ∈ (𝑋𝐻𝑌)𝑛 = (((𝑋𝐺𝑌)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀))
17 upciclem1.n . . 3 (𝜑 → 𝑁 ∈ (𝑍𝐽(𝐹‘𝑌)))
182, 16, 17rspcdva 3577 . 2 (𝜑 → ∃!𝑘 ∈ (𝑋𝐻𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀))
19 fveq2 6890 . . . . . 6 (𝑘 = 𝑚 → ((𝑋𝐺𝑌)‘𝑘) = ((𝑋𝐺𝑌)‘𝑚))
2019oveq1d 7439 . . . . 5 (𝑘 = 𝑚 → (((𝑋𝐺𝑌)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀) = (((𝑋𝐺𝑌)‘𝑚)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀))
2120eqeq2d 2771 . . . 4 (𝑘 = 𝑚 → (𝑁 = (((𝑋𝐺𝑌)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀) ↔ 𝑁 = (((𝑋𝐺𝑌)‘𝑚)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀)))
2221cbvreuvw 3387 . . 3 (∃!𝑘 ∈ (𝑋𝐻𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀) ↔ ∃!𝑚 ∈ (𝑋𝐻𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑚)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀))
23 fveq2 6890 . . . . . 6 (𝑚 = 𝑙 → ((𝑋𝐺𝑌)‘𝑚) = ((𝑋𝐺𝑌)‘𝑙))
2423oveq1d 7439 . . . . 5 (𝑚 = 𝑙 → (((𝑋𝐺𝑌)‘𝑚)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀) = (((𝑋𝐺𝑌)‘𝑙)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀))
2524eqeq2d 2771 . . . 4 (𝑚 = 𝑙 → (𝑁 = (((𝑋𝐺𝑌)‘𝑚)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀) ↔ 𝑁 = (((𝑋𝐺𝑌)‘𝑙)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀)))
2625cbvreuvw 3387 . . 3 (∃!𝑚 ∈ (𝑋𝐻𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑚)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀) ↔ ∃!𝑙 ∈ (𝑋𝐻𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑙)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀))
2722, 26bitri 278 . 2 (∃!𝑘 ∈ (𝑋𝐻𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑘)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀) ↔ ∃!𝑙 ∈ (𝑋𝐻𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑙)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀))
2818, 27sylib 221 1 (𝜑 → ∃!𝑙 ∈ (𝑋𝐻𝑌)𝑁 = (((𝑋𝐺𝑌)‘𝑙)(⟨𝑍, (𝐹‘𝑋)⟩𝑂(𝐹‘𝑌))𝑀))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ∃!wreu 3363  ⟨cop 4834  ‘cfv 6543  (class class class)co 7424
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-reu 3366  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-iota 6497  df-fv 6551  df-ov 7427
This theorem is used by:  upciclem3  50392  upciclem4  50393  upeu  50395  upeu2  50396
  Copyright terms: Public domain W3C validator