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

Theorem reldmprcof1 50908
Description: The domain of the object part of the pre-composition functor is a relation. (Contributed by Zhi Wang, 2-Nov-2025.)
Assertion
Ref Expression
reldmprcof1 Rel dom (1st ‘(𝑃 −∘F 𝐹))

Proof of Theorem reldmprcof1
Dummy variables 𝑎 𝑘 𝑙 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relfunc 18087 . . . 4 Rel ((1st ‘𝑃) Func (2nd ‘𝑃))
2 ovex 7484 . . . . . 6 (𝑘 ∘func 𝐹) ∈ V
3 eqid 2763 . . . . . 6 (𝑘 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)) ↦ (𝑘 ∘func 𝐹)) = (𝑘 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)) ↦ (𝑘 ∘func 𝐹))
42, 3dmmpti 6713 . . . . 5 dom (𝑘 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)) ↦ (𝑘 ∘func 𝐹)) = ((1st ‘𝑃) Func (2nd ‘𝑃))
54releqi 5762 . . . 4 (Rel dom (𝑘 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)) ↦ (𝑘 ∘func 𝐹)) ↔ Rel ((1st ‘𝑃) Func (2nd ‘𝑃)))
61, 5mpbir 234 . . 3 Rel dom (𝑘 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)) ↦ (𝑘 ∘func 𝐹))
7 eqid 2763 . . . . . . 7 ((1st ‘𝑃) Func (2nd ‘𝑃)) = ((1st ‘𝑃) Func (2nd ‘𝑃))
8 eqid 2763 . . . . . . 7 ((1st ‘𝑃) Nat (2nd ‘𝑃)) = ((1st ‘𝑃) Nat (2nd ‘𝑃))
9 simpr 490 . . . . . . 7 ((𝑃 ∈ V ∧ 𝐹 ∈ V) → 𝐹 ∈ V)
10 simpl 488 . . . . . . 7 ((𝑃 ∈ V ∧ 𝐹 ∈ V) → 𝑃 ∈ V)
11 eqidd 2764 . . . . . . 7 ((𝑃 ∈ V ∧ 𝐹 ∈ V) → (1st ‘𝑃) = (1st ‘𝑃))
12 eqidd 2764 . . . . . . 7 ((𝑃 ∈ V ∧ 𝐹 ∈ V) → (2nd ‘𝑃) = (2nd ‘𝑃))
137, 8, 9, 10, 11, 12prcofvalg 50903 . . . . . 6 ((𝑃 ∈ V ∧ 𝐹 ∈ V) → (𝑃 −∘F 𝐹) = ⟨(𝑘 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)) ↦ (𝑘 ∘func 𝐹)), (𝑘 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)), 𝑙 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)) ↦ (𝑎 ∈ (𝑘((1st ‘𝑃) Nat (2nd ‘𝑃))𝑙) ↦ (𝑎 ∘ (1st ‘𝐹))))⟩)
14 ovex 7484 . . . . . . . 8 ((1st ‘𝑃) Func (2nd ‘𝑃)) ∈ V
1514mptex 7260 . . . . . . 7 (𝑘 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)) ↦ (𝑘 ∘func 𝐹)) ∈ V
1614, 14mpoex 8127 . . . . . . 7 (𝑘 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)), 𝑙 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)) ↦ (𝑎 ∈ (𝑘((1st ‘𝑃) Nat (2nd ‘𝑃))𝑙) ↦ (𝑎 ∘ (1st ‘𝐹)))) ∈ V
1715, 16op1std 8045 . . . . . 6 ((𝑃 −∘F 𝐹) = ⟨(𝑘 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)) ↦ (𝑘 ∘func 𝐹)), (𝑘 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)), 𝑙 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)) ↦ (𝑎 ∈ (𝑘((1st ‘𝑃) Nat (2nd ‘𝑃))𝑙) ↦ (𝑎 ∘ (1st ‘𝐹))))⟩ → (1st ‘(𝑃 −∘F 𝐹)) = (𝑘 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)) ↦ (𝑘 ∘func 𝐹)))
1813, 17syl 18 . . . . 5 ((𝑃 ∈ V ∧ 𝐹 ∈ V) → (1st ‘(𝑃 −∘F 𝐹)) = (𝑘 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)) ↦ (𝑘 ∘func 𝐹)))
1918dmeqd 5899 . . . 4 ((𝑃 ∈ V ∧ 𝐹 ∈ V) → dom (1st ‘(𝑃 −∘F 𝐹)) = dom (𝑘 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)) ↦ (𝑘 ∘func 𝐹)))
2019releqd 5763 . . 3 ((𝑃 ∈ V ∧ 𝐹 ∈ V) → (Rel dom (1st ‘(𝑃 −∘F 𝐹)) ↔ Rel dom (𝑘 ∈ ((1st ‘𝑃) Func (2nd ‘𝑃)) ↦ (𝑘 ∘func 𝐹))))
216, 20mpbiri 261 . 2 ((𝑃 ∈ V ∧ 𝐹 ∈ V) → Rel dom (1st ‘(𝑃 −∘F 𝐹)))
22 rel0 5785 . . 3 Rel ∅
23 reldmprcof 50902 . . . . . . . . 9 Rel dom −∘F
2423ovprc 7489 . . . . . . . 8 (¬ (𝑃 ∈ V ∧ 𝐹 ∈ V) → (𝑃 −∘F 𝐹) = ∅)
2524fveq2d 6920 . . . . . . 7 (¬ (𝑃 ∈ V ∧ 𝐹 ∈ V) → (1st ‘(𝑃 −∘F 𝐹)) = (1st ‘∅))
26 1st0 8041 . . . . . . 7 (1st ‘∅) = ∅
2725, 26eqtrdi 2814 . . . . . 6 (¬ (𝑃 ∈ V ∧ 𝐹 ∈ V) → (1st ‘(𝑃 −∘F 𝐹)) = ∅)
2827dmeqd 5899 . . . . 5 (¬ (𝑃 ∈ V ∧ 𝐹 ∈ V) → dom (1st ‘(𝑃 −∘F 𝐹)) = dom ∅)
29 dm0 5914 . . . . 5 dom ∅ = ∅
3028, 29eqtrdi 2814 . . . 4 (¬ (𝑃 ∈ V ∧ 𝐹 ∈ V) → dom (1st ‘(𝑃 −∘F 𝐹)) = ∅)
3130releqd 5763 . . 3 (¬ (𝑃 ∈ V ∧ 𝐹 ∈ V) → (Rel dom (1st ‘(𝑃 −∘F 𝐹)) ↔ Rel ∅))
3222, 31mpbiri 261 . 2 (¬ (𝑃 ∈ V ∧ 𝐹 ∈ V) → Rel dom (1st ‘(𝑃 −∘F 𝐹)))
3321, 32pm2.61i 184 1 Rel dom (1st ‘(𝑃 −∘F 𝐹))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454  ∅c0 4281  ⟨cop 4840   ↦ cmpt 5192  dom cdm 5658   ∘ ccom 5662  Rel wrel 5663  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453  1st c1st 8033  2nd c2nd 8034   Func cfunc 18079   ∘func ccofu 18081   Nat cnat 18169   −∘F cprcof 50900
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-func 18083  df-prcof 50901
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator