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

Theorem qliftel 8747
Description: Elementhood in the relation 𝐹. (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
qliftel (𝜑 → ([𝐶]𝑅𝐹𝐷 ↔ ∃𝑥𝑋 (𝐶𝑅𝑥𝐷 = 𝐴)))
Distinct variable groups:   𝑥,𝐶   𝑥,𝐷   𝜑,𝑥   𝑥,𝑅   𝑥,𝑋   𝑥,𝑌
Allowed substitution hints:   𝐴(𝑥)   𝐹(𝑥)   𝑉(𝑥)

Proof of Theorem qliftel
StepHypRef Expression
1 qlift.1 . . 3 𝐹 = ran (𝑥𝑋 ↦ ⟨[𝑥]𝑅, 𝐴⟩)
2 qlift.2 . . . 4 ((𝜑𝑥𝑋) → 𝐴𝑌)
3 qlift.3 . . . 4 (𝜑𝑅 Er 𝑋)
4 qlift.4 . . . 4 (𝜑𝑋𝑉)
51, 2, 3, 4qliftlem 8745 . . 3 ((𝜑𝑥𝑋) → [𝑥]𝑅 ∈ (𝑋 / 𝑅))
61, 5, 2fliftel 7264 . 2 (𝜑 → ([𝐶]𝑅𝐹𝐷 ↔ ∃𝑥𝑋 ([𝐶]𝑅 = [𝑥]𝑅𝐷 = 𝐴)))
73adantr 480 . . . . 5 ((𝜑𝑥𝑋) → 𝑅 Er 𝑋)
8 simpr 484 . . . . 5 ((𝜑𝑥𝑋) → 𝑥𝑋)
97, 8erth2 8699 . . . 4 ((𝜑𝑥𝑋) → (𝐶𝑅𝑥 ↔ [𝐶]𝑅 = [𝑥]𝑅))
109anbi1d 632 . . 3 ((𝜑𝑥𝑋) → ((𝐶𝑅𝑥𝐷 = 𝐴) ↔ ([𝐶]𝑅 = [𝑥]𝑅𝐷 = 𝐴)))
1110rexbidva 3159 . 2 (𝜑 → (∃𝑥𝑋 (𝐶𝑅𝑥𝐷 = 𝐴) ↔ ∃𝑥𝑋 ([𝐶]𝑅 = [𝑥]𝑅𝐷 = 𝐴)))
126, 11bitr4d 282 1 (𝜑 → ([𝐶]𝑅𝐹𝐷 ↔ ∃𝑥𝑋 (𝐶𝑅𝑥𝐷 = 𝐴)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  wrex 3061  cop 4573   class class class wbr 5085  cmpt 5166  ran crn 5632   Er wer 8640  [cec 8641   / cqs 8642
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 2185  ax-ext 2708  ax-sep 5231  ax-pow 5307  ax-pr 5375  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-mpt 5167  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-er 8643  df-ec 8645  df-qs 8649
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator