Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > dfcnvrefrel2 | Structured version Visualization version GIF version |
Description: Alternate definition of the converse reflexive relation predicate. (Contributed by Peter Mazsa, 24-Jul-2019.) |
Ref | Expression |
---|---|
dfcnvrefrel2 | ⊢ ( CnvRefRel 𝑅 ↔ (𝑅 ⊆ ( I ∩ (dom 𝑅 × ran 𝑅)) ∧ Rel 𝑅)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-cnvrefrel 35764 | . 2 ⊢ ( CnvRefRel 𝑅 ↔ ((𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ ( I ∩ (dom 𝑅 × ran 𝑅)) ∧ Rel 𝑅)) | |
2 | dfrel6 35603 | . . . . 5 ⊢ (Rel 𝑅 ↔ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) = 𝑅) | |
3 | 2 | biimpi 218 | . . . 4 ⊢ (Rel 𝑅 → (𝑅 ∩ (dom 𝑅 × ran 𝑅)) = 𝑅) |
4 | 3 | sseq1d 3997 | . . 3 ⊢ (Rel 𝑅 → ((𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ ( I ∩ (dom 𝑅 × ran 𝑅)) ↔ 𝑅 ⊆ ( I ∩ (dom 𝑅 × ran 𝑅)))) |
5 | 4 | pm5.32ri 578 | . 2 ⊢ (((𝑅 ∩ (dom 𝑅 × ran 𝑅)) ⊆ ( I ∩ (dom 𝑅 × ran 𝑅)) ∧ Rel 𝑅) ↔ (𝑅 ⊆ ( I ∩ (dom 𝑅 × ran 𝑅)) ∧ Rel 𝑅)) |
6 | 1, 5 | bitri 277 | 1 ⊢ ( CnvRefRel 𝑅 ↔ (𝑅 ⊆ ( I ∩ (dom 𝑅 × ran 𝑅)) ∧ Rel 𝑅)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 208 ∧ wa 398 = wceq 1533 ∩ cin 3934 ⊆ wss 3935 I cid 5458 × cxp 5552 dom cdm 5554 ran crn 5555 Rel wrel 5559 CnvRefRel wcnvrefrel 35461 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5202 ax-nul 5209 ax-pr 5329 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-sn 4567 df-pr 4569 df-op 4573 df-br 5066 df-opab 5128 df-xp 5560 df-rel 5561 df-cnv 5562 df-dm 5564 df-rn 5565 df-res 5566 df-cnvrefrel 35764 |
This theorem is referenced by: elcnvrefrelsrel 35771 cnvrefrelcoss2 35772 |
Copyright terms: Public domain | W3C validator |