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

Theorem fliftel 5999
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
StepHypRef Expression
1 df-br 4131 . . . 4 (𝐶𝐹𝐷 ↔ ⟨𝐶, 𝐷⟩ ∈ 𝐹)
2 flift.1 . . . . 5 𝐹 = ran (𝑥𝑋 ↦ ⟨𝐴, 𝐵⟩)
32eleq2i 2305 . . . 4 (⟨𝐶, 𝐷⟩ ∈ 𝐹 ↔ ⟨𝐶, 𝐷⟩ ∈ ran (𝑥𝑋 ↦ ⟨𝐴, 𝐵⟩))
41, 3bitri 184 . . 3 (𝐶𝐹𝐷 ↔ ⟨𝐶, 𝐷⟩ ∈ ran (𝑥𝑋 ↦ ⟨𝐴, 𝐵⟩))
5 flift.2 . . . . . 6 ((𝜑𝑥𝑋) → 𝐴𝑅)
6 flift.3 . . . . . 6 ((𝜑𝑥𝑋) → 𝐵𝑆)
7 opexg 4368 . . . . . 6 ((𝐴𝑅𝐵𝑆) → ⟨𝐴, 𝐵⟩ ∈ V)
85, 6, 7syl2anc 415 . . . . 5 ((𝜑𝑥𝑋) → ⟨𝐴, 𝐵⟩ ∈ V)
98ralrimiva 2623 . . . 4 (𝜑 → ∀𝑥𝑋𝐴, 𝐵⟩ ∈ V)
10 eqid 2238 . . . . 5 (𝑥𝑋 ↦ ⟨𝐴, 𝐵⟩) = (𝑥𝑋 ↦ ⟨𝐴, 𝐵⟩)
1110elrnmptg 5034 . . . 4 (∀𝑥𝑋𝐴, 𝐵⟩ ∈ V → (⟨𝐶, 𝐷⟩ ∈ ran (𝑥𝑋 ↦ ⟨𝐴, 𝐵⟩) ↔ ∃𝑥𝑋𝐶, 𝐷⟩ = ⟨𝐴, 𝐵⟩))
129, 11syl 14 . . 3 (𝜑 → (⟨𝐶, 𝐷⟩ ∈ ran (𝑥𝑋 ↦ ⟨𝐴, 𝐵⟩) ↔ ∃𝑥𝑋𝐶, 𝐷⟩ = ⟨𝐴, 𝐵⟩))
134, 12bitrid 192 . 2 (𝜑 → (𝐶𝐹𝐷 ↔ ∃𝑥𝑋𝐶, 𝐷⟩ = ⟨𝐴, 𝐵⟩))
14 opthg2 4379 . . . 4 ((𝐴𝑅𝐵𝑆) → (⟨𝐶, 𝐷⟩ = ⟨𝐴, 𝐵⟩ ↔ (𝐶 = 𝐴𝐷 = 𝐵)))
155, 6, 14syl2anc 415 . . 3 ((𝜑𝑥𝑋) → (⟨𝐶, 𝐷⟩ = ⟨𝐴, 𝐵⟩ ↔ (𝐶 = 𝐴𝐷 = 𝐵)))
1615rexbidva 2547 . 2 (𝜑 → (∃𝑥𝑋𝐶, 𝐷⟩ = ⟨𝐴, 𝐵⟩ ↔ ∃𝑥𝑋 (𝐶 = 𝐴𝐷 = 𝐵)))
1713, 16bitrd 188 1 (𝜑 → (𝐶𝐹𝐷 ↔ ∃𝑥𝑋 (𝐶 = 𝐴𝐷 = 𝐵)))
Colors of variables:    wff set class
This proof depends on syntax axioms:  wi 4  wa 104  wb 105   = wceq 1402  wcel 2209  wral 2528  wrex 2529  Vcvv 2821  cop 3712   class class class wbr 4130  cmpt 4192  ran crn 4775
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-br 4131  df-opab 4193  df-mpt 4194  df-cnv 4782  df-dm 4784  df-rn 4785
This theorem is used by:  fliftcnv  6001  fliftfun  6002  fliftf  6005  fliftval  6006  qliftel  6889
  Copyright terms: Public domain W3C validator