![]() |
Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > dfcnvrefrels3 | Structured version Visualization version GIF version |
Description: Alternate definition of the class of converse reflexive relations. (Contributed by Peter Mazsa, 22-Jul-2019.) |
Ref | Expression |
---|---|
dfcnvrefrels3 | ⊢ CnvRefRels = {𝑟 ∈ Rels ∣ ∀𝑥 ∈ dom 𝑟∀𝑦 ∈ ran 𝑟(𝑥𝑟𝑦 → 𝑥 = 𝑦)} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-cnvrefrels 38507 | . . 3 ⊢ CnvRefRels = ( CnvRefs ∩ Rels ) | |
2 | df-cnvrefs 38506 | . . 3 ⊢ CnvRefs = {𝑟 ∣ ( I ∩ (dom 𝑟 × ran 𝑟))◡ S (𝑟 ∩ (dom 𝑟 × ran 𝑟))} | |
3 | 1, 2 | abeqin 38233 | . 2 ⊢ CnvRefRels = {𝑟 ∈ Rels ∣ ( I ∩ (dom 𝑟 × ran 𝑟))◡ S (𝑟 ∩ (dom 𝑟 × ran 𝑟))} |
4 | dmexg 7923 | . . . . . 6 ⊢ (𝑟 ∈ V → dom 𝑟 ∈ V) | |
5 | 4 | elv 3482 | . . . . 5 ⊢ dom 𝑟 ∈ V |
6 | rnexg 7924 | . . . . . 6 ⊢ (𝑟 ∈ V → ran 𝑟 ∈ V) | |
7 | 6 | elv 3482 | . . . . 5 ⊢ ran 𝑟 ∈ V |
8 | 5, 7 | xpex 7771 | . . . 4 ⊢ (dom 𝑟 × ran 𝑟) ∈ V |
9 | inex2g 5325 | . . . 4 ⊢ ((dom 𝑟 × ran 𝑟) ∈ V → ( I ∩ (dom 𝑟 × ran 𝑟)) ∈ V) | |
10 | brcnvssr 38487 | . . . 4 ⊢ (( I ∩ (dom 𝑟 × ran 𝑟)) ∈ V → (( I ∩ (dom 𝑟 × ran 𝑟))◡ S (𝑟 ∩ (dom 𝑟 × ran 𝑟)) ↔ (𝑟 ∩ (dom 𝑟 × ran 𝑟)) ⊆ ( I ∩ (dom 𝑟 × ran 𝑟)))) | |
11 | 8, 9, 10 | mp2b 10 | . . 3 ⊢ (( I ∩ (dom 𝑟 × ran 𝑟))◡ S (𝑟 ∩ (dom 𝑟 × ran 𝑟)) ↔ (𝑟 ∩ (dom 𝑟 × ran 𝑟)) ⊆ ( I ∩ (dom 𝑟 × ran 𝑟))) |
12 | inxpssidinxp 38297 | . . 3 ⊢ ((𝑟 ∩ (dom 𝑟 × ran 𝑟)) ⊆ ( I ∩ (dom 𝑟 × ran 𝑟)) ↔ ∀𝑥 ∈ dom 𝑟∀𝑦 ∈ ran 𝑟(𝑥𝑟𝑦 → 𝑥 = 𝑦)) | |
13 | 11, 12 | bitri 275 | . 2 ⊢ (( I ∩ (dom 𝑟 × ran 𝑟))◡ S (𝑟 ∩ (dom 𝑟 × ran 𝑟)) ↔ ∀𝑥 ∈ dom 𝑟∀𝑦 ∈ ran 𝑟(𝑥𝑟𝑦 → 𝑥 = 𝑦)) |
14 | 3, 13 | rabbieq 3441 | 1 ⊢ CnvRefRels = {𝑟 ∈ Rels ∣ ∀𝑥 ∈ dom 𝑟∀𝑦 ∈ ran 𝑟(𝑥𝑟𝑦 → 𝑥 = 𝑦)} |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 = wceq 1536 ∈ wcel 2105 ∀wral 3058 {crab 3432 Vcvv 3477 ∩ cin 3961 ⊆ wss 3962 class class class wbr 5147 I cid 5581 × cxp 5686 ◡ccnv 5687 dom cdm 5688 ran crn 5689 Rels crels 38163 S cssr 38164 CnvRefs ccnvrefs 38168 CnvRefRels ccnvrefrels 38169 |
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-ext 2705 ax-sep 5301 ax-nul 5311 ax-pow 5370 ax-pr 5437 ax-un 7753 |
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-ral 3059 df-rex 3068 df-rab 3433 df-v 3479 df-dif 3965 df-un 3967 df-in 3969 df-ss 3979 df-nul 4339 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4912 df-br 5148 df-opab 5210 df-id 5582 df-xp 5694 df-rel 5695 df-cnv 5696 df-dm 5698 df-rn 5699 df-ssr 38479 df-cnvrefs 38506 df-cnvrefrels 38507 |
This theorem is referenced by: elcnvrefrels3 38516 |
Copyright terms: Public domain | W3C validator |