Theorem reldmran2 49805

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

Assertion

Ref	Expression
reldmran2	⊢ Rel dom (𝑃 Ran 𝐸)

Proof of Theorem reldmran2

Dummy variables 𝑓 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		rel0 5746	. . 3 ⊢ Rel ∅
2		df-ov 7359	. . . . . . 7 ⊢ (𝑃 Ran 𝐸) = ( Ran ‘⟨𝑃, 𝐸⟩)
3		id 22	. . . . . . 7 ⊢ (( Ran ‘⟨𝑃, 𝐸⟩) = ∅ → ( Ran ‘⟨𝑃, 𝐸⟩) = ∅)
4	2, 3	eqtrid 2781	. . . . . 6 ⊢ (( Ran ‘⟨𝑃, 𝐸⟩) = ∅ → (𝑃 Ran 𝐸) = ∅)
5	4	dmeqd 5852	. . . . 5 ⊢ (( Ran ‘⟨𝑃, 𝐸⟩) = ∅ → dom (𝑃 Ran 𝐸) = dom ∅)
6		dm0 5867	. . . . 5 ⊢ dom ∅ = ∅
7	5, 6	eqtrdi 2785	. . . 4 ⊢ (( Ran ‘⟨𝑃, 𝐸⟩) = ∅ → dom (𝑃 Ran 𝐸) = ∅)
8	7	releqd 5726	. . 3 ⊢ (( Ran ‘⟨𝑃, 𝐸⟩) = ∅ → (Rel dom (𝑃 Ran 𝐸) ↔ Rel ∅))
9	1, 8	mpbiri 258	. 2 ⊢ (( Ran ‘⟨𝑃, 𝐸⟩) = ∅ → Rel dom (𝑃 Ran 𝐸))
10		eqid 2734	. . . 4 ⊢ (𝑓 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)), 𝑥 ∈ ((1st ‘𝑃) Func 𝐸) ↦ (( oppFunc ‘(⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝑓))((oppCat‘((2nd ‘𝑃) FuncCat 𝐸)) UP (oppCat‘((1st ‘𝑃) FuncCat 𝐸)))𝑥)) = (𝑓 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)), 𝑥 ∈ ((1st ‘𝑃) Func 𝐸) ↦ (( oppFunc ‘(⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝑓))((oppCat‘((2nd ‘𝑃) FuncCat 𝐸)) UP (oppCat‘((1st ‘𝑃) FuncCat 𝐸)))𝑥))
11	10	reldmmpo 7490	. . 3 ⊢ Rel dom (𝑓 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)), 𝑥 ∈ ((1st ‘𝑃) Func 𝐸) ↦ (( oppFunc ‘(⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝑓))((oppCat‘((2nd ‘𝑃) FuncCat 𝐸)) UP (oppCat‘((1st ‘𝑃) FuncCat 𝐸)))𝑥))
12		fvfundmfvn0 6872	. . . . . . . . . 10 ⊢ (( Ran ‘⟨𝑃, 𝐸⟩) ≠ ∅ → (⟨𝑃, 𝐸⟩ ∈ dom Ran ∧ Fun ( Ran ↾ {⟨𝑃, 𝐸⟩})))
13	12	simpld 494	. . . . . . . . 9 ⊢ (( Ran ‘⟨𝑃, 𝐸⟩) ≠ ∅ → ⟨𝑃, 𝐸⟩ ∈ dom Ran )
14		ranfn 49797	. . . . . . . . . 10 ⊢ Ran Fn ((V × V) × V)
15	14	fndmi 6594	. . . . . . . . 9 ⊢ dom Ran = ((V × V) × V)
16	13, 15	eleqtrdi 2844	. . . . . . . 8 ⊢ (( Ran ‘⟨𝑃, 𝐸⟩) ≠ ∅ → ⟨𝑃, 𝐸⟩ ∈ ((V × V) × V))
17		opelxp1 5664	. . . . . . . 8 ⊢ (⟨𝑃, 𝐸⟩ ∈ ((V × V) × V) → 𝑃 ∈ (V × V))
18		1st2nd2 7970	. . . . . . . 8 ⊢ (𝑃 ∈ (V × V) → 𝑃 = ⟨(1st ‘𝑃), (2nd ‘𝑃)⟩)
19	16, 17, 18	3syl 18	. . . . . . 7 ⊢ (( Ran ‘⟨𝑃, 𝐸⟩) ≠ ∅ → 𝑃 = ⟨(1st ‘𝑃), (2nd ‘𝑃)⟩)
20	19	oveq1d 7371	. . . . . 6 ⊢ (( Ran ‘⟨𝑃, 𝐸⟩) ≠ ∅ → (𝑃 Ran 𝐸) = (⟨(1st ‘𝑃), (2nd ‘𝑃)⟩ Ran 𝐸))
21		eqid 2734	. . . . . . 7 ⊢ ((2nd ‘𝑃) FuncCat 𝐸) = ((2nd ‘𝑃) FuncCat 𝐸)
22		eqid 2734	. . . . . . 7 ⊢ ((1st ‘𝑃) FuncCat 𝐸) = ((1st ‘𝑃) FuncCat 𝐸)
23		fvexd 6847	. . . . . . 7 ⊢ (( Ran ‘⟨𝑃, 𝐸⟩) ≠ ∅ → (1st ‘𝑃) ∈ V)
24		fvexd 6847	. . . . . . 7 ⊢ (( Ran ‘⟨𝑃, 𝐸⟩) ≠ ∅ → (2nd ‘𝑃) ∈ V)
25		opelxp2 5665	. . . . . . . 8 ⊢ (⟨𝑃, 𝐸⟩ ∈ ((V × V) × V) → 𝐸 ∈ V)
26	16, 25	syl 17	. . . . . . 7 ⊢ (( Ran ‘⟨𝑃, 𝐸⟩) ≠ ∅ → 𝐸 ∈ V)
27		eqid 2734	. . . . . . 7 ⊢ (oppCat‘((2nd ‘𝑃) FuncCat 𝐸)) = (oppCat‘((2nd ‘𝑃) FuncCat 𝐸))
28		eqid 2734	. . . . . . 7 ⊢ (oppCat‘((1st ‘𝑃) FuncCat 𝐸)) = (oppCat‘((1st ‘𝑃) FuncCat 𝐸))
29	21, 22, 23, 24, 26, 27, 28	ranfval 49801	. . . . . 6 ⊢ (( Ran ‘⟨𝑃, 𝐸⟩) ≠ ∅ → (⟨(1st ‘𝑃), (2nd ‘𝑃)⟩ Ran 𝐸) = (𝑓 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)), 𝑥 ∈ ((1st ‘𝑃) Func 𝐸) ↦ (( oppFunc ‘(⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝑓))((oppCat‘((2nd ‘𝑃) FuncCat 𝐸)) UP (oppCat‘((1st ‘𝑃) FuncCat 𝐸)))𝑥)))
30	20, 29	eqtrd 2769	. . . . 5 ⊢ (( Ran ‘⟨𝑃, 𝐸⟩) ≠ ∅ → (𝑃 Ran 𝐸) = (𝑓 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)), 𝑥 ∈ ((1st ‘𝑃) Func 𝐸) ↦ (( oppFunc ‘(⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝑓))((oppCat‘((2nd ‘𝑃) FuncCat 𝐸)) UP (oppCat‘((1st ‘𝑃) FuncCat 𝐸)))𝑥)))
31	30	dmeqd 5852	. . . 4 ⊢ (( Ran ‘⟨𝑃, 𝐸⟩) ≠ ∅ → dom (𝑃 Ran 𝐸) = dom (𝑓 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)), 𝑥 ∈ ((1st ‘𝑃) Func 𝐸) ↦ (( oppFunc ‘(⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝑓))((oppCat‘((2nd ‘𝑃) FuncCat 𝐸)) UP (oppCat‘((1st ‘𝑃) FuncCat 𝐸)))𝑥)))
32	31	releqd 5726	. . 3 ⊢ (( Ran ‘⟨𝑃, 𝐸⟩) ≠ ∅ → (Rel dom (𝑃 Ran 𝐸) ↔ Rel dom (𝑓 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)), 𝑥 ∈ ((1st ‘𝑃) Func 𝐸) ↦ (( oppFunc ‘(⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝑓))((oppCat‘((2nd ‘𝑃) FuncCat 𝐸)) UP (oppCat‘((1st ‘𝑃) FuncCat 𝐸)))𝑥))))
33	11, 32	mpbiri 258	. 2 ⊢ (( Ran ‘⟨𝑃, 𝐸⟩) ≠ ∅ → Rel dom (𝑃 Ran 𝐸))
34	9, 33	pm2.61ine 3013	1 ⊢ Rel dom (𝑃 Ran 𝐸)

Syntax hints:   = wceq 1541   ∈ wcel 2113   ≠ wne 2930  Vcvv 3438  ∅c0 4283  {csn 4578  ⟨cop 4584   × cxp 5620  dom cdm 5622   ↾ cres 5624  Rel wrel 5627  Fun wfun 6484  ‘cfv 6490  (class class class)co 7356   ∈ cmpo 7358  1^st c1st 7929  2^nd c2nd 7930  oppCatcoppc 17632   Func cfunc 17776   FuncCat cfuc 17867   oppFunc coppf 49309   UP cup 49360   −∘_F cprcof 49560   Ran cran 49793

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-rep 5222  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-iun 4946  df-br 5097  df-opab 5159  df-mpt 5178  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-ov 7359  df-oprab 7360  df-mpo 7361  df-1st 7931  df-2nd 7932  df-ran 49795

This theorem is referenced by: (None)