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

Theorem qliftel 6186
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 6184 . . 3 ((𝜑𝑥𝑋) → [𝑥]𝑅 ∈ (𝑋 / 𝑅))
61, 5, 2fliftel 5433 . 2 (𝜑 → ([𝐶]𝑅𝐹𝐷 ↔ ∃𝑥𝑋 ([𝐶]𝑅 = [𝑥]𝑅𝐷 = 𝐴)))
73adantr 261 . . . . 5 ((𝜑𝑥𝑋) → 𝑅 Er 𝑋)
8 simpr 103 . . . . 5 ((𝜑𝑥𝑋) → 𝑥𝑋)
97, 8erth2 6151 . . . 4 ((𝜑𝑥𝑋) → (𝐶𝑅𝑥 ↔ [𝐶]𝑅 = [𝑥]𝑅))
109anbi1d 438 . . 3 ((𝜑𝑥𝑋) → ((𝐶𝑅𝑥𝐷 = 𝐴) ↔ ([𝐶]𝑅 = [𝑥]𝑅𝐷 = 𝐴)))
1110rexbidva 2323 . 2 (𝜑 → (∃𝑥𝑋 (𝐶𝑅𝑥𝐷 = 𝐴) ↔ ∃𝑥𝑋 ([𝐶]𝑅 = [𝑥]𝑅𝐷 = 𝐴)))
126, 11bitr4d 180 1 (𝜑 → ([𝐶]𝑅𝐹𝐷 ↔ ∃𝑥𝑋 (𝐶𝑅𝑥𝐷 = 𝐴)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 97  wb 98   = wceq 1243  wcel 1393  wrex 2307  Vcvv 2557  cop 3378   class class class wbr 3764  cmpt 3818  ran crn 4346   Er wer 6103  [cec 6104   / cqs 6105
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-13 1404  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875  ax-pow 3927  ax-pr 3944  ax-un 4170
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-v 2559  df-sbc 2765  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-br 3765  df-opab 3819  df-mpt 3820  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-res 4357  df-ima 4358  df-er 6106  df-ec 6108  df-qs 6112
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator