Theorem fucoelvv 48889

Description: A functor composition bifunctor is an ordered pair. Enables 1st2ndb 8062. (Contributed by Zhi Wang, 29-Sep-2025.)

Hypotheses

Ref	Expression
fucofval.c	⊢ (𝜑 → 𝐶 ∈ 𝑇)
fucofval.d	⊢ (𝜑 → 𝐷 ∈ 𝑈)
fucofval.e	⊢ (𝜑 → 𝐸 ∈ 𝑉)
fucofval.o	⊢ (𝜑 → (⟨𝐶, 𝐷⟩ ∘F 𝐸) = ⚬ )

Assertion

Ref	Expression
fucoelvv	⊢ (𝜑 → ⚬ ∈ (V × V))

Proof of Theorem fucoelvv

Dummy variables 𝑎 𝑏 𝑓 𝑔 𝑘 𝑙 𝑚 𝑟 𝑢 𝑣 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fucofval.c	. . 3 ⊢ (𝜑 → 𝐶 ∈ 𝑇)
2		fucofval.d	. . 3 ⊢ (𝜑 → 𝐷 ∈ 𝑈)
3		fucofval.e	. . 3 ⊢ (𝜑 → 𝐸 ∈ 𝑉)
4		fucofval.o	. . 3 ⊢ (𝜑 → (⟨𝐶, 𝐷⟩ ∘F 𝐸) = ⚬ )
5		eqidd 2738	. . 3 ⊢ (𝜑 → ((𝐷 Func 𝐸) × (𝐶 Func 𝐷)) = ((𝐷 Func 𝐸) × (𝐶 Func 𝐷)))
6	1, 2, 3, 4, 5	fucofval 48888	. 2 ⊢ (𝜑 → ⚬ = ⟨( ∘func ↾ ((𝐷 Func 𝐸) × (𝐶 Func 𝐷))), (𝑢 ∈ ((𝐷 Func 𝐸) × (𝐶 Func 𝐷)), 𝑣 ∈ ((𝐷 Func 𝐸) × (𝐶 Func 𝐷)) ↦ ⦋(1st ‘(2nd ‘𝑢)) / 𝑓⦌⦋(1st ‘(1st ‘𝑢)) / 𝑘⦌⦋(2nd ‘(1st ‘𝑢)) / 𝑙⦌⦋(1st ‘(2nd ‘𝑣)) / 𝑚⦌⦋(1st ‘(1st ‘𝑣)) / 𝑟⦌(𝑏 ∈ ((1st ‘𝑢)(𝐷 Nat 𝐸)(1st ‘𝑣)), 𝑎 ∈ ((2nd ‘𝑢)(𝐶 Nat 𝐷)(2nd ‘𝑣)) ↦ (𝑥 ∈ (Base‘𝐶) ↦ ((𝑏‘(𝑚‘𝑥))(⟨(𝑘‘(𝑓‘𝑥)), (𝑘‘(𝑚‘𝑥))⟩(comp‘𝐸)(𝑟‘(𝑚‘𝑥)))(((𝑓‘𝑥)𝑙(𝑚‘𝑥))‘(𝑎‘𝑥))))))⟩)
7		df-cofu 17920	. . . . 5 ⊢ ∘func = (𝑔 ∈ V, 𝑓 ∈ V ↦ ⟨((1st ‘𝑔) ∘ (1st ‘𝑓)), (𝑥 ∈ dom dom (2nd ‘𝑓), 𝑦 ∈ dom dom (2nd ‘𝑓) ↦ ((((1st ‘𝑓)‘𝑥)(2nd ‘𝑔)((1st ‘𝑓)‘𝑦)) ∘ (𝑥(2nd ‘𝑓)𝑦)))⟩)
8	7	mpofun 7564	. . . 4 ⊢ Fun ∘func
9		ovex 7471	. . . . 5 ⊢ (𝐷 Func 𝐸) ∈ V
10		ovex 7471	. . . . 5 ⊢ (𝐶 Func 𝐷) ∈ V
11	9, 10	xpex 7779	. . . 4 ⊢ ((𝐷 Func 𝐸) × (𝐶 Func 𝐷)) ∈ V
12		resfunexg 7242	. . . 4 ⊢ ((Fun ∘func ∧ ((𝐷 Func 𝐸) × (𝐶 Func 𝐷)) ∈ V) → ( ∘func ↾ ((𝐷 Func 𝐸) × (𝐶 Func 𝐷))) ∈ V)
13	8, 11, 12	mp2an 692	. . 3 ⊢ ( ∘func ↾ ((𝐷 Func 𝐸) × (𝐶 Func 𝐷))) ∈ V
14	11, 11	mpoex 8112	. . 3 ⊢ (𝑢 ∈ ((𝐷 Func 𝐸) × (𝐶 Func 𝐷)), 𝑣 ∈ ((𝐷 Func 𝐸) × (𝐶 Func 𝐷)) ↦ ⦋(1st ‘(2nd ‘𝑢)) / 𝑓⦌⦋(1st ‘(1st ‘𝑢)) / 𝑘⦌⦋(2nd ‘(1st ‘𝑢)) / 𝑙⦌⦋(1st ‘(2nd ‘𝑣)) / 𝑚⦌⦋(1st ‘(1st ‘𝑣)) / 𝑟⦌(𝑏 ∈ ((1st ‘𝑢)(𝐷 Nat 𝐸)(1st ‘𝑣)), 𝑎 ∈ ((2nd ‘𝑢)(𝐶 Nat 𝐷)(2nd ‘𝑣)) ↦ (𝑥 ∈ (Base‘𝐶) ↦ ((𝑏‘(𝑚‘𝑥))(⟨(𝑘‘(𝑓‘𝑥)), (𝑘‘(𝑚‘𝑥))⟩(comp‘𝐸)(𝑟‘(𝑚‘𝑥)))(((𝑓‘𝑥)𝑙(𝑚‘𝑥))‘(𝑎‘𝑥)))))) ∈ V
15	13, 14	opelvv 5733	. 2 ⊢ ⟨( ∘func ↾ ((𝐷 Func 𝐸) × (𝐶 Func 𝐷))), (𝑢 ∈ ((𝐷 Func 𝐸) × (𝐶 Func 𝐷)), 𝑣 ∈ ((𝐷 Func 𝐸) × (𝐶 Func 𝐷)) ↦ ⦋(1st ‘(2nd ‘𝑢)) / 𝑓⦌⦋(1st ‘(1st ‘𝑢)) / 𝑘⦌⦋(2nd ‘(1st ‘𝑢)) / 𝑙⦌⦋(1st ‘(2nd ‘𝑣)) / 𝑚⦌⦋(1st ‘(1st ‘𝑣)) / 𝑟⦌(𝑏 ∈ ((1st ‘𝑢)(𝐷 Nat 𝐸)(1st ‘𝑣)), 𝑎 ∈ ((2nd ‘𝑢)(𝐶 Nat 𝐷)(2nd ‘𝑣)) ↦ (𝑥 ∈ (Base‘𝐶) ↦ ((𝑏‘(𝑚‘𝑥))(⟨(𝑘‘(𝑓‘𝑥)), (𝑘‘(𝑚‘𝑥))⟩(comp‘𝐸)(𝑟‘(𝑚‘𝑥)))(((𝑓‘𝑥)𝑙(𝑚‘𝑥))‘(𝑎‘𝑥))))))⟩ ∈ (V × V)
16	6, 15	eqeltrdi 2849	1 ⊢ (𝜑 → ⚬ ∈ (V × V))

Syntax hints:   → wi 4   = wceq 1539   ∈ wcel 2108  Vcvv 3481  ⦋csb 3911  ⟨cop 4640   ↦ cmpt 5234   × cxp 5691  dom cdm 5693   ↾ cres 5695   ∘ ccom 5697  Fun wfun 6563  ‘cfv 6569  (class class class)co 7438   ∈ cmpo 7440  1^st c1st 8020  2^nd c2nd 8021  Basecbs 17254  compcco 17319   Func cfunc 17914   ∘_func ccofu 17916   Nat cnat 18005   ∘_F cfuco 48885

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-rep 5288  ax-sep 5305  ax-nul 5315  ax-pow 5374  ax-pr 5441  ax-un 7761

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3381  df-rab 3437  df-v 3483  df-sbc 3795  df-csb 3912  df-dif 3969  df-un 3971  df-in 3973  df-ss 3983  df-nul 4343  df-if 4535  df-pw 4610  df-sn 4635  df-pr 4637  df-op 4641  df-uni 4916  df-iun 5001  df-br 5152  df-opab 5214  df-mpt 5235  df-id 5587  df-xp 5699  df-rel 5700  df-cnv 5701  df-co 5702  df-dm 5703  df-rn 5704  df-res 5705  df-ima 5706  df-iota 6522  df-fun 6571  df-fn 6572  df-f 6573  df-f1 6574  df-fo 6575  df-f1o 6576  df-fv 6577  df-ov 7441  df-oprab 7442  df-mpo 7443  df-1st 8022  df-2nd 8023  df-cofu 17920  df-fuco 48886

This theorem is referenced by:  fuco1  48890  fuco2  48892