MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  relttrcl Structured version   Visualization version   GIF version

Theorem relttrcl 9679
Description: The transitive closure of a class is a relation. (Contributed by Scott Fenton, 17-Oct-2024.)
Assertion
Ref Expression
relttrcl Rel t++𝑅

Proof of Theorem relttrcl
Dummy variables 𝑓 𝑛 𝑚 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-ttrcl 9675 . 2 t++𝑅 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑛 ∈ (ω ∖ 1o)∃𝑓(𝑓 Fn suc 𝑛 ∧ ((𝑓‘∅) = 𝑥 ∧ (𝑓𝑛) = 𝑦) ∧ ∀𝑚𝑛 (𝑓𝑚)𝑅(𝑓‘suc 𝑚))}
21relopabi 5808 1 Rel t++𝑅
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wa 400  w3a 1102   = wceq 1569  wex 1808  wral 3078  wrex 3088  cdif 3901  c0 4285   class class class wbr 5108  Rel wrel 5665  suc csuc 6362   Fn wfn 6531  cfv 6536  ωcom 7860  1oc1o 8444  t++cttrcl 9674
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-11 2191  ax-12 2212  ax-ext 2734
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-opab 5173  df-xp 5666  df-rel 5667  df-ttrcl 9675
This theorem is used by:  brttrcl  9680  ttrclss  9687  ttrclexg  9690
  Copyright terms: Public domain W3C validator