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

Theorem qliftfuns 8811
Description: The function 𝐹 is the unique function defined by 𝐹‘[𝑥] = 𝐴, provided that the well-definedness condition holds. (Contributed by Mario Carneiro, 23-Dec-2016.) (Revised by AV, 3-Aug-2024.)
Hypotheses
Ref Expression
qlift.1 𝐹 = ran (𝑥𝑋 ↦ ⟨[𝑥]𝑅, 𝐴⟩)
qlift.2 ((𝜑𝑥𝑋) → 𝐴𝑌)
qlift.3 (𝜑𝑅 Er 𝑋)
qlift.4 (𝜑𝑋𝑉)
Assertion
Ref Expression
qliftfuns (𝜑 → (Fun 𝐹 ↔ ∀𝑦𝑧(𝑦𝑅𝑧𝑦 / 𝑥𝐴 = 𝑧 / 𝑥𝐴)))
Distinct variable groups:   𝑦,𝑧,𝐴   𝑥,𝑦,𝑧,𝜑   𝑥,𝑅,𝑦,𝑧   𝑦,𝐹,𝑧   𝑥,𝑋,𝑦,𝑧   𝑥,𝑌,𝑦,𝑧
Allowed substitution hints:   𝐴(𝑥)   𝐹(𝑥)   𝑉(𝑥, 𝑦, 𝑧)

Proof of Theorem qliftfuns
StepHypRef Expression
1 qlift.1 . . 3 𝐹 = ran (𝑥𝑋 ↦ ⟨[𝑥]𝑅, 𝐴⟩)
2 nfcv 2928 . . . . 5 𝑦⟨[𝑥]𝑅, 𝐴
3 nfcv 2928 . . . . . 6 𝑥[𝑦]𝑅
4 nfcsb1v 3880 . . . . . 6 𝑥𝑦 / 𝑥𝐴
53, 4nfop 4859 . . . . 5 𝑥⟨[𝑦]𝑅, 𝑦 / 𝑥𝐴
6 eceq1 8743 . . . . . 6 (𝑥 = 𝑦 → [𝑥]𝑅 = [𝑦]𝑅)
7 csbeq1a 3870 . . . . . 6 (𝑥 = 𝑦𝐴 = 𝑦 / 𝑥𝐴)
86, 7opeq12d 4851 . . . . 5 (𝑥 = 𝑦 → ⟨[𝑥]𝑅, 𝐴⟩ = ⟨[𝑦]𝑅, 𝑦 / 𝑥𝐴⟩)
92, 5, 8cbvmpt 5218 . . . 4 (𝑥𝑋 ↦ ⟨[𝑥]𝑅, 𝐴⟩) = (𝑦𝑋 ↦ ⟨[𝑦]𝑅, 𝑦 / 𝑥𝐴⟩)
109rneqi 5932 . . 3 ran (𝑥𝑋 ↦ ⟨[𝑥]𝑅, 𝐴⟩) = ran (𝑦𝑋 ↦ ⟨[𝑦]𝑅, 𝑦 / 𝑥𝐴⟩)
111, 10eqtri 2789 . 2 𝐹 = ran (𝑦𝑋 ↦ ⟨[𝑦]𝑅, 𝑦 / 𝑥𝐴⟩)
12 qlift.2 . . . 4 ((𝜑𝑥𝑋) → 𝐴𝑌)
1312ralrimiva 3160 . . 3 (𝜑 → ∀𝑥𝑋 𝐴𝑌)
144nfel1 2944 . . . 4 𝑥𝑦 / 𝑥𝐴𝑌
157eleq1d 2851 . . . 4 (𝑥 = 𝑦 → (𝐴𝑌𝑦 / 𝑥𝐴𝑌))
1614, 15rspc 3572 . . 3 (𝑦𝑋 → (∀𝑥𝑋 𝐴𝑌𝑦 / 𝑥𝐴𝑌))
1713, 16mpan9 516 . 2 ((𝜑𝑦𝑋) → 𝑦 / 𝑥𝐴𝑌)
18 qlift.3 . 2 (𝜑𝑅 Er 𝑋)
19 qlift.4 . 2 (𝜑𝑋𝑉)
20 csbeq1 3859 . 2 (𝑦 = 𝑧𝑦 / 𝑥𝐴 = 𝑧 / 𝑥𝐴)
2111, 17, 18, 19, 20qliftfun 8809 1 (𝜑 → (Fun 𝐹 ↔ ∀𝑦𝑧(𝑦𝑅𝑧𝑦 / 𝑥𝐴 = 𝑧 / 𝑥𝐴)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401  wal 1568   = wceq 1570  wcel 2146  wral 3082  csb 3856  cop 4600   class class class wbr 5114  cmpt 5197  ran crn 5667  Fun wfun 6537   Er wer 8700  [cec 8701
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-sep 5262  ax-pow 5341  ax-pr 5409  ax-un 7745
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-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-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  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-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-fv 6551  df-er 8703  df-ec 8705  df-qs 8709
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator