| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > trclub | Structured version Visualization version GIF version | ||
| Description: The Cartesian product of the domain and range of a relation is an upper bound for its transitive closure. (Contributed by RP, 17-May-2020.) |
| Ref | Expression |
|---|---|
| trclub | ⊢ ((𝑅 ∈ 𝑉 ∧ Rel 𝑅) → ∩ {𝑟 ∣ (𝑅 ⊆ 𝑟 ∧ (𝑟 ∘ 𝑟) ⊆ 𝑟)} ⊆ (dom 𝑅 × ran 𝑅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | relssdmrn 6216 | . . . 4 ⊢ (Rel 𝑅 → 𝑅 ⊆ (dom 𝑅 × ran 𝑅)) | |
| 2 | ssequn1 4133 | . . . 4 ⊢ (𝑅 ⊆ (dom 𝑅 × ran 𝑅) ↔ (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (dom 𝑅 × ran 𝑅)) | |
| 3 | 1, 2 | sylib 218 | . . 3 ⊢ (Rel 𝑅 → (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (dom 𝑅 × ran 𝑅)) |
| 4 | trclublem 14902 | . . 3 ⊢ (𝑅 ∈ 𝑉 → (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑟 ∣ (𝑅 ⊆ 𝑟 ∧ (𝑟 ∘ 𝑟) ⊆ 𝑟)}) | |
| 5 | eleq1 2819 | . . . 4 ⊢ ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (dom 𝑅 × ran 𝑅) → ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑟 ∣ (𝑅 ⊆ 𝑟 ∧ (𝑟 ∘ 𝑟) ⊆ 𝑟)} ↔ (dom 𝑅 × ran 𝑅) ∈ {𝑟 ∣ (𝑅 ⊆ 𝑟 ∧ (𝑟 ∘ 𝑟) ⊆ 𝑟)})) | |
| 6 | 5 | biimpa 476 | . . 3 ⊢ (((𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (dom 𝑅 × ran 𝑅) ∧ (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑟 ∣ (𝑅 ⊆ 𝑟 ∧ (𝑟 ∘ 𝑟) ⊆ 𝑟)}) → (dom 𝑅 × ran 𝑅) ∈ {𝑟 ∣ (𝑅 ⊆ 𝑟 ∧ (𝑟 ∘ 𝑟) ⊆ 𝑟)}) |
| 7 | 3, 4, 6 | syl2anr 597 | . 2 ⊢ ((𝑅 ∈ 𝑉 ∧ Rel 𝑅) → (dom 𝑅 × ran 𝑅) ∈ {𝑟 ∣ (𝑅 ⊆ 𝑟 ∧ (𝑟 ∘ 𝑟) ⊆ 𝑟)}) |
| 8 | intss1 4911 | . 2 ⊢ ((dom 𝑅 × ran 𝑅) ∈ {𝑟 ∣ (𝑅 ⊆ 𝑟 ∧ (𝑟 ∘ 𝑟) ⊆ 𝑟)} → ∩ {𝑟 ∣ (𝑅 ⊆ 𝑟 ∧ (𝑟 ∘ 𝑟) ⊆ 𝑟)} ⊆ (dom 𝑅 × ran 𝑅)) | |
| 9 | 7, 8 | syl 17 | 1 ⊢ ((𝑅 ∈ 𝑉 ∧ Rel 𝑅) → ∩ {𝑟 ∣ (𝑅 ⊆ 𝑟 ∧ (𝑟 ∘ 𝑟) ⊆ 𝑟)} ⊆ (dom 𝑅 × ran 𝑅)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2111 {cab 2709 ∪ cun 3895 ⊆ wss 3897 ∩ cint 4895 × cxp 5612 dom cdm 5614 ran crn 5615 ∘ ccom 5618 Rel wrel 5619 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-11 2160 ax-ext 2703 ax-sep 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368 ax-un 7668 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2710 df-cleq 2723 df-clel 2806 df-ne 2929 df-ral 3048 df-rex 3057 df-rab 3396 df-v 3438 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-nul 4281 df-if 4473 df-pw 4549 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4857 df-int 4896 df-br 5090 df-opab 5152 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |