| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dfrefrel5 | Structured version Visualization version GIF version | ||
| Description: Alternate definition of the reflexive relation predicate. (Contributed by Peter Mazsa, 12-Dec-2023.) |
| Ref | Expression |
|---|---|
| dfrefrel5 | ⊢ ( RefRel 𝑅 ↔ (∀𝑥 ∈ (dom 𝑅 ∩ ran 𝑅)𝑥𝑅𝑥 ∧ Rel 𝑅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfrefrel2 38506 | . 2 ⊢ ( RefRel 𝑅 ↔ (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ∧ Rel 𝑅)) | |
| 2 | ref5 38301 | . 2 ⊢ (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ↔ ∀𝑥 ∈ (dom 𝑅 ∩ ran 𝑅)𝑥𝑅𝑥) | |
| 3 | 1, 2 | bianbi 627 | 1 ⊢ ( RefRel 𝑅 ↔ (∀𝑥 ∈ (dom 𝑅 ∩ ran 𝑅)𝑥𝑅𝑥 ∧ Rel 𝑅)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 ∀wral 3044 ∩ cin 3913 ⊆ wss 3914 class class class wbr 5107 I cid 5532 × cxp 5636 dom cdm 5638 ran crn 5639 Rel wrel 5643 RefRel wrefrel 38175 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pr 5387 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-clab 2708 df-cleq 2721 df-clel 2803 df-ral 3045 df-rex 3054 df-rab 3406 df-v 3449 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-nul 4297 df-if 4489 df-sn 4590 df-pr 4592 df-op 4596 df-br 5108 df-opab 5170 df-id 5533 df-xp 5644 df-rel 5645 df-cnv 5646 df-dm 5648 df-rn 5649 df-res 5650 df-refrel 38503 |
| This theorem is referenced by: refrelressn 38515 |
| Copyright terms: Public domain | W3C validator |