Users' Mathboxes Mathbox for Peter Mazsa < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  dfcnvrefrels3 Structured version   Visualization version   GIF version

Theorem dfcnvrefrels3 39542
Description: Alternate definition of the class of converse reflexive relations. (Contributed by Peter Mazsa, 22-Jul-2019.)
Assertion
Ref Expression
dfcnvrefrels3 CnvRefRels = {𝑟 ∈ Rels ∣ ∀𝑥 ∈ dom 𝑟∀𝑦 ∈ ran 𝑟(𝑥𝑟𝑦 → 𝑥 = 𝑦)}
Distinct variable group:   𝑥,𝑟,𝑦

Proof of Theorem dfcnvrefrels3
StepHypRef Expression
1 df-cnvrefrels 39539 . . 3 CnvRefRels = ( CnvRefs ∩ Rels )
2 df-cnvrefs 39538 . . 3 CnvRefs = {𝑟 ∣ ( I ∩ (dom 𝑟 × ran 𝑟))◡ S (𝑟 ∩ (dom 𝑟 × ran 𝑟))}
31, 2abeqin 39187 . 2 CnvRefRels = {𝑟 ∈ Rels ∣ ( I ∩ (dom 𝑟 × ran 𝑟))◡ S (𝑟 ∩ (dom 𝑟 × ran 𝑟))}
4 dmexg 7913 . . . . . 6 (𝑟 ∈ V → dom 𝑟 ∈ V)
54elv 3455 . . . . 5 dom 𝑟 ∈ V
6 rnexg 7914 . . . . . 6 (𝑟 ∈ V → ran 𝑟 ∈ V)
76elv 3455 . . . . 5 ran 𝑟 ∈ V
85, 7xpex 7767 . . . 4 (dom 𝑟 × ran 𝑟) ∈ V
9 inex2g 5279 . . . 4 ((dom 𝑟 × ran 𝑟) ∈ V → ( I ∩ (dom 𝑟 × ran 𝑟)) ∈ V)
10 brcnvssr 39519 . . . 4 (( I ∩ (dom 𝑟 × ran 𝑟)) ∈ V → (( I ∩ (dom 𝑟 × ran 𝑟))◡ S (𝑟 ∩ (dom 𝑟 × ran 𝑟)) ↔ (𝑟 ∩ (dom 𝑟 × ran 𝑟)) ⊆ ( I ∩ (dom 𝑟 × ran 𝑟))))
118, 9, 10mp2b 10 . . 3 (( I ∩ (dom 𝑟 × ran 𝑟))◡ S (𝑟 ∩ (dom 𝑟 × ran 𝑟)) ↔ (𝑟 ∩ (dom 𝑟 × ran 𝑟)) ⊆ ( I ∩ (dom 𝑟 × ran 𝑟)))
12 inxpssidinxp 39255 . . 3 ((𝑟 ∩ (dom 𝑟 × ran 𝑟)) ⊆ ( I ∩ (dom 𝑟 × ran 𝑟)) ↔ ∀𝑥 ∈ dom 𝑟∀𝑦 ∈ ran 𝑟(𝑥𝑟𝑦 → 𝑥 = 𝑦))
1311, 12bitri 278 . 2 (( I ∩ (dom 𝑟 × ran 𝑟))◡ S (𝑟 ∩ (dom 𝑟 × ran 𝑟)) ↔ ∀𝑥 ∈ dom 𝑟∀𝑦 ∈ ran 𝑟(𝑥𝑟𝑦 → 𝑥 = 𝑦))
143, 13rabbieq 3420 1 CnvRefRels = {𝑟 ∈ Rels ∣ ∀𝑥 ∈ dom 𝑟∀𝑦 ∈ ran 𝑟(𝑥𝑟𝑦 → 𝑥 = 𝑦)}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1569   ∈ wcel 2144  ∀wral 3076  {crab 3412  Vcvv 3450   ⊆ wss 3895   ∩ cin 4089   class class class wbr 5102   I cid 5544   × cxp 5648  ◡ccnv 5649  dom cdm 5650  ran crn 5651   Rels crels 39118   S cssr 39119   CnvRefs ccnvrefs 39123   CnvRefRels ccnvrefrels 39124
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-pow 5326  ax-pr 5390  ax-un 7751
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-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-dm 5660  df-rn 5661  df-ssr 39511  df-cnvrefs 39538  df-cnvrefrels 39539
This theorem is used by:  elcnvrefrels3  39548
  Copyright terms: Public domain W3C validator