MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  reldmrelexp Structured version   Visualization version   GIF version

Theorem reldmrelexp 15095
Description: The domain of the repeated composition of a relation is a relation. (Contributed by AV, 12-Jul-2024.)
Assertion
Ref Expression
reldmrelexp Rel dom ↑𝑟

Proof of Theorem reldmrelexp
Dummy variables 𝑛 𝑟 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-relexp 15094 . 2 𝑟 = (𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)))
21reldmmpo 7548 1 Rel dom ↑𝑟
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570  Vcvv 3450  cun 3897  ifcif 4482  cmpt 5186   I cid 5549  dom cdm 5655  ran crn 5656  cres 5657  ccom 5659  Rel wrel 5660  cfv 6533  cmpo 7416  0cc0 11125  1c1 11126  0cn0 12529  seqcseq 14066  𝑟crelexp 15093
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 2732  ax-sep 5251  ax-pr 5398
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-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-rab 3413  df-v 3452  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 5661  df-rel 5662  df-dm 5665  df-oprab 7418  df-mpo 7419  df-relexp 15094
This theorem is used by:  relexpsucrd  15107  relexpsucld  15108  relexpreld  15114  relexpdmd  15118  relexprnd  15122  relexpfldd  15124  relexpaddd  15128  dfrtrclrec2  15132  relexpindlem  15137
  Copyright terms: Public domain W3C validator