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 36645
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 36642 . . 3 CnvRefRels = ( CnvRefs ∩ Rels )
2 df-cnvrefs 36641 . . 3 CnvRefs = {𝑟 ∣ ( I ∩ (dom 𝑟 × ran 𝑟)) S (𝑟 ∩ (dom 𝑟 × ran 𝑟))}
31, 2abeqin 36392 . 2 CnvRefRels = {𝑟 ∈ Rels ∣ ( I ∩ (dom 𝑟 × ran 𝑟)) S (𝑟 ∩ (dom 𝑟 × ran 𝑟))}
4 dmexg 7750 . . . . . 6 (𝑟 ∈ V → dom 𝑟 ∈ V)
54elv 3438 . . . . 5 dom 𝑟 ∈ V
6 rnexg 7751 . . . . . 6 (𝑟 ∈ V → ran 𝑟 ∈ V)
76elv 3438 . . . . 5 ran 𝑟 ∈ V
85, 7xpex 7603 . . . 4 (dom 𝑟 × ran 𝑟) ∈ V
9 inex2g 5244 . . . 4 ((dom 𝑟 × ran 𝑟) ∈ V → ( I ∩ (dom 𝑟 × ran 𝑟)) ∈ V)
10 brcnvssr 36624 . . . 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 36451 . . 3 ((𝑟 ∩ (dom 𝑟 × ran 𝑟)) ⊆ ( I ∩ (dom 𝑟 × ran 𝑟)) ↔ ∀𝑥 ∈ dom 𝑟𝑦 ∈ ran 𝑟(𝑥𝑟𝑦𝑥 = 𝑦))
1311, 12bitri 274 . 2 (( I ∩ (dom 𝑟 × ran 𝑟)) S (𝑟 ∩ (dom 𝑟 × ran 𝑟)) ↔ ∀𝑥 ∈ dom 𝑟𝑦 ∈ ran 𝑟(𝑥𝑟𝑦𝑥 = 𝑦))
143, 13rabbieq 36390 1 CnvRefRels = {𝑟 ∈ Rels ∣ ∀𝑥 ∈ dom 𝑟𝑦 ∈ ran 𝑟(𝑥𝑟𝑦𝑥 = 𝑦)}
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205   = wceq 1539  wcel 2106  wral 3064  {crab 3068  Vcvv 3432  cin 3886  wss 3887   class class class wbr 5074   I cid 5488   × cxp 5587  ccnv 5588  dom cdm 5589  ran crn 5590   Rels crels 36335   S cssr 36336   CnvRefs ccnvrefs 36340   CnvRefRels ccnvrefrels 36341
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-dm 5599  df-rn 5600  df-ssr 36616  df-cnvrefs 36641  df-cnvrefrels 36642
This theorem is referenced by:  elcnvrefrels3  36649
  Copyright terms: Public domain W3C validator