Theorem fucco 17227

Description: Value of the composition of natural transformations. (Contributed by Mario Carneiro, 6-Jan-2017.)

Hypotheses

Ref	Expression
fucco.q	⊢ 𝑄 = (𝐶 FuncCat 𝐷)
fucco.n	⊢ 𝑁 = (𝐶 Nat 𝐷)
fucco.a	⊢ 𝐴 = (Base‘𝐶)
fucco.o	⊢ · = (comp‘𝐷)
fucco.x	⊢ ∙ = (comp‘𝑄)
fucco.f	⊢ (𝜑 → 𝑅 ∈ (𝐹𝑁𝐺))
fucco.g	⊢ (𝜑 → 𝑆 ∈ (𝐺𝑁𝐻))

Assertion

Ref	Expression
fucco	⊢ (𝜑 → (𝑆(⟨𝐹, 𝐺⟩ ∙ 𝐻)𝑅) = (𝑥 ∈ 𝐴 ↦ ((𝑆‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑅‘𝑥))))

Distinct variable groups:   𝑥,𝐴   𝜑,𝑥   𝑥,𝑅   𝑥,𝑆   𝑥,𝐶   𝑥,𝐷   𝑥, ·   𝑥,𝐹   𝑥,𝐺   𝑥,𝐻

Allowed substitution hints:   𝑄(𝑥)   ∙ (𝑥)   𝑁(𝑥)

Proof of Theorem fucco

