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 50724
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 5776 . . 3 Rel ∅
2 df-ov 7423 . . . . . . 7 (𝑃 Lan 𝐸) = ( Lan ‘⟨𝑃, 𝐸⟩)
3 id 23 . . . . . . 7 (( Lan ‘⟨𝑃, 𝐸⟩) = ∅ → ( Lan ‘⟨𝑃, 𝐸⟩) = ∅)
42, 3eqtrid 2808 . . . . . 6 (( Lan ‘⟨𝑃, 𝐸⟩) = ∅ → (𝑃 Lan 𝐸) = ∅)
54dmeqd 5887 . . . . 5 (( Lan ‘⟨𝑃, 𝐸⟩) = ∅ → dom (𝑃 Lan 𝐸) = dom ∅)
6 dm0 5902 . . . . 5 dom ∅ = ∅
75, 6eqtrdi 2812 . . . 4 (( Lan ‘⟨𝑃, 𝐸⟩) = ∅ → dom (𝑃 Lan 𝐸) = ∅)
87releqd 5755 . . 3 (( Lan ‘⟨𝑃, 𝐸⟩) = ∅ → (Rel dom (𝑃 Lan 𝐸) ↔ Rel ∅))
91, 8mpbiri 261 . 2 (( Lan ‘⟨𝑃, 𝐸⟩) = ∅ → Rel dom (𝑃 Lan 𝐸))
10 eqid 2761 . . . 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 7554 . . 3 Rel dom (𝑓 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)), 𝑥 ∈ ((1st ‘𝑃) Func 𝐸) ↦ ((⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝑓)(((2nd ‘𝑃) FuncCat 𝐸) UP ((1st ‘𝑃) FuncCat 𝐸))𝑥))
12 fvfundmfvn0 6925 . . . . . . . . . 10 (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → (⟨𝑃, 𝐸⟩ ∈ dom Lan ∧ Fun ( Lan ↾ {⟨𝑃, 𝐸⟩})))
1312simpld 500 . . . . . . . . 9 (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → ⟨𝑃, 𝐸⟩ ∈ dom Lan )
14 lanfn 50716 . . . . . . . . . 10 Lan Fn ((V × V) × V)
1514fndmi 6643 . . . . . . . . 9 dom Lan = ((V × V) × V)
1613, 15eleqtrdi 2871 . . . . . . . 8 (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → ⟨𝑃, 𝐸⟩ ∈ ((V × V) × V))
17 opelxp1 5693 . . . . . . . 8 (⟨𝑃, 𝐸⟩ ∈ ((V × V) × V) → 𝑃 ∈ (V × V))
18 1st2nd2 8040 . . . . . . . 8 (𝑃 ∈ (V × V) → 𝑃 = ⟨(1st ‘𝑃), (2nd ‘𝑃)⟩)
1916, 17, 183syl 19 . . . . . . 7 (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → 𝑃 = ⟨(1st ‘𝑃), (2nd ‘𝑃)⟩)
2019oveq1d 7435 . . . . . 6 (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → (𝑃 Lan 𝐸) = (⟨(1st ‘𝑃), (2nd ‘𝑃)⟩ Lan 𝐸))
21 eqid 2761 . . . . . . 7 ((2nd ‘𝑃) FuncCat 𝐸) = ((2nd ‘𝑃) FuncCat 𝐸)
22 eqid 2761 . . . . . . 7 ((1st ‘𝑃) FuncCat 𝐸) = ((1st ‘𝑃) FuncCat 𝐸)
23 fvexd 6900 . . . . . . 7 (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → (1st ‘𝑃) ∈ V)
24 fvexd 6900 . . . . . . 7 (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → (2nd ‘𝑃) ∈ V)
25 opelxp2 5694 . . . . . . . 8 (⟨𝑃, 𝐸⟩ ∈ ((V × V) × V) → 𝐸 ∈ V)
2616, 25syl 18 . . . . . . 7 (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → 𝐸 ∈ V)
2721, 22, 23, 24, 26lanfval 50720 . . . . . 6 (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → (⟨(1st ‘𝑃), (2nd ‘𝑃)⟩ Lan 𝐸) = (𝑓 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)), 𝑥 ∈ ((1st ‘𝑃) Func 𝐸) ↦ ((⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝑓)(((2nd ‘𝑃) FuncCat 𝐸) UP ((1st ‘𝑃) FuncCat 𝐸))𝑥)))
2820, 27eqtrd 2796 . . . . 5 (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → (𝑃 Lan 𝐸) = (𝑓 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)), 𝑥 ∈ ((1st ‘𝑃) Func 𝐸) ↦ ((⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝑓)(((2nd ‘𝑃) FuncCat 𝐸) UP ((1st ‘𝑃) FuncCat 𝐸))𝑥)))
2928dmeqd 5887 . . . 4 (( Lan ‘⟨𝑃, 𝐸⟩) ≠ ∅ → dom (𝑃 Lan 𝐸) = dom (𝑓 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)), 𝑥 ∈ ((1st ‘𝑃) Func 𝐸) ↦ ((⟨(2nd ‘𝑃), 𝐸⟩ −∘F 𝑓)(((2nd ‘𝑃) FuncCat 𝐸) UP ((1st ‘𝑃) FuncCat 𝐸))𝑥)))
3029releqd 5755 . . 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 3039 1 Rel dom (𝑃 Lan 𝐸)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570   ∈ wcel 2145   ≠ wne 2956  Vcvv 3451  ∅c0 4279  {csn 4584  ⟨cop 4590   × cxp 5649  dom cdm 5651   ↾ cres 5653  Rel wrel 5656  Fun wfun 6532  ‘cfv 6538  (class class class)co 7420   ∈ cmpo 7422  1st c1st 7999  2nd c2nd 8000   Func cfunc 18029   FuncCat cfuc 18120   UP cup 50280   −∘F cprcof 50480   Lan clan 50712
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-lan 50714
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator