Theorem fliftel 7346

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 5107	. . 3 ⊢ (𝐶𝐹𝐷 ↔ ⟨𝐶, 𝐷⟩ ∈ 𝐹)
2		flift.1	. . . 4 ⊢ 𝐹 = ran (𝑥 ∈ 𝑋 ↦ ⟨𝐴, 𝐵⟩)
3	2	eleq2i 2856	. . 3 ⊢ (⟨𝐶, 𝐷⟩ ∈ 𝐹 ↔ ⟨𝐶, 𝐷⟩ ∈ ran (𝑥 ∈ 𝑋 ↦ ⟨𝐴, 𝐵⟩))
4		eqid 2763	. . . 4 ⊢ (𝑥 ∈ 𝑋 ↦ ⟨𝐴, 𝐵⟩) = (𝑥 ∈ 𝑋 ↦ ⟨𝐴, 𝐵⟩)
5		opex 5437	. . . 4 ⊢ ⟨𝐴, 𝐵⟩ ∈ V
6	4, 5	elrnmpti 5954	. . 3 ⊢ (⟨𝐶, 𝐷⟩ ∈ ran (𝑥 ∈ 𝑋 ↦ ⟨𝐴, 𝐵⟩) ↔ ∃𝑥 ∈ 𝑋 ⟨𝐶, 𝐷⟩ = ⟨𝐴, 𝐵⟩)
7	1, 3, 6	3bitri 300	. 2 ⊢ (𝐶𝐹𝐷 ↔ ∃𝑥 ∈ 𝑋 ⟨𝐶, 𝐷⟩ = ⟨𝐴, 𝐵⟩)
8		flift.2	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐴 ∈ 𝑅)
9		flift.3	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐵 ∈ 𝑆)
10		opthg2 5453	. . . 4 ⊢ ((𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑆) → (⟨𝐶, 𝐷⟩ = ⟨𝐴, 𝐵⟩ ↔ (𝐶 = 𝐴 ∧ 𝐷 = 𝐵)))
11	8, 9, 10	syl2anc 596	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (⟨𝐶, 𝐷⟩ = ⟨𝐴, 𝐵⟩ ↔ (𝐶 = 𝐴 ∧ 𝐷 = 𝐵)))
12	11	rexbidva 3188	. 2 ⊢ (𝜑 → (∃𝑥 ∈ 𝑋 ⟨𝐶, 𝐷⟩ = ⟨𝐴, 𝐵⟩ ↔ ∃𝑥 ∈ 𝑋 (𝐶 = 𝐴 ∧ 𝐷 = 𝐵)))
13	7, 12	bitrid 286	1 ⊢ (𝜑 → (𝐶𝐹𝐷 ↔ ∃𝑥 ∈ 𝑋 (𝐶 = 𝐴 ∧ 𝐷 = 𝐵)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∃wrex 3090  ⟨cop 4838   class class class wbr 5106   ↦ cmpt 5190  ran crn 5657

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-pr 5396

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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-br 5107  df-opab 5172  df-mpt 5191  df-cnv 5664  df-dm 5666  df-rn 5667

This theorem is used by:  fliftcnv  7348  fliftfun  7349  fliftf  7352  fliftval  7353  qliftel  8857