| 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 39185 | . . . . . . 7 ⊢ ( EqvRel 𝑅 → Rel 𝑅) | |
| 3 | 1, 2 | syl 17 | . . . . . 6 ⊢ (𝜑 → Rel 𝑅) |
| 4 | simpr 488 | . . . . . 6 ⊢ ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐵𝑅𝐶) | |
| 5 | brrelex1 5702 | . . . . . 6 ⊢ ((Rel 𝑅 ∧ 𝐵𝑅𝐶) → 𝐵 ∈ V) | |
| 6 | 3, 4, 5 | syl2an 605 | . . . . 5 ⊢ ((𝜑 ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → 𝐵 ∈ V) |
| 7 | simpr 488 | . . . . 5 ⊢ ((𝜑 ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) | |
| 8 | breq2 5106 | . . . . . 6 ⊢ (𝑥 = 𝐵 → (𝐴𝑅𝑥 ↔ 𝐴𝑅𝐵)) | |
| 9 | breq1 5105 | . . . . . 6 ⊢ (𝑥 = 𝐵 → (𝑥𝑅𝐶 ↔ 𝐵𝑅𝐶)) | |
| 10 | 8, 9 | anbi12d 641 | . . . . 5 ⊢ (𝑥 = 𝐵 → ((𝐴𝑅𝑥 ∧ 𝑥𝑅𝐶) ↔ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶))) |
| 11 | 6, 7, 10 | spcedv 3559 | . . . 4 ⊢ ((𝜑 ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → ∃𝑥(𝐴𝑅𝑥 ∧ 𝑥𝑅𝐶)) |
| 12 | simpl 486 | . . . . . 6 ⊢ ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐴𝑅𝐵) | |
| 13 | brrelex1 5702 | . . . . . 6 ⊢ ((Rel 𝑅 ∧ 𝐴𝑅𝐵) → 𝐴 ∈ V) | |
| 14 | 3, 12, 13 | syl2an 605 | . . . . 5 ⊢ ((𝜑 ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → 𝐴 ∈ V) |
| 15 | brrelex2 5703 | . . . . . 6 ⊢ ((Rel 𝑅 ∧ 𝐵𝑅𝐶) → 𝐶 ∈ V) | |
| 16 | 3, 4, 15 | syl2an 605 | . . . . 5 ⊢ ((𝜑 ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → 𝐶 ∈ V) |
| 17 | brcog 5840 | . . . . 5 ⊢ ((𝐴 ∈ V ∧ 𝐶 ∈ V) → (𝐴(𝑅 ∘ 𝑅)𝐶 ↔ ∃𝑥(𝐴𝑅𝑥 ∧ 𝑥𝑅𝐶))) | |
| 18 | 14, 16, 17 | syl2anc 593 | . . . 4 ⊢ ((𝜑 ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → (𝐴(𝑅 ∘ 𝑅)𝐶 ↔ ∃𝑥(𝐴𝑅𝑥 ∧ 𝑥𝑅𝐶))) |
| 19 | 11, 18 | mpbird 259 | . . 3 ⊢ ((𝜑 ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → 𝐴(𝑅 ∘ 𝑅)𝐶) |
| 20 | 19 | ex 416 | . 2 ⊢ (𝜑 → ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐴(𝑅 ∘ 𝑅)𝐶)) |
| 21 | dfeqvrel2 39178 | . . . . . 6 ⊢ ( EqvRel 𝑅 ↔ ((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ ◡𝑅 ⊆ 𝑅 ∧ (𝑅 ∘ 𝑅) ⊆ 𝑅) ∧ Rel 𝑅)) | |
| 22 | 21 | simplbi 500 | . . . . 5 ⊢ ( EqvRel 𝑅 → (( I ↾ dom 𝑅) ⊆ 𝑅 ∧ ◡𝑅 ⊆ 𝑅 ∧ (𝑅 ∘ 𝑅) ⊆ 𝑅)) |
| 23 | 22 | simp3d 1158 | . . . 4 ⊢ ( EqvRel 𝑅 → (𝑅 ∘ 𝑅) ⊆ 𝑅) |
| 24 | 1, 23 | syl 17 | . . 3 ⊢ (𝜑 → (𝑅 ∘ 𝑅) ⊆ 𝑅) |
| 25 | 24 | ssbrd 5145 | . 2 ⊢ (𝜑 → (𝐴(𝑅 ∘ 𝑅)𝐶 → 𝐴𝑅𝐶)) |
| 26 | 20, 25 | syld 47 | 1 ⊢ (𝜑 → ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐴𝑅𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 ∧ w3a 1099 = wceq 1562 ∃wex 1801 ∈ wcel 2144 Vcvv 3456 ⊆ wss 3906 class class class wbr 5102 I cid 5543 ◡ccnv 5648 dom cdm 5649 ↾ cres 5651 ∘ ccom 5653 Rel wrel 5654 EqvRel weqvrel 38704 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-ext 2736 ax-sep 5248 ax-pr 5392 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-sb 2093 df-clab 2743 df-cleq 2756 df-clel 2839 df-ral 3079 df-rex 3089 df-rab 3417 df-v 3458 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-br 5103 df-opab 5165 df-id 5544 df-xp 5655 df-rel 5656 df-cnv 5657 df-co 5658 df-dm 5659 df-rn 5660 df-res 5661 df-refrel 39096 df-symrel 39128 df-trrel 39162 df-eqvrel 39173 |
| This theorem is referenced by: eqvreltrd 39196 eqvrelth 39199 |
| Copyright terms: Public domain | W3C validator |