| 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 9624 | . 2 ⊢ t++𝑅 = {〈𝑥, 𝑦〉 ∣ ∃𝑛 ∈ (ω ∖ 1o)∃𝑓(𝑓 Fn suc 𝑛 ∧ ((𝑓‘∅) = 𝑥 ∧ (𝑓‘𝑛) = 𝑦) ∧ ∀𝑚 ∈ 𝑛 (𝑓‘𝑚)𝑅(𝑓‘suc 𝑚))} | |
| 2 | 1 | relopabi 5768 | 1 ⊢ Rel t++𝑅 |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 397 ∧ w3a 1093 = wceq 1548 ∃wex 1787 ∀wral 3055 ∃wrex 3065 ∖ cdif 3882 ∅c0 4264 class class class wbr 5075 Rel wrel 5626 suc csuc 6316 Fn wfn 6484 ‘cfv 6489 ωcom 7810 1oc1o 8392 t++cttrcl 9623 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-11 2170 ax-12 2191 ax-ext 2713 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-sb 2075 df-clab 2720 df-cleq 2733 df-clel 2816 df-rab 3394 df-v 3435 df-dif 3888 df-un 3890 df-ss 3902 df-nul 4265 df-if 4458 df-sn 4559 df-pr 4561 df-op 4565 df-opab 5138 df-xp 5627 df-rel 5628 df-ttrcl 9624 |
| This theorem is referenced by: brttrcl 9629 ttrclss 9636 ttrclexg 9639 |
| Copyright terms: Public domain | W3C validator |