Theorem reldmran 50934

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 50930	. 2 ⊢ Ran = (𝑝 ∈ (V × V), 𝑒 ∈ V ↦ ⦋(1st ‘𝑝) / 𝑐⦌⦋(2nd ‘𝑝) / 𝑑⦌(𝑓 ∈ (𝑐 Func 𝑑), 𝑥 ∈ (𝑐 Func 𝑒) ↦ (( oppFunc ‘(⟨𝑑, 𝑒⟩ −∘F 𝑓))((oppCat‘(𝑑 FuncCat 𝑒)) UP (oppCat‘(𝑐 FuncCat 𝑒)))𝑥)))
2	1	reldmmpo 7561	1 ⊢ Rel dom Ran

This proof depends on syntax axioms:  Vcvv 3453  ⦋csb 3850  ⟨cop 4837   × cxp 5652  dom cdm 5654  Rel wrel 5659  ‘cfv 6546  (class class class)co 7427   ∈ cmpo 7429  1^st c1st 8006  2^nd c2nd 8007  oppCatcoppc 17897   Func cfunc 18041   FuncCat cfuc 18132   oppFunc coppf 50377   UP cup 50428   −∘_F cprcof 50647   Ran cran 50928

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5251  ax-pr 5394

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4838  df-br 5106  df-opab 5170  df-xp 5660  df-rel 5661  df-dm 5664  df-oprab 7431  df-mpo 7432  df-ran 50930

This theorem is used by: (None)