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 33327
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 6106 . 2 Rel ◡𝑅
2 relxp 5673 . . . 4 Rel ({𝑥} × (◡𝑅 “ {𝑥}))
32rgenw 3084 . . 3 ∀𝑥 ∈ 𝐴 Rel ({𝑥} × (◡𝑅 “ {𝑥}))
4 reliun 5799 . . 3 (Rel ∪ 𝑥 ∈ 𝐴 ({𝑥} × (◡𝑅 “ {𝑥})) ↔ ∀𝑥 ∈ 𝐴 Rel ({𝑥} × (◡𝑅 “ {𝑥})))
53, 4mpbir 234 . 2 Rel ∪ 𝑥 ∈ 𝐴 ({𝑥} × (◡𝑅 “ {𝑥}))
6 vex 3458 . . . . . . . . 9 𝑧 ∈ V
7 vex 3458 . . . . . . . . 9 𝑦 ∈ V
86, 7opeldm 5894 . . . . . . . 8 (⟨𝑧, 𝑦⟩ ∈ ◡𝑅 → 𝑧 ∈ dom ◡𝑅)
9 df-rn 5666 . . . . . . . 8 ran 𝑅 = dom ◡𝑅
108, 9eleqtrrdi 2875 . . . . . . 7 (⟨𝑧, 𝑦⟩ ∈ ◡𝑅 → 𝑧 ∈ ran 𝑅)
11 ssel2 3908 . . . . . . 7 ((ran 𝑅 ⊆ 𝐴 ∧ 𝑧 ∈ ran 𝑅) → 𝑧 ∈ 𝐴)
1210, 11sylan2 605 . . . . . 6 ((ran 𝑅 ⊆ 𝐴 ∧ ⟨𝑧, 𝑦⟩ ∈ ◡𝑅) → 𝑧 ∈ 𝐴)
1312ex 418 . . . . 5 (ran 𝑅 ⊆ 𝐴 → (⟨𝑧, 𝑦⟩ ∈ ◡𝑅 → 𝑧 ∈ 𝐴))
1413pm4.71rd 572 . . . 4 (ran 𝑅 ⊆ 𝐴 → (⟨𝑧, 𝑦⟩ ∈ ◡𝑅 ↔ (𝑧 ∈ 𝐴 ∧ ⟨𝑧, 𝑦⟩ ∈ ◡𝑅)))
156, 7elimasn 6094 . . . . 5 (𝑦 ∈ (◡𝑅 “ {𝑧}) ↔ ⟨𝑧, 𝑦⟩ ∈ ◡𝑅)
1615anbi2i 635 . . . 4 ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ (◡𝑅 “ {𝑧})) ↔ (𝑧 ∈ 𝐴 ∧ ⟨𝑧, 𝑦⟩ ∈ ◡𝑅))
1714, 16bitr4di 292 . . 3 (ran 𝑅 ⊆ 𝐴 → (⟨𝑧, 𝑦⟩ ∈ ◡𝑅 ↔ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ (◡𝑅 “ {𝑧}))))
18 sneq 4594 . . . . 5 (𝑥 = 𝑧 → {𝑥} = {𝑧})
1918imaeq2d 6058 . . . 4 (𝑥 = 𝑧 → (◡𝑅 “ {𝑥}) = (◡𝑅 “ {𝑧}))
2019opeliunxp2 5820 . . 3 (⟨𝑧, 𝑦⟩ ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × (◡𝑅 “ {𝑥})) ↔ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ (◡𝑅 “ {𝑧})))
2117, 20bitr4di 292 . 2 (ran 𝑅 ⊆ 𝐴 → (⟨𝑧, 𝑦⟩ ∈ ◡𝑅 ↔ ⟨𝑧, 𝑦⟩ ∈ ∪ 𝑥 ∈ 𝐴 ({𝑥} × (◡𝑅 “ {𝑥}))))
221, 5, 21eqrelrdv 5773 1 (ran 𝑅 ⊆ 𝐴 → ◡𝑅 = ∪ 𝑥 ∈ 𝐴 ({𝑥} × (◡𝑅 “ {𝑥})))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2146  ∀wral 3080   ⊆ wss 3900  {csn 4588  ⟨cop 4838  ∪ ciun 4954   × 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 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  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 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-iun 4956  df-br 5107  df-opab 5171  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  33666
  Copyright terms: Public domain W3C validator