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

Theorem elcnv 5860
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 5663 . . 3 ◡𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝑦𝑅𝑥}
21eleq2i 2856 . 2 (𝐴 ∈ ◡𝑅 ↔ 𝐴 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝑦𝑅𝑥})
3 elopab 5505 . 2 (𝐴 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝑦𝑅𝑥} ↔ ∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ 𝑦𝑅𝑥))
42, 3bitri 278 1 (𝐴 ∈ ◡𝑅 ↔ ∃𝑥∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ 𝑦𝑅𝑥))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2147  ⟨cop 4838   class class class wbr 5106  {copab 5170  ◡ccnv 5654
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-ext 2735  ax-sep 5252  ax-pr 5395
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-ss 3901  df-in 4094  df-un 4154  df-sn 4589  df-pr 4591  df-op 4839  df-opab 5171  df-cnv 5663
This theorem is used by:  elcnv2  5861  gsummpt2co  33676
  Copyright terms: Public domain W3C validator