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 14710 | . . . 4 ⊢ (𝑋 ∈ 𝑉 → ∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)} ⊆ (𝑋 ∪ (dom 𝑋 × ran 𝑋))) | |
2 | rnss 5848 | . . . 4 ⊢ (∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)} ⊆ (𝑋 ∪ (dom 𝑋 × ran 𝑋)) → ran ∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)} ⊆ ran (𝑋 ∪ (dom 𝑋 × ran 𝑋))) | |
3 | 1, 2 | syl 17 | . . 3 ⊢ (𝑋 ∈ 𝑉 → ran ∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)} ⊆ ran (𝑋 ∪ (dom 𝑋 × ran 𝑋))) |
4 | rnun 6049 | . . . 4 ⊢ ran (𝑋 ∪ (dom 𝑋 × ran 𝑋)) = (ran 𝑋 ∪ ran (dom 𝑋 × ran 𝑋)) | |
5 | rnxpss 6075 | . . . . 5 ⊢ ran (dom 𝑋 × ran 𝑋) ⊆ ran 𝑋 | |
6 | ssequn2 4117 | . . . . 5 ⊢ (ran (dom 𝑋 × ran 𝑋) ⊆ ran 𝑋 ↔ (ran 𝑋 ∪ ran (dom 𝑋 × ran 𝑋)) = ran 𝑋) | |
7 | 5, 6 | mpbi 229 | . . . 4 ⊢ (ran 𝑋 ∪ ran (dom 𝑋 × ran 𝑋)) = ran 𝑋 |
8 | 4, 7 | eqtri 2766 | . . 3 ⊢ ran (𝑋 ∪ (dom 𝑋 × ran 𝑋)) = ran 𝑋 |
9 | 3, 8 | sseqtrdi 3971 | . 2 ⊢ (𝑋 ∈ 𝑉 → ran ∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)} ⊆ ran 𝑋) |
10 | ssmin 4898 | . . 3 ⊢ 𝑋 ⊆ ∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)} | |
11 | rnss 5848 | . . 3 ⊢ (𝑋 ⊆ ∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)} → ran 𝑋 ⊆ ran ∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)}) | |
12 | 10, 11 | mp1i 13 | . 2 ⊢ (𝑋 ∈ 𝑉 → ran 𝑋 ⊆ ran ∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)}) |
13 | 9, 12 | eqssd 3938 | 1 ⊢ (𝑋 ∈ 𝑉 → ran ∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)} = ran 𝑋) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1539 ∈ wcel 2106 {cab 2715 ∪ cun 3885 ⊆ wss 3887 ∩ cint 4879 × cxp 5587 dom cdm 5589 ran crn 5590 ∘ ccom 5593 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-int 4880 df-br 5075 df-opab 5137 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 |
This theorem is referenced by: dfrtrcl5 41237 |
Copyright terms: Public domain | W3C validator |