Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > trclubNEW | Structured version Visualization version GIF version |
Description: If a relation exists then the transitive closure has an upper bound. (Contributed by RP, 24-Jul-2020.) |
Ref | Expression |
---|---|
trclubNEW.rex | ⊢ (𝜑 → 𝑅 ∈ V) |
trclubNEW.rel | ⊢ (𝜑 → Rel 𝑅) |
Ref | Expression |
---|---|
trclubNEW | ⊢ (𝜑 → ∩ {𝑥 ∣ (𝑅 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)} ⊆ (dom 𝑅 × ran 𝑅)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | trclubNEW.rex | . . 3 ⊢ (𝜑 → 𝑅 ∈ V) | |
2 | 1 | trclubgNEW 36944 | . 2 ⊢ (𝜑 → ∩ {𝑥 ∣ (𝑅 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)} ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅))) |
3 | trclubNEW.rel | . . . 4 ⊢ (𝜑 → Rel 𝑅) | |
4 | relssdmrn 5573 | . . . 4 ⊢ (Rel 𝑅 → 𝑅 ⊆ (dom 𝑅 × ran 𝑅)) | |
5 | 3, 4 | syl 17 | . . 3 ⊢ (𝜑 → 𝑅 ⊆ (dom 𝑅 × ran 𝑅)) |
6 | ssequn1 3745 | . . 3 ⊢ (𝑅 ⊆ (dom 𝑅 × ran 𝑅) ↔ (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (dom 𝑅 × ran 𝑅)) | |
7 | 5, 6 | sylib 207 | . 2 ⊢ (𝜑 → (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (dom 𝑅 × ran 𝑅)) |
8 | 2, 7 | sseqtrd 3604 | 1 ⊢ (𝜑 → ∩ {𝑥 ∣ (𝑅 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)} ⊆ (dom 𝑅 × ran 𝑅)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1475 ∈ wcel 1977 {cab 2596 Vcvv 3173 ∪ cun 3538 ⊆ wss 3540 ∩ cint 4410 × cxp 5036 dom cdm 5038 ran crn 5039 ∘ ccom 5042 Rel wrel 5043 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-int 4411 df-br 4584 df-opab 4644 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |