| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dfeqvrel2 | Structured version Visualization version GIF version | ||
| Description: Alternate definition of the equivalence relation predicate. (Contributed by Peter Mazsa, 22-Apr-2019.) |
| Ref | Expression |
|---|---|
| dfeqvrel2 | ⊢ ( EqvRel 𝑅 ↔ ((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ ◡𝑅 ⊆ 𝑅 ∧ (𝑅 ∘ 𝑅) ⊆ 𝑅) ∧ Rel 𝑅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-eqvrel 39867 | . 2 ⊢ ( EqvRel 𝑅 ↔ ( RefRel 𝑅 ∧ SymRel 𝑅 ∧ TrRel 𝑅)) | |
| 2 | refsymrel2 39849 | . . . 4 ⊢ (( RefRel 𝑅 ∧ SymRel 𝑅) ↔ ((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ ◡𝑅 ⊆ 𝑅) ∧ Rel 𝑅)) | |
| 3 | dftrrel2 39859 | . . . 4 ⊢ ( TrRel 𝑅 ↔ ((𝑅 ∘ 𝑅) ⊆ 𝑅 ∧ Rel 𝑅)) | |
| 4 | 2, 3 | anbi12i 640 | . . 3 ⊢ ((( RefRel 𝑅 ∧ SymRel 𝑅) ∧ TrRel 𝑅) ↔ (((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ ◡𝑅 ⊆ 𝑅) ∧ Rel 𝑅) ∧ ((𝑅 ∘ 𝑅) ⊆ 𝑅 ∧ Rel 𝑅))) |
| 5 | df-3an 1105 | . . 3 ⊢ (( RefRel 𝑅 ∧ SymRel 𝑅 ∧ TrRel 𝑅) ↔ (( RefRel 𝑅 ∧ SymRel 𝑅) ∧ TrRel 𝑅)) | |
| 6 | df-3an 1105 | . . . . 5 ⊢ ((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ ◡𝑅 ⊆ 𝑅 ∧ (𝑅 ∘ 𝑅) ⊆ 𝑅) ↔ ((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ ◡𝑅 ⊆ 𝑅) ∧ (𝑅 ∘ 𝑅) ⊆ 𝑅)) | |
| 7 | 6 | anbi1i 636 | . . . 4 ⊢ (((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ ◡𝑅 ⊆ 𝑅 ∧ (𝑅 ∘ 𝑅) ⊆ 𝑅) ∧ Rel 𝑅) ↔ (((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ ◡𝑅 ⊆ 𝑅) ∧ (𝑅 ∘ 𝑅) ⊆ 𝑅) ∧ Rel 𝑅)) |
| 8 | 3anan32 1113 | . . . 4 ⊢ (((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ ◡𝑅 ⊆ 𝑅) ∧ Rel 𝑅 ∧ (𝑅 ∘ 𝑅) ⊆ 𝑅) ↔ (((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ ◡𝑅 ⊆ 𝑅) ∧ (𝑅 ∘ 𝑅) ⊆ 𝑅) ∧ Rel 𝑅)) | |
| 9 | anandi3r 1120 | . . . 4 ⊢ (((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ ◡𝑅 ⊆ 𝑅) ∧ Rel 𝑅 ∧ (𝑅 ∘ 𝑅) ⊆ 𝑅) ↔ (((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ ◡𝑅 ⊆ 𝑅) ∧ Rel 𝑅) ∧ ((𝑅 ∘ 𝑅) ⊆ 𝑅 ∧ Rel 𝑅))) | |
| 10 | 7, 8, 9 | 3bitr2i 302 | . . 3 ⊢ (((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ ◡𝑅 ⊆ 𝑅 ∧ (𝑅 ∘ 𝑅) ⊆ 𝑅) ∧ Rel 𝑅) ↔ (((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ ◡𝑅 ⊆ 𝑅) ∧ Rel 𝑅) ∧ ((𝑅 ∘ 𝑅) ⊆ 𝑅 ∧ Rel 𝑅))) |
| 11 | 4, 5, 10 | 3bitr4i 306 | . 2 ⊢ (( RefRel 𝑅 ∧ SymRel 𝑅 ∧ TrRel 𝑅) ↔ ((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ ◡𝑅 ⊆ 𝑅 ∧ (𝑅 ∘ 𝑅) ⊆ 𝑅) ∧ Rel 𝑅)) |
| 12 | 1, 11 | bitri 278 | 1 ⊢ ( EqvRel 𝑅 ↔ ((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ ◡𝑅 ⊆ 𝑅 ∧ (𝑅 ∘ 𝑅) ⊆ 𝑅) ∧ Rel 𝑅)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 ∧ w3a 1103 ⊆ wss 3900 I cid 5552 ◡ccnv 5657 dom cdm 5658 ↾ cres 5660 ∘ ccom 5662 Rel wrel 5663 RefRel wrefrel 39387 SymRel wsymrel 39393 TrRel wtrrel 39396 EqvRel weqvrel 39398 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 ax-sep 5255 ax-pr 5398 |
| 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 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-br 5109 df-opab 5174 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-refrel 39790 df-symrel 39822 df-trrel 39856 df-eqvrel 39867 |
| This theorem is used by: eleqvrelsrel 39876 eqvrelrel 39879 eqvreltr 39889 |
| Copyright terms: Public domain | W3C validator |