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

Theorem restrreld 44989
Description: The restriction of a transitive relation is a transitive relation. (Contributed by RP, 24-Dec-2019.)
Hypotheses
Ref Expression
restrreld.r (𝜑 → (𝑅 ∘ 𝑅) ⊆ 𝑅)
restrreld.s (𝜑 → 𝑆 = (𝑅 ↾ 𝐴))
Assertion
Ref Expression
restrreld (𝜑 → (𝑆 ∘ 𝑆) ⊆ 𝑆)

Proof of Theorem restrreld
StepHypRef Expression
1 restrreld.r . 2 (𝜑 → (𝑅 ∘ 𝑅) ⊆ 𝑅)
2 restrreld.s . . 3 (𝜑 → 𝑆 = (𝑅 ↾ 𝐴))
3 df-res 5670 . . 3 (𝑅 ↾ 𝐴) = (𝑅 ∩ (𝐴 × V))
42, 3eqtrdi 2814 . 2 (𝜑 → 𝑆 = (𝑅 ∩ (𝐴 × V)))
51, 4xpintrreld 44988 1 (𝜑 → (𝑆 ∘ 𝑆) ⊆ 𝑆)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570  Vcvv 3454   ⊆ wss 3900   ∩ cin 4092   × cxp 5656   ↾ cres 5660   ∘ ccom 5662
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-ext 2735  ax-sep 5255  ax-pr 5398
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-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  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-sn 4589  df-pr 4591  df-op 4841  df-br 5109  df-opab 5174  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator