| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > eqvreltr4d | Structured version Visualization version GIF version | ||
| Description: A transitivity relation for equivalences. (Contributed by Mario Carneiro, 9-Jul-2014.) (Revised by Peter Mazsa, 2-Jun-2019.) |
| Ref | Expression |
|---|---|
| eqvreltr4d.1 | ⊢ (𝜑 → EqvRel 𝑅) |
| eqvreltr4d.2 | ⊢ (𝜑 → 𝐴𝑅𝐵) |
| eqvreltr4d.3 | ⊢ (𝜑 → 𝐶𝑅𝐵) |
| Ref | Expression |
|---|---|
| eqvreltr4d | ⊢ (𝜑 → 𝐴𝑅𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqvreltr4d.1 | . 2 ⊢ (𝜑 → EqvRel 𝑅) | |
| 2 | eqvreltr4d.2 | . 2 ⊢ (𝜑 → 𝐴𝑅𝐵) | |
| 3 | eqvreltr4d.3 | . . 3 ⊢ (𝜑 → 𝐶𝑅𝐵) | |
| 4 | 1, 3 | eqvrelsym 39366 | . 2 ⊢ (𝜑 → 𝐵𝑅𝐶) |
| 5 | 1, 2, 4 | eqvreltrd 39369 | 1 ⊢ (𝜑 → 𝐴𝑅𝐶) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 class class class wbr 5108 EqvRel weqvrel 38877 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-ext 2734 ax-sep 5256 ax-pr 5403 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-sb 2096 df-clab 2741 df-cleq 2754 df-clel 2837 df-ral 3079 df-rex 3089 df-rab 3416 df-v 3456 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 5555 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-refrel 39269 df-symrel 39301 df-trrel 39335 df-eqvrel 39346 |
| This theorem is used by: eqvrelref 39371 eqvreldisj 39375 |
| Copyright terms: Public domain | W3C validator |