Theorem reldmran 51126

Description: The domain of Ran is a relation. (Contributed by Zhi Wang, 4-Nov-2025.)

Assertion

Ref	Expression
reldmran	⊢ Rel dom Ran

Proof of Theorem reldmran

Dummy variables 𝑐 𝑑 𝑒 𝑓 𝑝 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-ran 51122	. 2 ⊢ Ran = (𝑝 ∈ (V × V), 𝑒 ∈ V ↦ ⦋(1st ‘𝑝) / 𝑐⦌⦋(2nd ‘𝑝) / 𝑑⦌(𝑓 ∈ (𝑐 Func 𝑑), 𝑥 ∈ (𝑐 Func 𝑒) ↦ (( oppFunc ‘(⟨𝑑, 𝑒⟩ −∘F 𝑓))((oppCat‘(𝑑 FuncCat 𝑒)) UP (oppCat‘(𝑐 FuncCat 𝑒)))𝑥)))
2	1	reldmmpo 7584	1 ⊢ Rel dom Ran

This proof depends on syntax axioms:  Vcvv 3454  ⦋csb 3851  ⟨cop 4840   × cxp 5656  dom cdm 5658  Rel wrel 5663  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453  1^st c1st 8033  2^nd c2nd 8034  oppCatcoppc 17935   Func cfunc 18079   FuncCat cfuc 18170   oppFunc coppf 50569   UP cup 50620   −∘_F cprcof 50839   Ran cran 51120

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-ran 51122

This theorem is used by: (None)