| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dfcnvrefrel5 | Structured version Visualization version GIF version | ||
| Description: Alternate definition of the converse reflexive relation predicate. (Contributed by Peter Mazsa, 25-May-2024.) |
| Ref | Expression |
|---|---|
| dfcnvrefrel5 | ⊢ ( CnvRefRel 𝑅 ↔ (∀𝑥∀𝑦(𝑥𝑅𝑦 → 𝑥 = 𝑦) ∧ Rel 𝑅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfcnvrefrel4 39207 | . 2 ⊢ ( CnvRefRel 𝑅 ↔ (𝑅 ⊆ I ∧ Rel 𝑅)) | |
| 2 | cnvref5 38946 | . 2 ⊢ (Rel 𝑅 → (𝑅 ⊆ I ↔ ∀𝑥∀𝑦(𝑥𝑅𝑦 → 𝑥 = 𝑦))) | |
| 3 | 1, 2 | bianim 586 | 1 ⊢ ( CnvRefRel 𝑅 ↔ (∀𝑥∀𝑦(𝑥𝑅𝑦 → 𝑥 = 𝑦) ∧ Rel 𝑅)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∀wal 1566 = wceq 1568 ⊆ wss 3904 class class class wbr 5108 I cid 5555 Rel wrel 5666 CnvRefRel wcnvrefrel 38787 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2143 ax-9 2151 ax-ext 2733 ax-sep 5256 ax-pr 5404 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-sb 2095 df-clab 2740 df-cleq 2753 df-clel 2836 df-ral 3078 df-rex 3088 df-rab 3415 df-v 3455 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-sn 4589 df-pr 4591 df-op 4595 df-br 5109 df-opab 5173 df-id 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-dm 5671 df-rn 5672 df-res 5673 df-cnvrefrel 39202 |
| This theorem is referenced by: dfantisymrel5 39460 |
| Copyright terms: Public domain | W3C validator |