reldmlan2 - Mathbox for Zhi Wang

	Mathbox for Zhi Wang		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > reldmlan2		Structured version Visualization version GIF version

Theorem reldmlan2 50238

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

**Assertion**
Ref	Expression
reldmlan2	⊢ Rel dom (𝑃 Lan 𝐸)

Proof of Theorem reldmlan2 Dummy variables 𝑓 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		rel0 5771	. . 3 ⊢ Rel ∅
2		df-ov 7399	. . . . . . 7 ⊢ (𝑃 Lan 𝐸) = ( Lan ‘⟨𝑃, 𝐸⟩)
3		id 22	. . . . . . 7 ⊢ (( Lan ‘⟨𝑃, 𝐸⟩) = ∅ → ( Lan ‘⟨𝑃, 𝐸⟩) = ∅)
4	2, 3	eqtrid 2809	. . . . . 6 ⊢ (( Lan ‘⟨𝑃, 𝐸⟩) = ∅ → (𝑃 Lan 𝐸) = ∅)
5	4	dmeqd 5881	. . . . 5 ⊢ (( Lan ‘⟨𝑃, 𝐸⟩) = ∅ → dom (𝑃 Lan 𝐸) = dom ∅)
6		dm0 5896	. . . . 5 ⊢ dom ∅ = ∅
7	5, 6	eqtrdi 2813	. . . 4 ⊢ (( Lan ‘⟨𝑃, 𝐸⟩) = ∅ → dom (𝑃 Lan 𝐸) = ∅)
8	7	releqd 5751	. . 3 ⊢ (( Lan ‘⟨𝑃, 𝐸⟩) = ∅ → (Rel dom (𝑃 Lan 𝐸) ↔ Rel ∅))
9	1, 8	mpbiri 260	. 2 ⊢ (( Lan ‘⟨𝑃, 𝐸⟩) = ∅ → Rel dom (𝑃 Lan 𝐸))
10		eqid 2762	. . . 4 ⊢ (𝑓 ∈ ((1^st ‘𝑃) Func (2^nd ‘𝑃)), 𝑥 ∈ ((1^st ‘𝑃) Func 𝐸) ↦ ((⟨(2^nd ‘𝑃), 𝐸⟩ −∘_F 𝑓)(((2^nd ‘𝑃) FuncCat 𝐸) UP ((1^st ‘𝑃) FuncCat 𝐸))𝑥)) = (𝑓 ∈ ((1^st ‘𝑃) Func (2^nd ‘𝑃)), 𝑥 ∈ ((1^st ‘𝑃) Func 𝐸) ↦ ((⟨(2^nd ‘𝑃), 𝐸⟩ −∘_F 𝑓)(((2^nd ‘𝑃) FuncCat 𝐸) UP ((1^st ‘𝑃) FuncCat 𝐸))𝑥))
11	10	reldmmpo 7530	. . 3 ⊢ Rel dom (𝑓 ∈ ((1^st ‘𝑃) Func (2^nd ‘𝑃)), 𝑥 ∈ ((1^st ‘𝑃) Func 𝐸) ↦ ((⟨(2^nd ‘𝑃), 𝐸⟩ −∘_F 𝑓)(((2^nd ‘𝑃) FuncCat 𝐸) UP ((1^st ‘𝑃) FuncCat 𝐸))𝑥))
12		fvfundmfvn0 6907	. . . . . . . . . 10 ⊢ (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → (⟨𝑃, 𝐸⟩ ∈ dom Lan ∧ Fun ( Lan ↾ {⟨𝑃, 𝐸⟩})))
13	12	simpld 498	. . . . . . . . 9 ⊢ (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → ⟨𝑃, 𝐸⟩ ∈ dom Lan )
14		lanfn 50230	. . . . . . . . . 10 ⊢ Lan Fn ((V × V) × V)
15	14	fndmi 6625	. . . . . . . . 9 ⊢ dom Lan = ((V × V) × V)
16	13, 15	eleqtrdi 2872	. . . . . . . 8 ⊢ (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → ⟨𝑃, 𝐸⟩ ∈ ((V × V) × V))
17		opelxp1 5689	. . . . . . . 8 ⊢ (⟨𝑃, 𝐸⟩ ∈ ((V × V) × V) → 𝑃 ∈ (V × V))
18		1st2nd2 8009	. . . . . . . 8 ⊢ (𝑃 ∈ (V × V) → 𝑃 = ⟨(1^st ‘𝑃), (2^nd ‘𝑃)⟩)
19	16, 17, 18	3syl 18	. . . . . . 7 ⊢ (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → 𝑃 = ⟨(1^st ‘𝑃), (2^nd ‘𝑃)⟩)
20	19	oveq1d 7411	. . . . . 6 ⊢ (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → (𝑃 Lan 𝐸) = (⟨(1^st ‘𝑃), (2^nd ‘𝑃)⟩ Lan 𝐸))
21		eqid 2762	. . . . . . 7 ⊢ ((2^nd ‘𝑃) FuncCat 𝐸) = ((2^nd ‘𝑃) FuncCat 𝐸)
22		eqid 2762	. . . . . . 7 ⊢ ((1^st ‘𝑃) FuncCat 𝐸) = ((1^st ‘𝑃) FuncCat 𝐸)
23		fvexd 6882	. . . . . . 7 ⊢ (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → (1^st ‘𝑃) ∈ V)
24		fvexd 6882	. . . . . . 7 ⊢ (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → (2^nd ‘𝑃) ∈ V)
25		opelxp2 5690	. . . . . . . 8 ⊢ (⟨𝑃, 𝐸⟩ ∈ ((V × V) × V) → 𝐸 ∈ V)
26	16, 25	syl 17	. . . . . . 7 ⊢ (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → 𝐸 ∈ V)
27	21, 22, 23, 24, 26	lanfval 50234	. . . . . 6 ⊢ (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → (⟨(1^st ‘𝑃), (2^nd ‘𝑃)⟩ Lan 𝐸) = (𝑓 ∈ ((1^st ‘𝑃) Func (2^nd ‘𝑃)), 𝑥 ∈ ((1^st ‘𝑃) Func 𝐸) ↦ ((⟨(2^nd ‘𝑃), 𝐸⟩ −∘_F 𝑓)(((2^nd ‘𝑃) FuncCat 𝐸) UP ((1^st ‘𝑃) FuncCat 𝐸))𝑥)))
28	20, 27	eqtrd 2797	. . . . 5 ⊢ (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → (𝑃 Lan 𝐸) = (𝑓 ∈ ((1^st ‘𝑃) Func (2^nd ‘𝑃)), 𝑥 ∈ ((1^st ‘𝑃) Func 𝐸) ↦ ((⟨(2^nd ‘𝑃), 𝐸⟩ −∘_F 𝑓)(((2^nd ‘𝑃) FuncCat 𝐸) UP ((1^st ‘𝑃) FuncCat 𝐸))𝑥)))
29	28	dmeqd 5881	. . . 4 ⊢ (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → dom (𝑃 Lan 𝐸) = dom (𝑓 ∈ ((1^st ‘𝑃) Func (2^nd ‘𝑃)), 𝑥 ∈ ((1^st ‘𝑃) Func 𝐸) ↦ ((⟨(2^nd ‘𝑃), 𝐸⟩ −∘_F 𝑓)(((2^nd ‘𝑃) FuncCat 𝐸) UP ((1^st ‘𝑃) FuncCat 𝐸))𝑥)))
30	29	releqd 5751	. . 3 ⊢ (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → (Rel dom (𝑃 Lan 𝐸) ↔ Rel dom (𝑓 ∈ ((1^st ‘𝑃) Func (2^nd ‘𝑃)), 𝑥 ∈ ((1^st ‘𝑃) Func 𝐸) ↦ ((⟨(2^nd ‘𝑃), 𝐸⟩ −∘_F 𝑓)(((2^nd ‘𝑃) FuncCat 𝐸) UP ((1^st ‘𝑃) FuncCat 𝐸))𝑥))))
31	11, 30	mpbiri 260	. 2 ⊢ (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → Rel dom (𝑃 Lan 𝐸))
32	9, 31	pm2.61ine 3040	1 ⊢ Rel dom (𝑃 Lan 𝐸)

Colors of variables: wff setvar class

Syntax hints: = wceq 1560 ∈ wcel 2142 ≠ wne 2957 Vcvv 3454 ∅c0 4285 {csn 4582 ⟨cop 4588 × cxp 5645 dom cdm 5647 ↾ cres 5649 Rel wrel 5652 Fun wfun 6515 ‘cfv 6521 (class class class)co 7396 ∈ cmpo 7398 1^st c1st 7968 2^nd c2nd 7969 Func cfunc 17887 FuncCat cfuc 17978 UP cup 49794 −∘_F cprcof 49994 Lan clan 50226

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5227 ax-sep 5246 ax-nul 5256 ax-pow 5322 ax-pr 5390 ax-un 7718

This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3077 df-rex 3087 df-reu 3368 df-rab 3415 df-v 3456 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-ov 7399 df-oprab 7400 df-mpo 7401 df-1st 7970 df-2nd 7971 df-lan 50228

This theorem is referenced by: (None)

W3C validator