qliftel - Metamath Proof Explorer

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

Theorem qliftel 8115

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**
Step	Hyp	Ref	Expression
1		qlift.1	. . 3 ⊢ 𝐹 = ran (𝑥 ∈ 𝑋 ↦ ⟨[𝑥]𝑅, 𝐴⟩)
2		qlift.2	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐴 ∈ 𝑌)
3		qlift.3	. . . 4 ⊢ (𝜑 → 𝑅 Er 𝑋)
4		qlift.4	. . . 4 ⊢ (𝜑 → 𝑋 ∈ V)
5	1, 2, 3, 4	qliftlem 8113	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → [𝑥]𝑅 ∈ (𝑋 / 𝑅))
6	1, 5, 2	fliftel 6833	. 2 ⊢ (𝜑 → ([𝐶]𝑅𝐹𝐷 ↔ ∃𝑥 ∈ 𝑋 ([𝐶]𝑅 = [𝑥]𝑅 ∧ 𝐷 = 𝐴)))
7	3	adantr 474	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝑅 Er 𝑋)
8		simpr 479	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ 𝑋)
9	7, 8	erth2 8076	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐶𝑅𝑥 ↔ [𝐶]𝑅 = [𝑥]𝑅))
10	9	anbi1d 623	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ((𝐶𝑅𝑥 ∧ 𝐷 = 𝐴) ↔ ([𝐶]𝑅 = [𝑥]𝑅 ∧ 𝐷 = 𝐴)))
11	10	rexbidva 3234	. 2 ⊢ (𝜑 → (∃𝑥 ∈ 𝑋 (𝐶𝑅𝑥 ∧ 𝐷 = 𝐴) ↔ ∃𝑥 ∈ 𝑋 ([𝐶]𝑅 = [𝑥]𝑅 ∧ 𝐷 = 𝐴)))
12	6, 11	bitr4d 274	1 ⊢ (𝜑 → ([𝐶]𝑅𝐹𝐷 ↔ ∃𝑥 ∈ 𝑋 (𝐶𝑅𝑥 ∧ 𝐷 = 𝐴)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 198 ∧ wa 386 = wceq 1601 ∈ wcel 2107 ∃wrex 3091 Vcvv 3398 ⟨cop 4404 class class class wbr 4888 ↦ cmpt 4967 ran crn 5358 Er wer 8025 [cec 8026 / cqs 8027

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1839 ax-4 1853 ax-5 1953 ax-6 2021 ax-7 2055 ax-8 2109 ax-9 2116 ax-10 2135 ax-11 2150 ax-12 2163 ax-13 2334 ax-ext 2754 ax-sep 5019 ax-nul 5027 ax-pow 5079 ax-pr 5140 ax-un 7228

This theorem depends on definitions: df-bi 199 df-an 387 df-or 837 df-3an 1073 df-tru 1605 df-ex 1824 df-nf 1828 df-sb 2012 df-mo 2551 df-eu 2587 df-clab 2764 df-cleq 2770 df-clel 2774 df-nfc 2921 df-ne 2970 df-ral 3095 df-rex 3096 df-rab 3099 df-v 3400 df-sbc 3653 df-dif 3795 df-un 3797 df-in 3799 df-ss 3806 df-nul 4142 df-if 4308 df-pw 4381 df-sn 4399 df-pr 4401 df-op 4405 df-uni 4674 df-br 4889 df-opab 4951 df-mpt 4968 df-xp 5363 df-rel 5364 df-cnv 5365 df-co 5366 df-dm 5367 df-rn 5368 df-res 5369 df-ima 5370 df-er 8028 df-ec 8030 df-qs 8034

This theorem is referenced by: (None)

W3C validator