![]() |
Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > dfrefrel2 | Structured version Visualization version GIF version |
Description: Alternate definition of the reflexive relation predicate. (Contributed by Peter Mazsa, 25-Jul-2021.) |
Ref | Expression |
---|---|
dfrefrel2 | ⊢ ( RefRel 𝑅 ↔ (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ∧ Rel 𝑅)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-refrel 37895 | . 2 ⊢ ( RefRel 𝑅 ↔ (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) ∧ Rel 𝑅)) | |
2 | dfrel6 37729 | . . . . 5 ⊢ (Rel 𝑅 ↔ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) = 𝑅) | |
3 | 2 | biimpi 215 | . . . 4 ⊢ (Rel 𝑅 → (𝑅 ∩ (dom 𝑅 × ran 𝑅)) = 𝑅) |
4 | 3 | sseq2d 4009 | . . 3 ⊢ (Rel 𝑅 → (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) ↔ ( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅)) |
5 | 4 | pm5.32ri 575 | . 2 ⊢ ((( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ (𝑅 ∩ (dom 𝑅 × ran 𝑅)) ∧ Rel 𝑅) ↔ (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ∧ Rel 𝑅)) |
6 | 1, 5 | bitri 275 | 1 ⊢ ( RefRel 𝑅 ↔ (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ∧ Rel 𝑅)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∧ wa 395 = wceq 1533 ∩ cin 3942 ⊆ wss 3943 I cid 5566 × cxp 5667 dom cdm 5669 ran crn 5670 Rel wrel 5674 RefRel wrefrel 37562 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-ext 2697 ax-sep 5292 ax-nul 5299 ax-pr 5420 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-sb 2060 df-clab 2704 df-cleq 2718 df-clel 2804 df-ral 3056 df-rex 3065 df-rab 3427 df-v 3470 df-dif 3946 df-un 3948 df-in 3950 df-ss 3960 df-nul 4318 df-if 4524 df-sn 4624 df-pr 4626 df-op 4630 df-br 5142 df-opab 5204 df-xp 5675 df-rel 5676 df-cnv 5677 df-dm 5679 df-rn 5680 df-res 5681 df-refrel 37895 |
This theorem is referenced by: dfrefrel3 37899 dfrefrel5 37900 elrefrelsrel 37903 refreleq 37904 refrelcoss 37906 refsymrel2 37950 refrelredund4 38018 |
Copyright terms: Public domain | W3C validator |