![]() |
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 37841 | . 2 ⊢ ( RefRel 𝑅 ↔ (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ∧ Rel 𝑅)) | |
2 | ref5 37638 | . 2 ⊢ (( I ∩ (dom 𝑅 × ran 𝑅)) ⊆ 𝑅 ↔ ∀𝑥 ∈ (dom 𝑅 ∩ ran 𝑅)𝑥𝑅𝑥) | |
3 | 1, 2 | bianbi 37551 | 1 ⊢ ( RefRel 𝑅 ↔ (∀𝑥 ∈ (dom 𝑅 ∩ ran 𝑅)𝑥𝑅𝑥 ∧ Rel 𝑅)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∧ wa 395 ∀wral 3053 ∩ cin 3939 ⊆ wss 3940 class class class wbr 5138 I cid 5563 × cxp 5664 dom cdm 5666 ran crn 5667 Rel wrel 5671 RefRel wrefrel 37505 |
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-10 2129 ax-12 2163 ax-ext 2695 ax-sep 5289 ax-nul 5296 ax-pr 5417 |
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-nf 1778 df-sb 2060 df-clab 2702 df-cleq 2716 df-clel 2802 df-ral 3054 df-rex 3063 df-rab 3425 df-v 3468 df-dif 3943 df-un 3945 df-in 3947 df-ss 3957 df-nul 4315 df-if 4521 df-sn 4621 df-pr 4623 df-op 4627 df-br 5139 df-opab 5201 df-id 5564 df-xp 5672 df-rel 5673 df-cnv 5674 df-dm 5676 df-rn 5677 df-res 5678 df-refrel 37838 |
This theorem is referenced by: refrelressn 37850 |
Copyright terms: Public domain | W3C validator |