Theorem fliftel 7310

Description: Elementhood in the relation 𝐹. (Contributed by Mario Carneiro, 23-Dec-2016.)

Hypotheses

Ref	Expression
flift.1	⊢ 𝐹 = ran (𝑥 ∈ 𝑋 ↦ ⟨𝐴, 𝐵⟩)
flift.2	⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐴 ∈ 𝑅)
flift.3	⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐵 ∈ 𝑆)

Assertion

Ref	Expression
fliftel	⊢ (𝜑 → (𝐶𝐹𝐷 ↔ ∃𝑥 ∈ 𝑋 (𝐶 = 𝐴 ∧ 𝐷 = 𝐵)))

Distinct variable groups:   𝑥,𝐶   𝑥,𝑅   𝑥,𝐷   𝜑,𝑥   𝑥,𝑋   𝑥,𝑆

Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)   𝐹(𝑥)

Proof of Theorem fliftel

Step	Hyp	Ref	Expression
1		df-br 5104	. . 3 ⊢ (𝐶𝐹𝐷 ↔ ⟨𝐶, 𝐷⟩ ∈ 𝐹)
2		flift.1	. . . 4 ⊢ 𝐹 = ran (𝑥 ∈ 𝑋 ↦ ⟨𝐴, 𝐵⟩)
3	2	eleq2i 2852	. . 3 ⊢ (⟨𝐶, 𝐷⟩ ∈ 𝐹 ↔ ⟨𝐶, 𝐷⟩ ∈ ran (𝑥 ∈ 𝑋 ↦ ⟨𝐴, 𝐵⟩))
4		eqid 2760	. . . 4 ⊢ (𝑥 ∈ 𝑋 ↦ ⟨𝐴, 𝐵⟩) = (𝑥 ∈ 𝑋 ↦ ⟨𝐴, 𝐵⟩)
5		opex 5439	. . . 4 ⊢ ⟨𝐴, 𝐵⟩ ∈ V
6	4, 5	elrnmpti 5946	. . 3 ⊢ (⟨𝐶, 𝐷⟩ ∈ ran (𝑥 ∈ 𝑋 ↦ ⟨𝐴, 𝐵⟩) ↔ ∃𝑥 ∈ 𝑋 ⟨𝐶, 𝐷⟩ = ⟨𝐴, 𝐵⟩)
7	1, 3, 6	3bitri 300	. 2 ⊢ (𝐶𝐹𝐷 ↔ ∃𝑥 ∈ 𝑋 ⟨𝐶, 𝐷⟩ = ⟨𝐴, 𝐵⟩)
8		flift.2	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐴 ∈ 𝑅)
9		flift.3	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐵 ∈ 𝑆)
10		opthg2 5455	. . . 4 ⊢ ((𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑆) → (⟨𝐶, 𝐷⟩ = ⟨𝐴, 𝐵⟩ ↔ (𝐶 = 𝐴 ∧ 𝐷 = 𝐵)))
11	8, 9, 10	syl2anc 596	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (⟨𝐶, 𝐷⟩ = ⟨𝐴, 𝐵⟩ ↔ (𝐶 = 𝐴 ∧ 𝐷 = 𝐵)))
12	11	rexbidva 3184	. 2 ⊢ (𝜑 → (∃𝑥 ∈ 𝑋 ⟨𝐶, 𝐷⟩ = ⟨𝐴, 𝐵⟩ ↔ ∃𝑥 ∈ 𝑋 (𝐶 = 𝐴 ∧ 𝐷 = 𝐵)))
13	7, 12	bitrid 286	1 ⊢ (𝜑 → (𝐶𝐹𝐷 ↔ ∃𝑥 ∈ 𝑋 (𝐶 = 𝐴 ∧ 𝐷 = 𝐵)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∃wrex 3086  ⟨cop 4590   class class class wbr 5103   ↦ cmpt 5186  ran crn 5656

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-pr 5398

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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-mpt 5187  df-cnv 5663  df-dm 5665  df-rn 5666

This theorem is used by:  fliftcnv  7312  fliftfun  7313  fliftf  7316  fliftval  7317  qliftel  8800