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

Theorem reldmlan2 50939
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.
StepHypRef Expression
1 rel0 5780 . . 3 Rel ∅
2 df-ov 7430 . . . . . . 7 (𝑃 Lan 𝐸) = ( Lan ‘⟨𝑃, 𝐸⟩)
3 id 23 . . . . . . 7 (( Lan ‘⟨𝑃, 𝐸⟩) = ∅ → ( Lan ‘⟨𝑃, 𝐸⟩) = ∅)
42, 3eqtrid 2810 . . . . . 6 (( Lan ‘⟨𝑃, 𝐸⟩) = ∅ → (𝑃 Lan 𝐸) = ∅)
54dmeqd 5891 . . . . 5 (( Lan ‘⟨𝑃, 𝐸⟩) = ∅ → dom (𝑃 Lan 𝐸) = dom ∅)
6 dm0 5906 . . . . 5 dom ∅ = ∅
75, 6eqtrdi 2814 . . . 4 (( Lan ‘⟨𝑃, 𝐸⟩) = ∅ → dom (𝑃 Lan 𝐸) = ∅)
87releqd 5759 . . 3 (( Lan ‘⟨𝑃, 𝐸⟩) = ∅ → (Rel dom (𝑃 Lan 𝐸) ↔ Rel ∅))
91, 8mpbiri 261 . 2 (( Lan ‘⟨𝑃, 𝐸⟩) = ∅ → Rel dom (𝑃 Lan 𝐸))
10 eqid 2763 . . . 4 (𝑓 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)), 𝑥 ∈ ((1st ‘𝑃) Func 𝐸) ↦ ((⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝑓)(((2nd ‘𝑃) FuncCat 𝐸) UP ((1st ‘𝑃) FuncCat 𝐸))𝑥)) = (𝑓 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)), 𝑥 ∈ ((1st ‘𝑃) Func 𝐸) ↦ ((⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝑓)(((2nd ‘𝑃) FuncCat 𝐸) UP ((1st ‘𝑃) FuncCat 𝐸))𝑥))
1110reldmmpo 7561 . . 3 Rel dom (𝑓 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)), 𝑥 ∈ ((1st ‘𝑃) Func 𝐸) ↦ ((⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝑓)(((2nd ‘𝑃) FuncCat 𝐸) UP ((1st ‘𝑃) FuncCat 𝐸))𝑥))
12 fvfundmfvn0 6933 . . . . . . . . . 10 (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → (⟨𝑃, 𝐸⟩ ∈ dom Lan ∧ Fun ( Lan ↾ {⟨𝑃, 𝐸⟩})))
1312simpld 500 . . . . . . . . 9 (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → ⟨𝑃, 𝐸⟩ ∈ dom Lan )
14 lanfn 50931 . . . . . . . . . 10 Lan Fn ((V × V) × V)
1514fndmi 6651 . . . . . . . . 9 dom Lan = ((V × V) × V)
1613, 15eleqtrdi 2873 . . . . . . . 8 (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → ⟨𝑃, 𝐸⟩ ∈ ((V × V) × V))
17 opelxp1 5696 . . . . . . . 8 (⟨𝑃, 𝐸⟩ ∈ ((V × V) × V) → 𝑃 ∈ (V × V))
18 1st2nd2 8047 . . . . . . . 8 (𝑃 ∈ (V × V) → 𝑃 = ⟨(1st ‘𝑃), (2nd ‘𝑃)⟩)
1916, 17, 183syl 19 . . . . . . 7 (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → 𝑃 = ⟨(1st ‘𝑃), (2nd ‘𝑃)⟩)
2019oveq1d 7442 . . . . . 6 (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → (𝑃 Lan 𝐸) = (⟨(1st ‘𝑃), (2nd ‘𝑃)⟩ Lan 𝐸))
21 eqid 2763 . . . . . . 7 ((2nd ‘𝑃) FuncCat 𝐸) = ((2nd ‘𝑃) FuncCat 𝐸)
22 eqid 2763 . . . . . . 7 ((1st ‘𝑃) FuncCat 𝐸) = ((1st ‘𝑃) FuncCat 𝐸)
23 fvexd 6908 . . . . . . 7 (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → (1st ‘𝑃) ∈ V)
24 fvexd 6908 . . . . . . 7 (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → (2nd ‘𝑃) ∈ V)
25 opelxp2 5697 . . . . . . . 8 (⟨𝑃, 𝐸⟩ ∈ ((V × V) × V) → 𝐸 ∈ V)
2616, 25syl 18 . . . . . . 7 (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → 𝐸 ∈ V)
2721, 22, 23, 24, 26lanfval 50935 . . . . . 6 (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → (⟨(1st ‘𝑃), (2nd ‘𝑃)⟩ Lan 𝐸) = (𝑓 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)), 𝑥 ∈ ((1st ‘𝑃) Func 𝐸) ↦ ((⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝑓)(((2nd ‘𝑃) FuncCat 𝐸) UP ((1st ‘𝑃) FuncCat 𝐸))𝑥)))
2820, 27eqtrd 2798 . . . . 5 (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → (𝑃 Lan 𝐸) = (𝑓 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)), 𝑥 ∈ ((1st ‘𝑃) Func 𝐸) ↦ ((⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝑓)(((2nd ‘𝑃) FuncCat 𝐸) UP ((1st ‘𝑃) FuncCat 𝐸))𝑥)))
2928dmeqd 5891 . . . 4 (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → dom (𝑃 Lan 𝐸) = dom (𝑓 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)), 𝑥 ∈ ((1st ‘𝑃) Func 𝐸) ↦ ((⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝑓)(((2nd ‘𝑃) FuncCat 𝐸) UP ((1st ‘𝑃) FuncCat 𝐸))𝑥)))
3029releqd 5759 . . 3 (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → (Rel dom (𝑃 Lan 𝐸) ↔ Rel dom (𝑓 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)), 𝑥 ∈ ((1st ‘𝑃) Func 𝐸) ↦ ((⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝑓)(((2nd ‘𝑃) FuncCat 𝐸) UP ((1st ‘𝑃) FuncCat 𝐸))𝑥))))
3111, 30mpbiri 261 . 2 (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → Rel dom (𝑃 Lan 𝐸))
329, 31pm2.61ine 3041 1 Rel dom (𝑃 Lan 𝐸)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1569   ∈ wcel 2146   ≠ wne 2958  Vcvv 3453  ∅c0 4280  {csn 4587  ⟨cop 4837   × cxp 5652  dom cdm 5654   ↾ cres 5656  Rel wrel 5659  Fun wfun 6540  ‘cfv 6546  (class class class)co 7427   ∈ cmpo 7429  1st c1st 8006  2nd c2nd 8007   Func cfunc 18041   FuncCat cfuc 18132   UP cup 50428   −∘F cprcof 50647   Lan clan 50927
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-rep 5234  ax-sep 5251  ax-nul 5262  ax-pow 5330  ax-pr 5394  ax-un 7758
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-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-iun 4955  df-br 5106  df-opab 5170  df-mpt 5189  df-id 5549  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-iota 6500  df-fun 6548  df-fn 6549  df-f 6550  df-f1 6551  df-fo 6552  df-f1o 6553  df-fv 6554  df-ov 7430  df-oprab 7431  df-mpo 7432  df-1st 8008  df-2nd 8009  df-lan 50929
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator