| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > eqvreltr | Structured version Visualization version GIF version | ||
| Description: An equivalence relation is transitive. (Contributed by NM, 4-Jun-1995.) (Revised by Mario Carneiro, 12-Aug-2015.) (Revised by Peter Mazsa, 2-Jun-2019.) |
| Ref | Expression |
|---|---|
| eqvreltr.1 | ⊢ (𝜑 → EqvRel 𝑅) |
| Ref | Expression |
|---|---|
| eqvreltr | ⊢ (𝜑 → ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐴𝑅𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqvreltr.1 | . . . . . . 7 ⊢ (𝜑 → EqvRel 𝑅) | |
| 2 | eqvrelrel 39255 | . . . . . . 7 ⊢ ( EqvRel 𝑅 → Rel 𝑅) | |
| 3 | 1, 2 | syl 18 | . . . . . 6 ⊢ (𝜑 → Rel 𝑅) |
| 4 | simpr 489 | . . . . . 6 ⊢ ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐵𝑅𝐶) | |
| 5 | brrelex1 5715 | . . . . . 6 ⊢ ((Rel 𝑅 ∧ 𝐵𝑅𝐶) → 𝐵 ∈ V) | |
| 6 | 3, 4, 5 | syl2an 607 | . . . . 5 ⊢ ((𝜑 ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → 𝐵 ∈ V) |
| 7 | simpr 489 | . . . . 5 ⊢ ((𝜑 ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) | |
| 8 | breq2 5115 | . . . . . 6 ⊢ (𝑥 = 𝐵 → (𝐴𝑅𝑥 ↔ 𝐴𝑅𝐵)) | |
| 9 | breq1 5114 | . . . . . 6 ⊢ (𝑥 = 𝐵 → (𝑥𝑅𝐶 ↔ 𝐵𝑅𝐶)) | |
| 10 | 8, 9 | anbi12d 643 | . . . . 5 ⊢ (𝑥 = 𝐵 → ((𝐴𝑅𝑥 ∧ 𝑥𝑅𝐶) ↔ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶))) |
| 11 | 6, 7, 10 | spcedv 3564 | . . . 4 ⊢ ((𝜑 ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → ∃𝑥(𝐴𝑅𝑥 ∧ 𝑥𝑅𝐶)) |
| 12 | simpl 487 | . . . . . 6 ⊢ ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐴𝑅𝐵) | |
| 13 | brrelex1 5715 | . . . . . 6 ⊢ ((Rel 𝑅 ∧ 𝐴𝑅𝐵) → 𝐴 ∈ V) | |
| 14 | 3, 12, 13 | syl2an 607 | . . . . 5 ⊢ ((𝜑 ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → 𝐴 ∈ V) |
| 15 | brrelex2 5716 | . . . . . 6 ⊢ ((Rel 𝑅 ∧ 𝐵𝑅𝐶) → 𝐶 ∈ V) | |
| 16 | 3, 4, 15 | syl2an 607 | . . . . 5 ⊢ ((𝜑 ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → 𝐶 ∈ V) |
| 17 | brcog 5853 | . . . . 5 ⊢ ((𝐴 ∈ V ∧ 𝐶 ∈ V) → (𝐴(𝑅 ∘ 𝑅)𝐶 ↔ ∃𝑥(𝐴𝑅𝑥 ∧ 𝑥𝑅𝐶))) | |
| 18 | 14, 16, 17 | syl2anc 595 | . . . 4 ⊢ ((𝜑 ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → (𝐴(𝑅 ∘ 𝑅)𝐶 ↔ ∃𝑥(𝐴𝑅𝑥 ∧ 𝑥𝑅𝐶))) |
| 19 | 11, 18 | mpbird 260 | . . 3 ⊢ ((𝜑 ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → 𝐴(𝑅 ∘ 𝑅)𝐶) |
| 20 | 19 | ex 417 | . 2 ⊢ (𝜑 → ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐴(𝑅 ∘ 𝑅)𝐶)) |
| 21 | dfeqvrel2 39248 | . . . . . 6 ⊢ ( EqvRel 𝑅 ↔ ((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ ◡𝑅 ⊆ 𝑅 ∧ (𝑅 ∘ 𝑅) ⊆ 𝑅) ∧ Rel 𝑅)) | |
| 22 | 21 | simplbi 501 | . . . . 5 ⊢ ( EqvRel 𝑅 → (( I ↾ dom 𝑅) ⊆ 𝑅 ∧ ◡𝑅 ⊆ 𝑅 ∧ (𝑅 ∘ 𝑅) ⊆ 𝑅)) |
| 23 | 22 | simp3d 1160 | . . . 4 ⊢ ( EqvRel 𝑅 → (𝑅 ∘ 𝑅) ⊆ 𝑅) |
| 24 | 1, 23 | syl 18 | . . 3 ⊢ (𝜑 → (𝑅 ∘ 𝑅) ⊆ 𝑅) |
| 25 | 24 | ssbrd 5156 | . 2 ⊢ (𝜑 → (𝐴(𝑅 ∘ 𝑅)𝐶 → 𝐴𝑅𝐶)) |
| 26 | 20, 25 | syld 48 | 1 ⊢ (𝜑 → ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐴𝑅𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∃wex 1806 ∈ wcel 2149 Vcvv 3461 ⊆ wss 3911 class class class wbr 5111 I cid 5556 ◡ccnv 5661 dom cdm 5662 ↾ cres 5664 ∘ ccom 5666 Rel wrel 5667 EqvRel weqvrel 38774 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 ax-sep 5259 ax-pr 5405 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-ral 3086 df-rex 3096 df-rab 3423 df-v 3463 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-nul 4293 df-if 4491 df-sn 4593 df-pr 4595 df-op 4599 df-br 5112 df-opab 5176 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-refrel 39166 df-symrel 39198 df-trrel 39232 df-eqvrel 39243 |
| This theorem is referenced by: eqvreltrd 39266 eqvrelth 39269 |
| Copyright terms: Public domain | W3C validator |