Theorem reldmrelexp 15217

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.

Step	Hyp	Ref	Expression
1		df-relexp 15216	. 2 ⊢ ↑𝑟 = (𝑟 ∈ V, 𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ( I ↾ (dom 𝑟 ∪ ran 𝑟)), (seq1((𝑥 ∈ V, 𝑦 ∈ V ↦ (𝑥 ∘ 𝑟)), (𝑧 ∈ V ↦ 𝑟))‘𝑛)))
2	1	reldmmpo 7584	1 ⊢ Rel dom ↑𝑟

This proof depends on syntax axioms:   = wceq 1570  Vcvv 3454   ∪ cun 4152  ifcif 4485   ↦ cmpt 5192   I cid 5552  dom cdm 5658  ran crn 5659   ↾ cres 5660   ∘ ccom 5662  Rel wrel 5663  ‘cfv 6566   ∈ cmpo 7453  0cc0 11239  1c1 11240  ℕ₀cn0 12646  seqcseq 14184  ↑_𝑟crelexp 15215

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-br 5109  df-opab 5174  df-xp 5664  df-rel 5665  df-dm 5668  df-oprab 7455  df-mpo 7456  df-relexp 15216

This theorem is used by:  relexpsucrd  15229  relexpsucld  15230  relexpreld  15236  relexpdmd  15240  relexprnd  15244  relexpfldd  15246  relexpaddd  15250  dfrtrclrec2  15254  relexpindlem  15259