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

Theorem cnvsymOLDOLD 6136
Description: Obsolete version of cnvsym 6134 as of 23-Dec-2024. (Contributed by NM, 28-Dec-1996.) (Proof shortened by Andrew Salmon, 27-Aug-2011.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
cnvsymOLDOLD (𝑅𝑅 ↔ ∀𝑥𝑦(𝑥𝑅𝑦𝑦𝑅𝑥))
Distinct variable group:   𝑥,𝑦,𝑅

Proof of Theorem cnvsymOLDOLD
StepHypRef Expression
1 alcom 2156 . 2 (∀𝑦𝑥(⟨𝑦, 𝑥⟩ ∈ 𝑅 → ⟨𝑦, 𝑥⟩ ∈ 𝑅) ↔ ∀𝑥𝑦(⟨𝑦, 𝑥⟩ ∈ 𝑅 → ⟨𝑦, 𝑥⟩ ∈ 𝑅))
2 relcnv 6124 . . 3 Rel 𝑅
3 ssrel 5794 . . 3 (Rel 𝑅 → (𝑅𝑅 ↔ ∀𝑦𝑥(⟨𝑦, 𝑥⟩ ∈ 𝑅 → ⟨𝑦, 𝑥⟩ ∈ 𝑅)))
42, 3ax-mp 5 . 2 (𝑅𝑅 ↔ ∀𝑦𝑥(⟨𝑦, 𝑥⟩ ∈ 𝑅 → ⟨𝑦, 𝑥⟩ ∈ 𝑅))
5 vex 3481 . . . . . 6 𝑦 ∈ V
6 vex 3481 . . . . . 6 𝑥 ∈ V
75, 6brcnv 5895 . . . . 5 (𝑦𝑅𝑥𝑥𝑅𝑦)
8 df-br 5148 . . . . 5 (𝑦𝑅𝑥 ↔ ⟨𝑦, 𝑥⟩ ∈ 𝑅)
97, 8bitr3i 277 . . . 4 (𝑥𝑅𝑦 ↔ ⟨𝑦, 𝑥⟩ ∈ 𝑅)
10 df-br 5148 . . . 4 (𝑦𝑅𝑥 ↔ ⟨𝑦, 𝑥⟩ ∈ 𝑅)
119, 10imbi12i 350 . . 3 ((𝑥𝑅𝑦𝑦𝑅𝑥) ↔ (⟨𝑦, 𝑥⟩ ∈ 𝑅 → ⟨𝑦, 𝑥⟩ ∈ 𝑅))
12112albii 1816 . 2 (∀𝑥𝑦(𝑥𝑅𝑦𝑦𝑅𝑥) ↔ ∀𝑥𝑦(⟨𝑦, 𝑥⟩ ∈ 𝑅 → ⟨𝑦, 𝑥⟩ ∈ 𝑅))
131, 4, 123bitr4i 303 1 (𝑅𝑅 ↔ ∀𝑥𝑦(𝑥𝑅𝑦𝑦𝑅𝑥))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wal 1534  wcel 2105  wss 3962  cop 4636   class class class wbr 5147  ccnv 5687  Rel wrel 5693
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1791  ax-4 1805  ax-5 1907  ax-6 1964  ax-7 2004  ax-8 2107  ax-9 2115  ax-11 2154  ax-ext 2705  ax-sep 5301  ax-nul 5311  ax-pr 5437
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1539  df-fal 1549  df-ex 1776  df-sb 2062  df-clab 2712  df-cleq 2726  df-clel 2813  df-rab 3433  df-v 3479  df-dif 3965  df-un 3967  df-ss 3979  df-nul 4339  df-if 4531  df-sn 4631  df-pr 4633  df-op 4637  df-br 5148  df-opab 5210  df-xp 5694  df-rel 5695  df-cnv 5696
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator