ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  qliftel GIF version

Theorem qliftel 6849
Description: Elementhood in the relation 𝐹. (Contributed by Mario Carneiro, 23-Dec-2016.)
Hypotheses
Ref Expression
qlift.1 𝐹 = ran (𝑥𝑋 ↦ ⟨[𝑥]𝑅, 𝐴⟩)
qlift.2 ((𝜑𝑥𝑋) → 𝐴𝑌)
qlift.3 (𝜑𝑅 Er 𝑋)
qlift.4 (𝜑𝑋 ∈ V)
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 (𝜑𝑋 ∈ V)
51, 2, 3, 4qliftlem 6847 . . 3 ((𝜑𝑥𝑋) → [𝑥]𝑅 ∈ (𝑋 / 𝑅))
61, 5, 2fliftel 5966 . 2 (𝜑 → ([𝐶]𝑅𝐹𝐷 ↔ ∃𝑥𝑋 ([𝐶]𝑅 = [𝑥]𝑅𝐷 = 𝐴)))
73adantr 276 . . . . 5 ((𝜑𝑥𝑋) → 𝑅 Er 𝑋)
8 simpr 110 . . . . 5 ((𝜑𝑥𝑋) → 𝑥𝑋)
97, 8erth2 6814 . . . 4 ((𝜑𝑥𝑋) → (𝐶𝑅𝑥 ↔ [𝐶]𝑅 = [𝑥]𝑅))
109anbi1d 465 . . 3 ((𝜑𝑥𝑋) → ((𝐶𝑅𝑥𝐷 = 𝐴) ↔ ([𝐶]𝑅 = [𝑥]𝑅𝐷 = 𝐴)))
1110rexbidva 2539 . 2 (𝜑 → (∃𝑥𝑋 (𝐶𝑅𝑥𝐷 = 𝐴) ↔ ∃𝑥𝑋 ([𝐶]𝑅 = [𝑥]𝑅𝐷 = 𝐴)))
126, 11bitr4d 191 1 (𝜑 → ([𝐶]𝑅𝐹𝐷 ↔ ∃𝑥𝑋 (𝐶𝑅𝑥𝐷 = 𝐴)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1398  wcel 2203  wrex 2521  Vcvv 2813  cop 3692   class class class wbr 4109  cmpt 4171  ran crn 4750   Er wer 6764  [cec 6765   / cqs 6766
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-v 2815  df-sbc 3043  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-opab 4172  df-mpt 4173  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-er 6767  df-ec 6769  df-qs 6773
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator