Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > rntrcl | Structured version Visualization version GIF version |
Description: The range of the transitive closure is equal to the range of its base relation. (Contributed by RP, 1-Nov-2020.) |
Ref | Expression |
---|---|
rntrcl | ⊢ (𝑋 ∈ 𝑉 → ran ∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)} = ran 𝑋) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | trclubg 14411 | . . . 4 ⊢ (𝑋 ∈ 𝑉 → ∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)} ⊆ (𝑋 ∪ (dom 𝑋 × ran 𝑋))) | |
2 | rnss 5784 | . . . 4 ⊢ (∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)} ⊆ (𝑋 ∪ (dom 𝑋 × ran 𝑋)) → ran ∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)} ⊆ ran (𝑋 ∪ (dom 𝑋 × ran 𝑋))) | |
3 | 1, 2 | syl 17 | . . 3 ⊢ (𝑋 ∈ 𝑉 → ran ∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)} ⊆ ran (𝑋 ∪ (dom 𝑋 × ran 𝑋))) |
4 | rnun 5980 | . . . 4 ⊢ ran (𝑋 ∪ (dom 𝑋 × ran 𝑋)) = (ran 𝑋 ∪ ran (dom 𝑋 × ran 𝑋)) | |
5 | rnxpss 6005 | . . . . 5 ⊢ ran (dom 𝑋 × ran 𝑋) ⊆ ran 𝑋 | |
6 | ssequn2 4090 | . . . . 5 ⊢ (ran (dom 𝑋 × ran 𝑋) ⊆ ran 𝑋 ↔ (ran 𝑋 ∪ ran (dom 𝑋 × ran 𝑋)) = ran 𝑋) | |
7 | 5, 6 | mpbi 233 | . . . 4 ⊢ (ran 𝑋 ∪ ran (dom 𝑋 × ran 𝑋)) = ran 𝑋 |
8 | 4, 7 | eqtri 2781 | . . 3 ⊢ ran (𝑋 ∪ (dom 𝑋 × ran 𝑋)) = ran 𝑋 |
9 | 3, 8 | sseqtrdi 3944 | . 2 ⊢ (𝑋 ∈ 𝑉 → ran ∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)} ⊆ ran 𝑋) |
10 | ssmin 4860 | . . 3 ⊢ 𝑋 ⊆ ∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)} | |
11 | rnss 5784 | . . 3 ⊢ (𝑋 ⊆ ∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)} → ran 𝑋 ⊆ ran ∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)}) | |
12 | 10, 11 | mp1i 13 | . 2 ⊢ (𝑋 ∈ 𝑉 → ran 𝑋 ⊆ ran ∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)}) |
13 | 9, 12 | eqssd 3911 | 1 ⊢ (𝑋 ∈ 𝑉 → ran ∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)} = ran 𝑋) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1538 ∈ wcel 2111 {cab 2735 ∪ cun 3858 ⊆ wss 3860 ∩ cint 4841 × cxp 5525 dom cdm 5527 ran crn 5528 ∘ ccom 5531 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2729 ax-sep 5172 ax-nul 5179 ax-pow 5237 ax-pr 5301 ax-un 7464 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-fal 1551 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2557 df-eu 2588 df-clab 2736 df-cleq 2750 df-clel 2830 df-nfc 2901 df-ne 2952 df-ral 3075 df-rex 3076 df-rab 3079 df-v 3411 df-dif 3863 df-un 3865 df-in 3867 df-ss 3877 df-nul 4228 df-if 4424 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4802 df-int 4842 df-br 5036 df-opab 5098 df-xp 5533 df-rel 5534 df-cnv 5535 df-co 5536 df-dm 5537 df-rn 5538 df-res 5539 |
This theorem is referenced by: dfrtrcl5 40730 |
Copyright terms: Public domain | W3C validator |