| 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 9690 | . 2 ⊢ t++𝑅 = {〈𝑥, 𝑦〉 ∣ ∃𝑛 ∈ (ω ∖ 1o)∃𝑓(𝑓 Fn suc 𝑛 ∧ ((𝑓‘∅) = 𝑥 ∧ (𝑓‘𝑛) = 𝑦) ∧ ∀𝑚 ∈ 𝑛 (𝑓‘𝑚)𝑅(𝑓‘suc 𝑚))} | |
| 2 | 1 | relopabi 5807 | 1 ⊢ Rel t++𝑅 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∃wex 1812 ∀wral 3078 ∃wrex 3088 ∖ cdif 3899 ∅c0 4282 class class class wbr 5107 Rel wrel 5664 suc csuc 6363 Fn wfn 6532 ‘cfv 6537 ωcom 7865 1oc1o 8451 t++cttrcl 9689 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-11 2194 ax-12 2215 ax-ext 2734 |
| 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 2100 df-clab 2741 df-cleq 2754 df-clel 2837 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-opab 5172 df-xp 5665 df-rel 5666 df-ttrcl 9690 |
| This theorem is used by: brttrcl 9695 ttrclss 9702 ttrclexg 9705 |
| Copyright terms: Public domain | W3C validator |