Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  dfcnv2 Structured version   Visualization version   GIF version

Theorem dfcnv2 33151
Description: Alternative definition of the converse of a relation. (Contributed by Thierry Arnoux, 31-Mar-2018.)
Assertion
Ref Expression
dfcnv2 (ran 𝑅𝐴𝑅 = 𝑥𝐴 ({𝑥} × (𝑅 “ {𝑥})))
Distinct variable groups:   𝑥,𝐴   𝑥,𝑅

Proof of Theorem dfcnv2
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relcnv 6100 . 2 Rel 𝑅
2 relxp 5673 . . . 4 Rel ({𝑥} × (𝑅 “ {𝑥}))
32rgenw 3080 . . 3 𝑥𝐴 Rel ({𝑥} × (𝑅 “ {𝑥}))
4 reliun 5797 . . 3 (Rel 𝑥𝐴 ({𝑥} × (𝑅 “ {𝑥})) ↔ ∀𝑥𝐴 Rel ({𝑥} × (𝑅 “ {𝑥})))
53, 4mpbir 234 . 2 Rel 𝑥𝐴 ({𝑥} × (𝑅 “ {𝑥}))
6 vex 3454 . . . . . . . . 9 𝑧 ∈ V
7 vex 3454 . . . . . . . . 9 𝑦 ∈ V
86, 7opeldm 5891 . . . . . . . 8 (⟨𝑧, 𝑦⟩ ∈ 𝑅𝑧 ∈ dom 𝑅)
9 df-rn 5666 . . . . . . . 8 ran 𝑅 = dom 𝑅
108, 9eleqtrrdi 2871 . . . . . . 7 (⟨𝑧, 𝑦⟩ ∈ 𝑅𝑧 ∈ ran 𝑅)
11 ssel2 3926 . . . . . . 7 ((ran 𝑅𝐴𝑧 ∈ ran 𝑅) → 𝑧𝐴)
1210, 11sylan2 605 . . . . . 6 ((ran 𝑅𝐴 ∧ ⟨𝑧, 𝑦⟩ ∈ 𝑅) → 𝑧𝐴)
1312ex 418 . . . . 5 (ran 𝑅𝐴 → (⟨𝑧, 𝑦⟩ ∈ 𝑅𝑧𝐴))
1413pm4.71rd 572 . . . 4 (ran 𝑅𝐴 → (⟨𝑧, 𝑦⟩ ∈ 𝑅 ↔ (𝑧𝐴 ∧ ⟨𝑧, 𝑦⟩ ∈ 𝑅)))
156, 7elimasn 6086 . . . . 5 (𝑦 ∈ (𝑅 “ {𝑧}) ↔ ⟨𝑧, 𝑦⟩ ∈ 𝑅)
1615anbi2i 635 . . . 4 ((𝑧𝐴𝑦 ∈ (𝑅 “ {𝑧})) ↔ (𝑧𝐴 ∧ ⟨𝑧, 𝑦⟩ ∈ 𝑅))
1714, 16bitr4di 292 . . 3 (ran 𝑅𝐴 → (⟨𝑧, 𝑦⟩ ∈ 𝑅 ↔ (𝑧𝐴𝑦 ∈ (𝑅 “ {𝑧}))))
18 sneq 4594 . . . . 5 (𝑥 = 𝑧 → {𝑥} = {𝑧})
1918imaeq2d 6056 . . . 4 (𝑥 = 𝑧 → (𝑅 “ {𝑥}) = (𝑅 “ {𝑧}))
2019opeliunxp2 5818 . . 3 (⟨𝑧, 𝑦⟩ ∈ 𝑥𝐴 ({𝑥} × (𝑅 “ {𝑥})) ↔ (𝑧𝐴𝑦 ∈ (𝑅 “ {𝑧})))
2117, 20bitr4di 292 . 2 (ran 𝑅𝐴 → (⟨𝑧, 𝑦⟩ ∈ 𝑅 ↔ ⟨𝑧, 𝑦⟩ ∈ 𝑥𝐴 ({𝑥} × (𝑅 “ {𝑥}))))
221, 5, 21eqrelrdv 5772 1 (ran 𝑅𝐴𝑅 = 𝑥𝐴 ({𝑥} × (𝑅 “ {𝑥})))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2145  wral 3076  wss 3899  {csn 4584  cop 4590   ciun 4951   × cxp 5653  ccnv 5654  dom cdm 5655  ran crn 5656  cima 5658  Rel wrel 5660
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-pr 5398
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 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-iun 4953  df-br 5104  df-opab 5168  df-xp 5661  df-rel 5662  df-cnv 5663  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668
This theorem is used by:  gsummpt2co  33491
  Copyright terms: Public domain W3C validator