| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dfrel6 | Structured version Visualization version GIF version | ||
| Description: Alternate definition of the relation predicate. (Contributed by Peter Mazsa, 14-Mar-2019.) |
| Ref | Expression |
|---|---|
| dfrel6 | ⊢ (Rel 𝑅 ↔ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) = 𝑅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfrel5 39371 | . 2 ⊢ (Rel 𝑅 ↔ (𝑅 ↾ dom 𝑅) = 𝑅) | |
| 2 | dfres3 5974 | . . 3 ⊢ (𝑅 ↾ dom 𝑅) = (𝑅 ∩ (dom 𝑅 × ran 𝑅)) | |
| 3 | 2 | eqeq1i 2765 | . 2 ⊢ ((𝑅 ↾ dom 𝑅) = 𝑅 ↔ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) = 𝑅) |
| 4 | 1, 3 | bitri 278 | 1 ⊢ (Rel 𝑅 ↔ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) = 𝑅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 = wceq 1569 ∩ cin 4089 × cxp 5648 dom cdm 5650 ran crn 5651 ↾ cres 5652 Rel wrel 5655 |
| 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-pr 5390 |
| 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-sn 4585 df-pr 4587 df-op 4835 df-br 5103 df-opab 5167 df-xp 5656 df-rel 5657 df-cnv 5658 df-dm 5660 df-rn 5661 df-res 5662 |
| This theorem is used by: cnvref4 39375 elrels6 39470 dfrefrel2 39620 dfcnvrefrel2 39635 dfsymrel2 39658 dftrrel2 39686 |
| Copyright terms: Public domain | W3C validator |