| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > relttrcl | Structured version Visualization version GIF version | ||
| Description: The transitive closure of a class is a relation. (Contributed by Scott Fenton, 17-Oct-2024.) |
| Ref | Expression |
|---|---|
| relttrcl | ⊢ Rel t++𝑅 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ttrcl 9709 | . 2 ⊢ t++𝑅 = {〈𝑥, 𝑦〉 ∣ ∃𝑛 ∈ (ω ∖ 1o)∃𝑓(𝑓 Fn suc 𝑛 ∧ ((𝑓‘∅) = 𝑥 ∧ (𝑓‘𝑛) = 𝑦) ∧ ∀𝑚 ∈ 𝑛 (𝑓‘𝑚)𝑅(𝑓‘suc 𝑚))} | |
| 2 | 1 | relopabi 5799 | 1 ⊢ Rel t++𝑅 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∃wex 1811 ∀wral 3076 ∃wrex 3086 ∖ cdif 4045 ∅c0 4278 class class class wbr 5102 Rel wrel 5655 suc csuc 6364 Fn wfn 6533 ‘cfv 6538 ωcom 7877 1oc1o 8469 t++cttrcl 9708 |
| 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 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-11 2193 ax-12 2212 ax-ext 2732 |
| 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-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-rab 3413 df-v 3452 df-ss 3896 df-dif 4047 df-un 4151 df-nul 4279 df-if 4482 df-sn 4584 df-pr 4586 df-op 4590 df-opab 5167 df-xp 5656 df-rel 5657 df-ttrcl 9709 |
| This theorem is used by: brttrcl 9714 ttrclss 9721 ttrclexg 9724 |
| Copyright terms: Public domain | W3C validator |