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

Theorem elcnv 5853
Description: Membership in a converse relation. Equation 5 of [Suppes] p. 62. (Contributed by NM, 24-Mar-1998.)
Assertion
Ref Expression
elcnv (𝐴 ∈ ◡𝑅 ↔ ∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ 𝑦𝑅𝑥))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝑅,𝑦

Proof of Theorem elcnv
StepHypRef Expression
1 df-cnv 5658 . . 3 ◡𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝑦𝑅𝑥}
21eleq2i 2852 . 2 (𝐴 ∈ ◡𝑅 ↔ 𝐴 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝑦𝑅𝑥})
3 elopab 5500 . 2 (𝐴 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝑦𝑅𝑥} ↔ ∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ 𝑦𝑅𝑥))
42, 3bitri 278 1 (𝐴 ∈ ◡𝑅 ↔ ∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ 𝑦𝑅𝑥))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2144  ⟨cop 4589   class class class wbr 5102  {copab 5166  ◡ccnv 5649
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-ss 3896  df-in 4091  df-un 4151  df-sn 4584  df-pr 4586  df-op 4590  df-opab 5167  df-cnv 5658
This theorem is used by:  elcnv2  5854  gsummpt2co  33609
  Copyright terms: Public domain W3C validator