Theorem relttrcl 9669

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.

Step	Hyp	Ref	Expression
1		df-ttrcl 9665	. 2 ⊢ t++𝑅 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑛 ∈ (ω ∖ 1o)∃𝑓(𝑓 Fn suc 𝑛 ∧ ((𝑓‘∅) = 𝑥 ∧ (𝑓‘𝑛) = 𝑦) ∧ ∀𝑚 ∈ 𝑛 (𝑓‘𝑚)𝑅(𝑓‘suc 𝑚))}
2	1	relopabi 5797	1 ⊢ Rel t++𝑅

Syntax hints:   ∧ wa 399   ∧ w3a 1099   = wceq 1562  ∃wex 1801  ∀wral 3078  ∃wrex 3088   ∖ cdif 3903  ∅c0 4287   class class class wbr 5102  Rel wrel 5654  suc csuc 6350   Fn wfn 6518  ‘cfv 6523  ωcom 7848  1_oc1o 8432  t++cttrcl 9664

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-11 2193  ax-12 2214  ax-ext 2736

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-sb 2093  df-clab 2743  df-cleq 2756  df-clel 2839  df-rab 3417  df-v 3458  df-dif 3909  df-un 3911  df-ss 3923  df-nul 4288  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-opab 5165  df-xp 5655  df-rel 5656  df-ttrcl 9665

This theorem is referenced by:  brttrcl  9670  ttrclss  9677  ttrclexg  9680