Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  rntrcl Structured version   Visualization version   GIF version

Theorem rntrcl 44768
Description: The range of the transitive closure is equal to the range of its base relation. (Contributed by RP, 1-Nov-2020.)
Assertion
Ref Expression
rntrcl (𝑋 ∈ 𝑉 → ran ∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)} = ran 𝑋)
Distinct variable group:   𝑥,𝑋
Allowed substitution hint:   𝑉(𝑥)

Proof of Theorem rntrcl
StepHypRef Expression
1 trclubg 15164 . . . 4 (𝑋 ∈ 𝑉 → ∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)} ⊆ (𝑋 ∪ (dom 𝑋 × ran 𝑋)))
2 rnss 5925 . . . 4 (∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)} ⊆ (𝑋 ∪ (dom 𝑋 × ran 𝑋)) → ran ∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)} ⊆ ran (𝑋 ∪ (dom 𝑋 × ran 𝑋)))
31, 2syl 18 . . 3 (𝑋 ∈ 𝑉 → ran ∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)} ⊆ ran (𝑋 ∪ (dom 𝑋 × ran 𝑋)))
4 rnun 6141 . . . 4 ran (𝑋 ∪ (dom 𝑋 × ran 𝑋)) = (ran 𝑋 ∪ ran (dom 𝑋 × ran 𝑋))
5 rnxpss 6169 . . . . 5 ran (dom 𝑋 × ran 𝑋) ⊆ ran 𝑋
6 ssequn2 4189 . . . . 5 (ran (dom 𝑋 × ran 𝑋) ⊆ ran 𝑋 ↔ (ran 𝑋 ∪ ran (dom 𝑋 × ran 𝑋)) = ran 𝑋)
75, 6mpbi 233 . . . 4 (ran 𝑋 ∪ ran (dom 𝑋 × ran 𝑋)) = ran 𝑋
84, 7eqtri 2786 . . 3 ran (𝑋 ∪ (dom 𝑋 × ran 𝑋)) = ran 𝑋
93, 8sseqtrdi 3952 . 2 (𝑋 ∈ 𝑉 → ran ∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)} ⊆ ran 𝑋)
10 ssmin 4929 . . 3 𝑋 ⊆ ∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)}
11 rnss 5925 . . 3 (𝑋 ⊆ ∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)} → ran 𝑋 ⊆ ran ∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)})
1210, 11mp1i 14 . 2 (𝑋 ∈ 𝑉 → ran 𝑋 ⊆ ran ∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)})
139, 12eqssd 3929 1 (𝑋 ∈ 𝑉 → ran ∩ {𝑥 ∣ (𝑋 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)} = ran 𝑋)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2146  {cab 2741   ⊆ wss 3899   ∪ cun 4151  ∩ cint 4909   × cxp 5652  dom cdm 5654  ran crn 5655   ∘ ccom 5658
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5251  ax-pow 5330  ax-pr 5394  ax-un 7758
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-int 4910  df-br 5106  df-opab 5170  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666
This theorem is used by:  dfrtrcl5  44769
  Copyright terms: Public domain W3C validator