Dummy variables 𝑎 𝑏 𝑓 𝑔 ℎ 𝑣 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fucco.q	. . . 4 ⊢ 𝑄 = (𝐶 FuncCat 𝐷)
2		eqid 2820	. . . 4 ⊢ (𝐶 Func 𝐷) = (𝐶 Func 𝐷)
3		fucco.n	. . . 4 ⊢ 𝑁 = (𝐶 Nat 𝐷)
4		fucco.a	. . . 4 ⊢ 𝐴 = (Base‘𝐶)
5		fucco.o	. . . 4 ⊢ · = (comp‘𝐷)
6		fucco.f	. . . . . . . 8 ⊢ (𝜑 → 𝑅 ∈ (𝐹𝑁𝐺))
7	3	natrcl 17215	. . . . . . . 8 ⊢ (𝑅 ∈ (𝐹𝑁𝐺) → (𝐹 ∈ (𝐶 Func 𝐷) ∧ 𝐺 ∈ (𝐶 Func 𝐷)))
8	6, 7	syl 17	. . . . . . 7 ⊢ (𝜑 → (𝐹 ∈ (𝐶 Func 𝐷) ∧ 𝐺 ∈ (𝐶 Func 𝐷)))
9	8	simpld 497	. . . . . 6 ⊢ (𝜑 → 𝐹 ∈ (𝐶 Func 𝐷))
10		funcrcl 17128	. . . . . 6 ⊢ (𝐹 ∈ (𝐶 Func 𝐷) → (𝐶 ∈ Cat ∧ 𝐷 ∈ Cat))
11	9, 10	syl 17	. . . . 5 ⊢ (𝜑 → (𝐶 ∈ Cat ∧ 𝐷 ∈ Cat))
12	11	simpld 497	. . . 4 ⊢ (𝜑 → 𝐶 ∈ Cat)
13	11	simprd 498	. . . 4 ⊢ (𝜑 → 𝐷 ∈ Cat)
14		fucco.x	. . . 4 ⊢ ∙ = (comp‘𝑄)
15	1, 2, 3, 4, 5, 12, 13, 14	fuccofval 17224	. . 3 ⊢ (𝜑 → ∙ = (𝑣 ∈ ((𝐶 Func 𝐷) × (𝐶 Func 𝐷)), ℎ ∈ (𝐶 Func 𝐷) ↦ ⦋(1st ‘𝑣) / 𝑓⦌⦋(2nd ‘𝑣) / 𝑔⦌(𝑏 ∈ (𝑔𝑁ℎ), 𝑎 ∈ (𝑓𝑁𝑔) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝑓)‘𝑥), ((1st ‘𝑔)‘𝑥)⟩ · ((1st ‘ℎ)‘𝑥))(𝑎‘𝑥))))))
16		fvexd 6678	. . . 4 ⊢ ((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) → (1st ‘𝑣) ∈ V)
17		simprl 769	. . . . . 6 ⊢ ((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) → 𝑣 = ⟨𝐹, 𝐺⟩)
18	17	fveq2d 6667	. . . . 5 ⊢ ((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) → (1st ‘𝑣) = (1st ‘⟨𝐹, 𝐺⟩))
19		op1stg 7694	. . . . . . 7 ⊢ ((𝐹 ∈ (𝐶 Func 𝐷) ∧ 𝐺 ∈ (𝐶 Func 𝐷)) → (1st ‘⟨𝐹, 𝐺⟩) = 𝐹)
20	8, 19	syl 17	. . . . . 6 ⊢ (𝜑 → (1st ‘⟨𝐹, 𝐺⟩) = 𝐹)
21	20	adantr 483	. . . . 5 ⊢ ((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) → (1st ‘⟨𝐹, 𝐺⟩) = 𝐹)
22	18, 21	eqtrd 2855	. . . 4 ⊢ ((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) → (1st ‘𝑣) = 𝐹)
23		fvexd 6678	. . . . 5 ⊢ (((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) → (2nd ‘𝑣) ∈ V)
24	17	adantr 483	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) → 𝑣 = ⟨𝐹, 𝐺⟩)
25	24	fveq2d 6667	. . . . . 6 ⊢ (((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) → (2nd ‘𝑣) = (2nd ‘⟨𝐹, 𝐺⟩))
26		op2ndg 7695	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝐶 Func 𝐷) ∧ 𝐺 ∈ (𝐶 Func 𝐷)) → (2nd ‘⟨𝐹, 𝐺⟩) = 𝐺)
27	8, 26	syl 17	. . . . . . 7 ⊢ (𝜑 → (2nd ‘⟨𝐹, 𝐺⟩) = 𝐺)
28	27	ad2antrr 724	. . . . . 6 ⊢ (((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) → (2nd ‘⟨𝐹, 𝐺⟩) = 𝐺)
29	25, 28	eqtrd 2855	. . . . 5 ⊢ (((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) → (2nd ‘𝑣) = 𝐺)
30		simpr 487	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → 𝑔 = 𝐺)
31		simprr 771	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) → ℎ = 𝐻)
32	31	ad2antrr 724	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → ℎ = 𝐻)
33	30, 32	oveq12d 7167	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (𝑔𝑁ℎ) = (𝐺𝑁𝐻))
34		simplr 767	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → 𝑓 = 𝐹)
35	34, 30	oveq12d 7167	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (𝑓𝑁𝑔) = (𝐹𝑁𝐺))
36	34	fveq2d 6667	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (1st ‘𝑓) = (1st ‘𝐹))
37	36	fveq1d 6665	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → ((1st ‘𝑓)‘𝑥) = ((1st ‘𝐹)‘𝑥))
38	30	fveq2d 6667	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (1st ‘𝑔) = (1st ‘𝐺))
39	38	fveq1d 6665	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → ((1st ‘𝑔)‘𝑥) = ((1st ‘𝐺)‘𝑥))
40	37, 39	opeq12d 4804	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → ⟨((1st ‘𝑓)‘𝑥), ((1st ‘𝑔)‘𝑥)⟩ = ⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩)
41	32	fveq2d 6667	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (1st ‘ℎ) = (1st ‘𝐻))
42	41	fveq1d 6665	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → ((1st ‘ℎ)‘𝑥) = ((1st ‘𝐻)‘𝑥))
43	40, 42	oveq12d 7167	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (⟨((1st ‘𝑓)‘𝑥), ((1st ‘𝑔)‘𝑥)⟩ · ((1st ‘ℎ)‘𝑥)) = (⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥)))
44	43	oveqd 7166	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → ((𝑏‘𝑥)(⟨((1st ‘𝑓)‘𝑥), ((1st ‘𝑔)‘𝑥)⟩ · ((1st ‘ℎ)‘𝑥))(𝑎‘𝑥)) = ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥)))
45	44	mpteq2dv 5155	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝑓)‘𝑥), ((1st ‘𝑔)‘𝑥)⟩ · ((1st ‘ℎ)‘𝑥))(𝑎‘𝑥))) = (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥))))
46	33, 35, 45	mpoeq123dv 7222	. . . . 5 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (𝑏 ∈ (𝑔𝑁ℎ), 𝑎 ∈ (𝑓𝑁𝑔) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝑓)‘𝑥), ((1st ‘𝑔)‘𝑥)⟩ · ((1st ‘ℎ)‘𝑥))(𝑎‘𝑥)))) = (𝑏 ∈ (𝐺𝑁𝐻), 𝑎 ∈ (𝐹𝑁𝐺) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥)))))
47	23, 29, 46	csbied2 3913	. . . 4 ⊢ (((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) → ⦋(2nd ‘𝑣) / 𝑔⦌(𝑏 ∈ (𝑔𝑁ℎ), 𝑎 ∈ (𝑓𝑁𝑔) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝑓)‘𝑥), ((1st ‘𝑔)‘𝑥)⟩ · ((1st ‘ℎ)‘𝑥))(𝑎‘𝑥)))) = (𝑏 ∈ (𝐺𝑁𝐻), 𝑎 ∈ (𝐹𝑁𝐺) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥)))))
48	16, 22, 47	csbied2 3913	. . 3 ⊢ ((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) → ⦋(1st ‘𝑣) / 𝑓⦌⦋(2nd ‘𝑣) / 𝑔⦌(𝑏 ∈ (𝑔𝑁ℎ), 𝑎 ∈ (𝑓𝑁𝑔) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝑓)‘𝑥), ((1st ‘𝑔)‘𝑥)⟩ · ((1st ‘ℎ)‘𝑥))(𝑎‘𝑥)))) = (𝑏 ∈ (𝐺𝑁𝐻), 𝑎 ∈ (𝐹𝑁𝐺) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥)))))
49		opelxpi 5585	. . . 4 ⊢ ((𝐹 ∈ (𝐶 Func 𝐷) ∧ 𝐺 ∈ (𝐶 Func 𝐷)) → ⟨𝐹, 𝐺⟩ ∈ ((𝐶 Func 𝐷) × (𝐶 Func 𝐷)))
50	8, 49	syl 17	. . 3 ⊢ (𝜑 → ⟨𝐹, 𝐺⟩ ∈ ((𝐶 Func 𝐷) × (𝐶 Func 𝐷)))
51		fucco.g	. . . . 5 ⊢ (𝜑 → 𝑆 ∈ (𝐺𝑁𝐻))
52	3	natrcl 17215	. . . . 5 ⊢ (𝑆 ∈ (𝐺𝑁𝐻) → (𝐺 ∈ (𝐶 Func 𝐷) ∧ 𝐻 ∈ (𝐶 Func 𝐷)))
53	51, 52	syl 17	. . . 4 ⊢ (𝜑 → (𝐺 ∈ (𝐶 Func 𝐷) ∧ 𝐻 ∈ (𝐶 Func 𝐷)))
54	53	simprd 498	. . 3 ⊢ (𝜑 → 𝐻 ∈ (𝐶 Func 𝐷))
55		ovex 7182	. . . . 5 ⊢ (𝐺𝑁𝐻) ∈ V
56		ovex 7182	. . . . 5 ⊢ (𝐹𝑁𝐺) ∈ V
57	55, 56	mpoex 7770	. . . 4 ⊢ (𝑏 ∈ (𝐺𝑁𝐻), 𝑎 ∈ (𝐹𝑁𝐺) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥)))) ∈ V
58	57	a1i 11	. . 3 ⊢ (𝜑 → (𝑏 ∈ (𝐺𝑁𝐻), 𝑎 ∈ (𝐹𝑁𝐺) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥)))) ∈ V)
59	15, 48, 50, 54, 58	ovmpod 7295	. 2 ⊢ (𝜑 → (⟨𝐹, 𝐺⟩ ∙ 𝐻) = (𝑏 ∈ (𝐺𝑁𝐻), 𝑎 ∈ (𝐹𝑁𝐺) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥)))))
60		simprl 769	. . . . 5 ⊢ ((𝜑 ∧ (𝑏 = 𝑆 ∧ 𝑎 = 𝑅)) → 𝑏 = 𝑆)
61	60	fveq1d 6665	. . . 4 ⊢ ((𝜑 ∧ (𝑏 = 𝑆 ∧ 𝑎 = 𝑅)) → (𝑏‘𝑥) = (𝑆‘𝑥))
62		simprr 771	. . . . 5 ⊢ ((𝜑 ∧ (𝑏 = 𝑆 ∧ 𝑎 = 𝑅)) → 𝑎 = 𝑅)
63	62	fveq1d 6665	. . . 4 ⊢ ((𝜑 ∧ (𝑏 = 𝑆 ∧ 𝑎 = 𝑅)) → (𝑎‘𝑥) = (𝑅‘𝑥))
64	61, 63	oveq12d 7167	. . 3 ⊢ ((𝜑 ∧ (𝑏 = 𝑆 ∧ 𝑎 = 𝑅)) → ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥)) = ((𝑆‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑅‘𝑥)))
65	64	mpteq2dv 5155	. 2 ⊢ ((𝜑 ∧ (𝑏 = 𝑆 ∧ 𝑎 = 𝑅)) → (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥))) = (𝑥 ∈ 𝐴 ↦ ((𝑆‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑅‘𝑥))))
66	4	fvexi 6677	. . . 4 ⊢ 𝐴 ∈ V
67	66	mptex 6979	. . 3 ⊢ (𝑥 ∈ 𝐴 ↦ ((𝑆‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑅‘𝑥))) ∈ V
68	67	a1i 11	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ ((𝑆‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑅‘𝑥))) ∈ V)
69	59, 65, 51, 6, 68	ovmpod 7295	1 ⊢ (𝜑 → (𝑆(⟨𝐹, 𝐺⟩ ∙ 𝐻)𝑅) = (𝑥 ∈ 𝐴 ↦ ((𝑆‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑅‘𝑥))))

Syntax hints:   → wi 4   ∧ wa 398   = wceq 1536   ∈ wcel 2113  Vcvv 3491  ⦋csb 3876  ⟨cop 4566   ↦ cmpt 5139   × cxp 5546  ‘cfv 6348  (class class class)co 7149   ∈ cmpo 7151  1^st c1st 7680  2^nd c2nd 7681  Basecbs 16478  compcco 16572  Catccat 16930   Func cfunc 17119   Nat cnat 17206   FuncCat cfuc 17207

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2792  ax-rep 5183  ax-sep 5196  ax-nul 5203  ax-pow 5259  ax-pr 5323  ax-un 7454  ax-cnex 10586  ax-resscn 10587  ax-1cn 10588  ax-icn 10589  ax-addcl 10590  ax-addrcl 10591  ax-mulcl 10592  ax-mulrcl 10593  ax-mulcom 10594  ax-addass 10595  ax-mulass 10596  ax-distr 10597  ax-i2m1 10598  ax-1ne0 10599  ax-1rid 10600  ax-rnegex 10601  ax-rrecex 10602  ax-cnre 10603  ax-pre-lttri 10604  ax-pre-lttrn 10605  ax-pre-ltadd 10606  ax-pre-mulgt0 10607

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1083  df-3an 1084  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2799  df-cleq 2813  df-clel 2892  df-nfc 2962  df-ne 3016  df-nel 3123  df-ral 3142  df-rex 3143  df-reu 3144  df-rab 3146  df-v 3493  df-sbc 3769  df-csb 3877  df-dif 3932  df-un 3934  df-in 3936  df-ss 3945  df-pss 3947  df-nul 4285  df-if 4461  df-pw 4534  df-sn 4561  df-pr 4563  df-tp 4565  df-op 4567  df-uni 4832  df-int 4870  df-iun 4914  df-br 5060  df-opab 5122  df-mpt 5140  df-tr 5166  df-id 5453  df-eprel 5458  df-po 5467  df-so 5468  df-fr 5507  df-we 5509  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-pred 6141  df-ord 6187  df-on 6188  df-lim 6189  df-suc 6190  df-iota 6307  df-fun 6350  df-fn 6351  df-f 6352  df-f1 6353  df-fo 6354  df-f1o 6355  df-fv 6356  df-riota 7107  df-ov 7152  df-oprab 7153  df-mpo 7154  df-om 7574  df-1st 7682  df-2nd 7683  df-wrecs 7940  df-recs 8001  df-rdg 8039  df-1o 8095  df-oadd 8099  df-er 8282  df-ixp 8455  df-en 8503  df-dom 8504  df-sdom 8505  df-fin 8506  df-pnf 10670  df-mnf 10671  df-xr 10672  df-ltxr 10673  df-le 10674  df-sub 10865  df-neg 10866  df-nn 11632  df-2 11694  df-3 11695  df-4 11696  df-5 11697  df-6 11698  df-7 11699  df-8 11700  df-9 11701  df-n0 11892  df-z 11976  df-dec 12093  df-uz 12238  df-fz 12890  df-struct 16480  df-ndx 16481  df-slot 16482  df-base 16484  df-hom 16584  df-cco 16585  df-func 17123  df-nat 17208  df-fuc 17209

This theorem is referenced by:  fuccoval  17228  fuccocl  17229  fuclid  17231  fucrid  17232  fucass  17233  fucsect  17237  curfcl  17477