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

Theorem rntrclfvOAI 43968
Description: The range of the transitive closure is equal to the range of the relation. (Contributed by OpenAI, 7-Jul-2020.)
Assertion
Ref Expression
rntrclfvOAI (𝑅 ∈ 𝑉 → ran (t+‘𝑅) = ran 𝑅)

Proof of Theorem rntrclfvOAI
StepHypRef Expression
1 trclfvub 15203 . . . 4 (𝑅 ∈ 𝑉 → (t+‘𝑅) ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅)))
2 rnss 5933 . . . 4 ((t+‘𝑅) ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅)) → ran (t+‘𝑅) ⊆ ran (𝑅 ∪ (dom 𝑅 × ran 𝑅)))
31, 2syl 18 . . 3 (𝑅 ∈ 𝑉 → ran (t+‘𝑅) ⊆ ran (𝑅 ∪ (dom 𝑅 × ran 𝑅)))
4 rnun 6154 . . . . 5 ran (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (ran 𝑅 ∪ ran (dom 𝑅 × ran 𝑅))
54a1i 11 . . . 4 (𝑅 ∈ 𝑉 → ran (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (ran 𝑅 ∪ ran (dom 𝑅 × ran 𝑅)))
6 rnxpss 6182 . . . . 5 ran (dom 𝑅 × ran 𝑅) ⊆ ran 𝑅
7 ssequn2 4190 . . . . 5 (ran (dom 𝑅 × ran 𝑅) ⊆ ran 𝑅 ↔ (ran 𝑅 ∪ ran (dom 𝑅 × ran 𝑅)) = ran 𝑅)
86, 7mpbi 233 . . . 4 (ran 𝑅 ∪ ran (dom 𝑅 × ran 𝑅)) = ran 𝑅
95, 8eqtrdi 2814 . . 3 (𝑅 ∈ 𝑉 → ran (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = ran 𝑅)
103, 9sseqtrd 3949 . 2 (𝑅 ∈ 𝑉 → ran (t+‘𝑅) ⊆ ran 𝑅)
11 trclfvlb 15204 . . 3 (𝑅 ∈ 𝑉 → 𝑅 ⊆ (t+‘𝑅))
12 rnss 5933 . . 3 (𝑅 ⊆ (t+‘𝑅) → ran 𝑅 ⊆ ran (t+‘𝑅))
1311, 12syl 18 . 2 (𝑅 ∈ 𝑉 → ran 𝑅 ⊆ ran (t+‘𝑅))
1410, 13eqssd 3930 1 (𝑅 ∈ 𝑉 → ran (t+‘𝑅) = ran 𝑅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147   ⊆ wss 3900   ∪ cun 4152   × cxp 5656  dom cdm 5658  ran crn 5659  ‘cfv 6566  t+ctcl 15181
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-pow 5334  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-iota 6520  df-fun 6568  df-fv 6574  df-trcl 15183
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator