![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > natffn | Structured version Visualization version GIF version |
Description: The natural transformation set operation is a well-defined function. (Contributed by Mario Carneiro, 12-Jan-2017.) |
Ref | Expression |
---|---|
natrcl.1 | ⊢ 𝑁 = (𝐶 Nat 𝐷) |
Ref | Expression |
---|---|
natffn | ⊢ 𝑁 Fn ((𝐶 Func 𝐷) × (𝐶 Func 𝐷)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | natrcl.1 | . . 3 ⊢ 𝑁 = (𝐶 Nat 𝐷) | |
2 | eqid 2610 | . . 3 ⊢ (Base‘𝐶) = (Base‘𝐶) | |
3 | eqid 2610 | . . 3 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶) | |
4 | eqid 2610 | . . 3 ⊢ (Hom ‘𝐷) = (Hom ‘𝐷) | |
5 | eqid 2610 | . . 3 ⊢ (comp‘𝐷) = (comp‘𝐷) | |
6 | 1, 2, 3, 4, 5 | natfval 16429 | . 2 ⊢ 𝑁 = (𝑓 ∈ (𝐶 Func 𝐷), 𝑔 ∈ (𝐶 Func 𝐷) ↦ ⦋(1st ‘𝑓) / 𝑟⦌⦋(1st ‘𝑔) / 𝑠⦌{𝑎 ∈ X𝑥 ∈ (Base‘𝐶)((𝑟‘𝑥)(Hom ‘𝐷)(𝑠‘𝑥)) ∣ ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∀ℎ ∈ (𝑥(Hom ‘𝐶)𝑦)((𝑎‘𝑦)(〈(𝑟‘𝑥), (𝑟‘𝑦)〉(comp‘𝐷)(𝑠‘𝑦))((𝑥(2nd ‘𝑓)𝑦)‘ℎ)) = (((𝑥(2nd ‘𝑔)𝑦)‘ℎ)(〈(𝑟‘𝑥), (𝑠‘𝑥)〉(comp‘𝐷)(𝑠‘𝑦))(𝑎‘𝑥))}) |
7 | ovex 6577 | . . . . . . 7 ⊢ ((𝑟‘𝑥)(Hom ‘𝐷)(𝑠‘𝑥)) ∈ V | |
8 | 7 | rgenw 2908 | . . . . . 6 ⊢ ∀𝑥 ∈ (Base‘𝐶)((𝑟‘𝑥)(Hom ‘𝐷)(𝑠‘𝑥)) ∈ V |
9 | ixpexg 7818 | . . . . . 6 ⊢ (∀𝑥 ∈ (Base‘𝐶)((𝑟‘𝑥)(Hom ‘𝐷)(𝑠‘𝑥)) ∈ V → X𝑥 ∈ (Base‘𝐶)((𝑟‘𝑥)(Hom ‘𝐷)(𝑠‘𝑥)) ∈ V) | |
10 | 8, 9 | ax-mp 5 | . . . . 5 ⊢ X𝑥 ∈ (Base‘𝐶)((𝑟‘𝑥)(Hom ‘𝐷)(𝑠‘𝑥)) ∈ V |
11 | 10 | rabex 4740 | . . . 4 ⊢ {𝑎 ∈ X𝑥 ∈ (Base‘𝐶)((𝑟‘𝑥)(Hom ‘𝐷)(𝑠‘𝑥)) ∣ ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∀ℎ ∈ (𝑥(Hom ‘𝐶)𝑦)((𝑎‘𝑦)(〈(𝑟‘𝑥), (𝑟‘𝑦)〉(comp‘𝐷)(𝑠‘𝑦))((𝑥(2nd ‘𝑓)𝑦)‘ℎ)) = (((𝑥(2nd ‘𝑔)𝑦)‘ℎ)(〈(𝑟‘𝑥), (𝑠‘𝑥)〉(comp‘𝐷)(𝑠‘𝑦))(𝑎‘𝑥))} ∈ V |
12 | 11 | csbex 4721 | . . 3 ⊢ ⦋(1st ‘𝑔) / 𝑠⦌{𝑎 ∈ X𝑥 ∈ (Base‘𝐶)((𝑟‘𝑥)(Hom ‘𝐷)(𝑠‘𝑥)) ∣ ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∀ℎ ∈ (𝑥(Hom ‘𝐶)𝑦)((𝑎‘𝑦)(〈(𝑟‘𝑥), (𝑟‘𝑦)〉(comp‘𝐷)(𝑠‘𝑦))((𝑥(2nd ‘𝑓)𝑦)‘ℎ)) = (((𝑥(2nd ‘𝑔)𝑦)‘ℎ)(〈(𝑟‘𝑥), (𝑠‘𝑥)〉(comp‘𝐷)(𝑠‘𝑦))(𝑎‘𝑥))} ∈ V |
13 | 12 | csbex 4721 | . 2 ⊢ ⦋(1st ‘𝑓) / 𝑟⦌⦋(1st ‘𝑔) / 𝑠⦌{𝑎 ∈ X𝑥 ∈ (Base‘𝐶)((𝑟‘𝑥)(Hom ‘𝐷)(𝑠‘𝑥)) ∣ ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)∀ℎ ∈ (𝑥(Hom ‘𝐶)𝑦)((𝑎‘𝑦)(〈(𝑟‘𝑥), (𝑟‘𝑦)〉(comp‘𝐷)(𝑠‘𝑦))((𝑥(2nd ‘𝑓)𝑦)‘ℎ)) = (((𝑥(2nd ‘𝑔)𝑦)‘ℎ)(〈(𝑟‘𝑥), (𝑠‘𝑥)〉(comp‘𝐷)(𝑠‘𝑦))(𝑎‘𝑥))} ∈ V |
14 | 6, 13 | fnmpt2i 7128 | 1 ⊢ 𝑁 Fn ((𝐶 Func 𝐷) × (𝐶 Func 𝐷)) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1475 ∈ wcel 1977 ∀wral 2896 {crab 2900 Vcvv 3173 ⦋csb 3499 〈cop 4131 × cxp 5036 Fn wfn 5799 ‘cfv 5804 (class class class)co 6549 1st c1st 7057 2nd c2nd 7058 Xcixp 7794 Basecbs 15695 Hom chom 15779 compcco 15780 Func cfunc 16337 Nat cnat 16424 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-fal 1481 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-1st 7059 df-2nd 7060 df-ixp 7795 df-func 16341 df-nat 16426 |
This theorem is referenced by: fuchom 16444 |
Copyright terms: Public domain | W3C validator |