| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > reldmrelexp | Structured version Visualization version GIF version | ||
| Description: The domain of the repeated composition of a relation is a relation. (Contributed by AV, 12-Jul-2024.) |
| Ref | Expression |
|---|---|
| reldmrelexp | ⊢ Rel dom ↑𝑟 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-relexp 15173 | . 2 ⊢ ↑𝑟 = (𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ∘ 𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛))) | |
| 2 | 1 | reldmmpo 7554 | 1 ⊢ Rel dom ↑𝑟 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 Vcvv 3451 ∪ cun 3897 ifcif 4482 ↦ cmpt 5186 I cid 5545 dom cdm 5651 ran crn 5652 ↾ cres 5653 ∘ ccom 5655 Rel wrel 5656 ‘cfv 6538 ∈ cmpo 7422 0cc0 11200 1c1 11201 ℕ0cn0 12606 seqcseq 14144 ↑𝑟crelexp 15172 |
| 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-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-pr 5391 |
| 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-nf 1817 df-sb 2100 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-rab 3414 df-v 3453 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-br 5104 df-opab 5168 df-xp 5657 df-rel 5658 df-dm 5661 df-oprab 7424 df-mpo 7425 df-relexp 15173 |
| This theorem is used by: relexpsucrd 15186 relexpsucld 15187 relexpreld 15193 relexpdmd 15197 relexprnd 15201 relexpfldd 15203 relexpaddd 15207 dfrtrclrec2 15211 relexpindlem 15216 |
| Copyright terms: Public domain | W3C validator |