| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dfantisymrel4 | Structured version Visualization version GIF version | ||
| Description: Alternate definition of the antisymmetric relation predicate. (Contributed by Peter Mazsa, 24-Jun-2024.) |
| Ref | Expression |
|---|---|
| dfantisymrel4 | ⊢ ( AntisymRel 𝑅 ↔ ((𝑅 ∩ ◡𝑅) ⊆ I ∧ Rel 𝑅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-antisymrel 39763 | . 2 ⊢ ( AntisymRel 𝑅 ↔ ( CnvRefRel (𝑅 ∩ ◡𝑅) ∧ Rel 𝑅)) | |
| 2 | relcnv 6098 | . . . 4 ⊢ Rel ◡𝑅 | |
| 3 | relin2 5791 | . . . 4 ⊢ (Rel ◡𝑅 → Rel (𝑅 ∩ ◡𝑅)) | |
| 4 | 2, 3 | ax-mp 5 | . . 3 ⊢ Rel (𝑅 ∩ ◡𝑅) |
| 5 | dfcnvrefrel4 39512 | . . 3 ⊢ ( CnvRefRel (𝑅 ∩ ◡𝑅) ↔ ((𝑅 ∩ ◡𝑅) ⊆ I ∧ Rel (𝑅 ∩ ◡𝑅))) | |
| 6 | 4, 5 | mpbiran2 723 | . 2 ⊢ ( CnvRefRel (𝑅 ∩ ◡𝑅) ↔ (𝑅 ∩ ◡𝑅) ⊆ I ) |
| 7 | 1, 6 | bianbi 639 | 1 ⊢ ( AntisymRel 𝑅 ↔ ((𝑅 ∩ ◡𝑅) ⊆ I ∧ Rel 𝑅)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 ∩ cin 3898 ⊆ wss 3899 I cid 5545 ◡ccnv 5650 Rel wrel 5656 CnvRefRel wcnvrefrel 39092 AntisymRel wantisymrel 39122 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2733 ax-sep 5249 ax-pr 5391 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2740 df-cleq 2753 df-clel 2836 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-br 5104 df-opab 5168 df-xp 5657 df-rel 5658 df-cnv 5659 df-dm 5661 df-rn 5662 df-res 5663 df-cnvrefrel 39507 df-antisymrel 39763 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |