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

Theorem qliftel 6669
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 6667 . . 3 ((𝜑𝑥𝑋) → [𝑥]𝑅 ∈ (𝑋 / 𝑅))
61, 5, 2fliftel 5836 . 2 (𝜑 → ([𝐶]𝑅𝐹𝐷 ↔ ∃𝑥𝑋 ([𝐶]𝑅 = [𝑥]𝑅𝐷 = 𝐴)))
73adantr 276 . . . . 5 ((𝜑𝑥𝑋) → 𝑅 Er 𝑋)
8 simpr 110 . . . . 5 ((𝜑𝑥𝑋) → 𝑥𝑋)
97, 8erth2 6634 . . . 4 ((𝜑𝑥𝑋) → (𝐶𝑅𝑥 ↔ [𝐶]𝑅 = [𝑥]𝑅))
109anbi1d 465 . . 3 ((𝜑𝑥𝑋) → ((𝐶𝑅𝑥𝐷 = 𝐴) ↔ ([𝐶]𝑅 = [𝑥]𝑅𝐷 = 𝐴)))
1110rexbidva 2491 . 2 (𝜑 → (∃𝑥𝑋 (𝐶𝑅𝑥𝐷 = 𝐴) ↔ ∃𝑥𝑋 ([𝐶]𝑅 = [𝑥]𝑅𝐷 = 𝐴)))
126, 11bitr4d 191 1 (𝜑 → ([𝐶]𝑅𝐹𝐷 ↔ ∃𝑥𝑋 (𝐶𝑅𝑥𝐷 = 𝐴)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1364  wcel 2164  wrex 2473  Vcvv 2760  cop 3621   class class class wbr 4029  cmpt 4090  ran crn 4660   Er wer 6584  [cec 6585   / cqs 6586
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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-v 2762  df-sbc 2986  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-br 4030  df-opab 4091  df-mpt 4092  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-er 6587  df-ec 6589  df-qs 6593
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator