| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > natixp | Structured version Visualization version GIF version | ||
| Description: A natural transformation is a function from the objects of 𝐶 to homomorphisms from 𝐹(𝑥) to 𝐺(𝑥). (Contributed by Mario Carneiro, 6-Jan-2017.) |
| Ref | Expression |
|---|---|
| natrcl.1 | ⊢ 𝑁 = (𝐶 Nat 𝐷) |
| natixp.2 | ⊢ (𝜑 → 𝐴 ∈ (〈𝐹, 𝐺〉𝑁〈𝐾, 𝐿〉)) |
| natixp.b | ⊢ 𝐵 = (Base‘𝐶) |
| natixp.j | ⊢ 𝐽 = (Hom ‘𝐷) |
| Ref | Expression |
|---|---|
| natixp | ⊢ (𝜑 → 𝐴 ∈ X𝑥 ∈ 𝐵 ((𝐹‘𝑥)𝐽(𝐾‘𝑥))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | natixp.2 | . . 3 ⊢ (𝜑 → 𝐴 ∈ (〈𝐹, 𝐺〉𝑁〈𝐾, 𝐿〉)) | |
| 2 | natrcl.1 | . . . 4 ⊢ 𝑁 = (𝐶 Nat 𝐷) | |
| 3 | natixp.b | . . . 4 ⊢ 𝐵 = (Base‘𝐶) | |
| 4 | eqid 2763 | . . . 4 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶) | |
| 5 | natixp.j | . . . 4 ⊢ 𝐽 = (Hom ‘𝐷) | |
| 6 | eqid 2763 | . . . 4 ⊢ (comp‘𝐷) = (comp‘𝐷) | |
| 7 | 2 | natrcl 18178 | . . . . . . 7 ⊢ (𝐴 ∈ (〈𝐹, 𝐺〉𝑁〈𝐾, 𝐿〉) → (〈𝐹, 𝐺〉 ∈ (𝐶 Func 𝐷) ∧ 〈𝐾, 𝐿〉 ∈ (𝐶 Func 𝐷))) |
| 8 | 1, 7 | syl 18 | . . . . . 6 ⊢ (𝜑 → (〈𝐹, 𝐺〉 ∈ (𝐶 Func 𝐷) ∧ 〈𝐾, 𝐿〉 ∈ (𝐶 Func 𝐷))) |
| 9 | 8 | simpld 500 | . . . . 5 ⊢ (𝜑 → 〈𝐹, 𝐺〉 ∈ (𝐶 Func 𝐷)) |
| 10 | df-br 5109 | . . . . 5 ⊢ (𝐹(𝐶 Func 𝐷)𝐺 ↔ 〈𝐹, 𝐺〉 ∈ (𝐶 Func 𝐷)) | |
| 11 | 9, 10 | sylibr 237 | . . . 4 ⊢ (𝜑 → 𝐹(𝐶 Func 𝐷)𝐺) |
| 12 | 8 | simprd 501 | . . . . 5 ⊢ (𝜑 → 〈𝐾, 𝐿〉 ∈ (𝐶 Func 𝐷)) |
| 13 | df-br 5109 | . . . . 5 ⊢ (𝐾(𝐶 Func 𝐷)𝐿 ↔ 〈𝐾, 𝐿〉 ∈ (𝐶 Func 𝐷)) | |
| 14 | 12, 13 | sylibr 237 | . . . 4 ⊢ (𝜑 → 𝐾(𝐶 Func 𝐷)𝐿) |
| 15 | 2, 3, 4, 5, 6, 11, 14 | isnat 18175 | . . 3 ⊢ (𝜑 → (𝐴 ∈ (〈𝐹, 𝐺〉𝑁〈𝐾, 𝐿〉) ↔ (𝐴 ∈ X𝑥 ∈ 𝐵 ((𝐹‘𝑥)𝐽(𝐾‘𝑥)) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ (𝑥(Hom ‘𝐶)𝑦)((𝐴‘𝑦)(〈(𝐹‘𝑥), (𝐹‘𝑦)〉(comp‘𝐷)(𝐾‘𝑦))((𝑥𝐺𝑦)‘𝑧)) = (((𝑥𝐿𝑦)‘𝑧)(〈(𝐹‘𝑥), (𝐾‘𝑥)〉(comp‘𝐷)(𝐾‘𝑦))(𝐴‘𝑥))))) |
| 16 | 1, 15 | mpbid 235 | . 2 ⊢ (𝜑 → (𝐴 ∈ X𝑥 ∈ 𝐵 ((𝐹‘𝑥)𝐽(𝐾‘𝑥)) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ (𝑥(Hom ‘𝐶)𝑦)((𝐴‘𝑦)(〈(𝐹‘𝑥), (𝐹‘𝑦)〉(comp‘𝐷)(𝐾‘𝑦))((𝑥𝐺𝑦)‘𝑧)) = (((𝑥𝐿𝑦)‘𝑧)(〈(𝐹‘𝑥), (𝐾‘𝑥)〉(comp‘𝐷)(𝐾‘𝑦))(𝐴‘𝑥)))) |
| 17 | 16 | simpld 500 | 1 ⊢ (𝜑 → 𝐴 ∈ X𝑥 ∈ 𝐵 ((𝐹‘𝑥)𝐽(𝐾‘𝑥))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ∀wral 3080 〈cop 4840 class class class wbr 5108 ‘cfv 6566 (class class class)co 7451 Xcixp 8963 Basecbs 17431 Hom chom 17483 compcco 17484 Func cfunc 18079 Nat cnat 18169 |
| 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-ixp 8964 df-func 18083 df-nat 18171 |
| This theorem is used by: natcl 18181 natfn 18182 |
| Copyright terms: Public domain | W3C validator |