Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > trclubi | 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, 2-Jan-2020.) (Revised by RP, 28-Apr-2020.) (Revised by AV, 26-Mar-2021.) |
Ref | Expression |
---|---|
trclubi.rel | ⊢ Rel 𝑅 |
trclubi.rex | ⊢ 𝑅 ∈ V |
Ref | Expression |
---|---|
trclubi | ⊢ ∩ {𝑠 ∣ (𝑅 ⊆ 𝑠 ∧ (𝑠 ∘ 𝑠) ⊆ 𝑠)} ⊆ (dom 𝑅 × ran 𝑅) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | trclubi.rel | . . . 4 ⊢ Rel 𝑅 | |
2 | relssdmrn 6116 | . . . . 5 ⊢ (Rel 𝑅 → 𝑅 ⊆ (dom 𝑅 × ran 𝑅)) | |
3 | ssequn1 4156 | . . . . 5 ⊢ (𝑅 ⊆ (dom 𝑅 × ran 𝑅) ↔ (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (dom 𝑅 × ran 𝑅)) | |
4 | 2, 3 | sylib 220 | . . . 4 ⊢ (Rel 𝑅 → (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (dom 𝑅 × ran 𝑅)) |
5 | 1, 4 | ax-mp 5 | . . 3 ⊢ (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (dom 𝑅 × ran 𝑅) |
6 | trclubi.rex | . . . 4 ⊢ 𝑅 ∈ V | |
7 | trclublem 14349 | . . . 4 ⊢ (𝑅 ∈ V → (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑠 ∣ (𝑅 ⊆ 𝑠 ∧ (𝑠 ∘ 𝑠) ⊆ 𝑠)}) | |
8 | 6, 7 | ax-mp 5 | . . 3 ⊢ (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑠 ∣ (𝑅 ⊆ 𝑠 ∧ (𝑠 ∘ 𝑠) ⊆ 𝑠)} |
9 | 5, 8 | eqeltrri 2910 | . 2 ⊢ (dom 𝑅 × ran 𝑅) ∈ {𝑠 ∣ (𝑅 ⊆ 𝑠 ∧ (𝑠 ∘ 𝑠) ⊆ 𝑠)} |
10 | intss1 4884 | . 2 ⊢ ((dom 𝑅 × ran 𝑅) ∈ {𝑠 ∣ (𝑅 ⊆ 𝑠 ∧ (𝑠 ∘ 𝑠) ⊆ 𝑠)} → ∩ {𝑠 ∣ (𝑅 ⊆ 𝑠 ∧ (𝑠 ∘ 𝑠) ⊆ 𝑠)} ⊆ (dom 𝑅 × ran 𝑅)) | |
11 | 9, 10 | ax-mp 5 | 1 ⊢ ∩ {𝑠 ∣ (𝑅 ⊆ 𝑠 ∧ (𝑠 ∘ 𝑠) ⊆ 𝑠)} ⊆ (dom 𝑅 × ran 𝑅) |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 398 = wceq 1533 ∈ wcel 2110 {cab 2799 Vcvv 3495 ∪ cun 3934 ⊆ wss 3936 ∩ cint 4869 × cxp 5548 dom cdm 5550 ran crn 5551 ∘ ccom 5554 Rel wrel 5555 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5322 ax-un 7455 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3497 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4833 df-int 4870 df-br 5060 df-opab 5122 df-xp 5556 df-rel 5557 df-cnv 5558 df-co 5559 df-dm 5560 df-rn 5561 df-res 5562 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |