| 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 9680 | . 2 ⊢ t++𝑅 = {〈𝑥, 𝑦〉 ∣ ∃𝑛 ∈ (ω ∖ 1o)∃𝑓(𝑓 Fn suc 𝑛 ∧ ((𝑓‘∅) = 𝑥 ∧ (𝑓‘𝑛) = 𝑦) ∧ ∀𝑚 ∈ 𝑛 (𝑓‘𝑚)𝑅(𝑓‘suc 𝑚))} | |
| 2 | 1 | relopabi 5813 | 1 ⊢ Rel t++𝑅 |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 400 ∧ w3a 1101 = wceq 1568 ∃wex 1807 ∀wral 3086 ∃wrex 3096 ∖ cdif 3910 ∅c0 4294 class class class wbr 5114 Rel wrel 5670 suc csuc 6366 Fn wfn 6535 ‘cfv 6540 ωcom 7865 1oc1o 8449 t++cttrcl 9679 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2152 ax-9 2160 ax-11 2199 ax-12 2220 ax-ext 2742 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-sb 2099 df-clab 2749 df-cleq 2762 df-clel 2845 df-rab 3424 df-v 3464 df-dif 3916 df-un 3918 df-ss 3930 df-nul 4295 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-opab 5179 df-xp 5671 df-rel 5672 df-ttrcl 9680 |
| This theorem is referenced by: brttrcl 9685 ttrclss 9692 ttrclexg 9695 |
| Copyright terms: Public domain | W3C validator |