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

Theorem qliftel 8859
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 8857 . . 3 ((𝜑 ∧ 𝑥 ∈ 𝑋) → [𝑥]𝑅 ∈ (𝑋 / 𝑅))
61, 5, 2fliftel 7348 . 2 (𝜑 → ([𝐶]𝑅𝐹𝐷 ↔ ∃𝑥 ∈ 𝑋 ([𝐶]𝑅 = [𝑥]𝑅 ∧ 𝐷 = 𝐴)))
73adantr 486 . . . . 5 ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝑅 Er 𝑋)
8 simpr 490 . . . . 5 ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ 𝑋)
97, 8erth2 8811 . . . 4 ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐶𝑅𝑥 ↔ [𝐶]𝑅 = [𝑥]𝑅))
109anbi1d 643 . . 3 ((𝜑 ∧ 𝑥 ∈ 𝑋) → ((𝐶𝑅𝑥 ∧ 𝐷 = 𝐴) ↔ ([𝐶]𝑅 = [𝑥]𝑅 ∧ 𝐷 = 𝐴)))
1110rexbidva 3188 . 2 (𝜑 → (∃𝑥 ∈ 𝑋 (𝐶𝑅𝑥 ∧ 𝐷 = 𝐴) ↔ ∃𝑥 ∈ 𝑋 ([𝐶]𝑅 = [𝑥]𝑅 ∧ 𝐷 = 𝐴)))
126, 11bitr4d 285 1 (𝜑 → ([𝐶]𝑅𝐹𝐷 ↔ ∃𝑥 ∈ 𝑋 (𝐶𝑅𝑥 ∧ 𝐷 = 𝐴)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∃wrex 3090  ⟨cop 4840   class class class wbr 5108   ↦ cmpt 5192  ran crn 5659   Er wer 8752  [cec 8753   / cqs 8754
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-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-pow 5334  ax-pr 5398  ax-un 7783
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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-er 8755  df-ec 8757  df-qs 8761
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator