Theorem fucco 17851

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 2736	. . . 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 17837	. . . . . . . 8 ⊢ (𝑅 ∈ (𝐹𝑁𝐺) → (𝐹 ∈ (𝐶 Func 𝐷) ∧ 𝐺 ∈ (𝐶 Func 𝐷)))
8	6, 7	syl 17	. . . . . . 7 ⊢ (𝜑 → (𝐹 ∈ (𝐶 Func 𝐷) ∧ 𝐺 ∈ (𝐶 Func 𝐷)))
9	8	simpld 495	. . . . . 6 ⊢ (𝜑 → 𝐹 ∈ (𝐶 Func 𝐷))
10		funcrcl 17749	. . . . . 6 ⊢ (𝐹 ∈ (𝐶 Func 𝐷) → (𝐶 ∈ Cat ∧ 𝐷 ∈ Cat))
11	9, 10	syl 17	. . . . 5 ⊢ (𝜑 → (𝐶 ∈ Cat ∧ 𝐷 ∈ Cat))
12	11	simpld 495	. . . 4 ⊢ (𝜑 → 𝐶 ∈ Cat)
13	11	simprd 496	. . . 4 ⊢ (𝜑 → 𝐷 ∈ Cat)
14		fucco.x	. . . 4 ⊢ ∙ = (comp‘𝑄)
15	1, 2, 3, 4, 5, 12, 13, 14	fuccofval 17847	. . 3 ⊢ (𝜑 → ∙ = (𝑣 ∈ ((𝐶 Func 𝐷) × (𝐶 Func 𝐷)), ℎ ∈ (𝐶 Func 𝐷) ↦ ⦋(1st ‘𝑣) / 𝑓⦌⦋(2nd ‘𝑣) / 𝑔⦌(𝑏 ∈ (𝑔𝑁ℎ), 𝑎 ∈ (𝑓𝑁𝑔) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝑓)‘𝑥), ((1st ‘𝑔)‘𝑥)⟩ · ((1st ‘ℎ)‘𝑥))(𝑎‘𝑥))))))
16		fvexd 6857	. . . 4 ⊢ ((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) → (1st ‘𝑣) ∈ V)
17		simprl 769	. . . . . 6 ⊢ ((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) → 𝑣 = ⟨𝐹, 𝐺⟩)
18	17	fveq2d 6846	. . . . 5 ⊢ ((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) → (1st ‘𝑣) = (1st ‘⟨𝐹, 𝐺⟩))
19		op1stg 7933	. . . . . . 7 ⊢ ((𝐹 ∈ (𝐶 Func 𝐷) ∧ 𝐺 ∈ (𝐶 Func 𝐷)) → (1st ‘⟨𝐹, 𝐺⟩) = 𝐹)
20	8, 19	syl 17	. . . . . 6 ⊢ (𝜑 → (1st ‘⟨𝐹, 𝐺⟩) = 𝐹)
21	20	adantr 481	. . . . 5 ⊢ ((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) → (1st ‘⟨𝐹, 𝐺⟩) = 𝐹)
22	18, 21	eqtrd 2776	. . . 4 ⊢ ((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) → (1st ‘𝑣) = 𝐹)
23		fvexd 6857	. . . . 5 ⊢ (((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) → (2nd ‘𝑣) ∈ V)
24	17	adantr 481	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) → 𝑣 = ⟨𝐹, 𝐺⟩)
25	24	fveq2d 6846	. . . . . 6 ⊢ (((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) → (2nd ‘𝑣) = (2nd ‘⟨𝐹, 𝐺⟩))
26		op2ndg 7934	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝐶 Func 𝐷) ∧ 𝐺 ∈ (𝐶 Func 𝐷)) → (2nd ‘⟨𝐹, 𝐺⟩) = 𝐺)
27	8, 26	syl 17	. . . . . . 7 ⊢ (𝜑 → (2nd ‘⟨𝐹, 𝐺⟩) = 𝐺)
28	27	ad2antrr 724	. . . . . 6 ⊢ (((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) → (2nd ‘⟨𝐹, 𝐺⟩) = 𝐺)
29	25, 28	eqtrd 2776	. . . . 5 ⊢ (((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) → (2nd ‘𝑣) = 𝐺)
30		simpr 485	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → 𝑔 = 𝐺)
31		simprr 771	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) → ℎ = 𝐻)
32	31	ad2antrr 724	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → ℎ = 𝐻)
33	30, 32	oveq12d 7375	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (𝑔𝑁ℎ) = (𝐺𝑁𝐻))
34		simplr 767	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → 𝑓 = 𝐹)
35	34, 30	oveq12d 7375	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (𝑓𝑁𝑔) = (𝐹𝑁𝐺))
36	34	fveq2d 6846	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (1st ‘𝑓) = (1st ‘𝐹))
37	36	fveq1d 6844	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → ((1st ‘𝑓)‘𝑥) = ((1st ‘𝐹)‘𝑥))
38	30	fveq2d 6846	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (1st ‘𝑔) = (1st ‘𝐺))
39	38	fveq1d 6844	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → ((1st ‘𝑔)‘𝑥) = ((1st ‘𝐺)‘𝑥))
40	37, 39	opeq12d 4838	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → ⟨((1st ‘𝑓)‘𝑥), ((1st ‘𝑔)‘𝑥)⟩ = ⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩)
41	32	fveq2d 6846	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (1st ‘ℎ) = (1st ‘𝐻))
42	41	fveq1d 6844	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → ((1st ‘ℎ)‘𝑥) = ((1st ‘𝐻)‘𝑥))
43	40, 42	oveq12d 7375	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (⟨((1st ‘𝑓)‘𝑥), ((1st ‘𝑔)‘𝑥)⟩ · ((1st ‘ℎ)‘𝑥)) = (⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥)))
44	43	oveqd 7374	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → ((𝑏‘𝑥)(⟨((1st ‘𝑓)‘𝑥), ((1st ‘𝑔)‘𝑥)⟩ · ((1st ‘ℎ)‘𝑥))(𝑎‘𝑥)) = ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥)))
45	44	mpteq2dv 5207	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝑓)‘𝑥), ((1st ‘𝑔)‘𝑥)⟩ · ((1st ‘ℎ)‘𝑥))(𝑎‘𝑥))) = (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥))))
46	33, 35, 45	mpoeq123dv 7432	. . . . 5 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (𝑏 ∈ (𝑔𝑁ℎ), 𝑎 ∈ (𝑓𝑁𝑔) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝑓)‘𝑥), ((1st ‘𝑔)‘𝑥)⟩ · ((1st ‘ℎ)‘𝑥))(𝑎‘𝑥)))) = (𝑏 ∈ (𝐺𝑁𝐻), 𝑎 ∈ (𝐹𝑁𝐺) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥)))))
47	23, 29, 46	csbied2 3895	. . . 4 ⊢ (((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) → ⦋(2nd ‘𝑣) / 𝑔⦌(𝑏 ∈ (𝑔𝑁ℎ), 𝑎 ∈ (𝑓𝑁𝑔) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝑓)‘𝑥), ((1st ‘𝑔)‘𝑥)⟩ · ((1st ‘ℎ)‘𝑥))(𝑎‘𝑥)))) = (𝑏 ∈ (𝐺𝑁𝐻), 𝑎 ∈ (𝐹𝑁𝐺) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥)))))
48	16, 22, 47	csbied2 3895	. . 3 ⊢ ((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) → ⦋(1st ‘𝑣) / 𝑓⦌⦋(2nd ‘𝑣) / 𝑔⦌(𝑏 ∈ (𝑔𝑁ℎ), 𝑎 ∈ (𝑓𝑁𝑔) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝑓)‘𝑥), ((1st ‘𝑔)‘𝑥)⟩ · ((1st ‘ℎ)‘𝑥))(𝑎‘𝑥)))) = (𝑏 ∈ (𝐺𝑁𝐻), 𝑎 ∈ (𝐹𝑁𝐺) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥)))))
49		opelxpi 5670	. . . 4 ⊢ ((𝐹 ∈ (𝐶 Func 𝐷) ∧ 𝐺 ∈ (𝐶 Func 𝐷)) → ⟨𝐹, 𝐺⟩ ∈ ((𝐶 Func 𝐷) × (𝐶 Func 𝐷)))
50	8, 49	syl 17	. . 3 ⊢ (𝜑 → ⟨𝐹, 𝐺⟩ ∈ ((𝐶 Func 𝐷) × (𝐶 Func 𝐷)))
51		fucco.g	. . . . 5 ⊢ (𝜑 → 𝑆 ∈ (𝐺𝑁𝐻))
52	3	natrcl 17837	. . . . 5 ⊢ (𝑆 ∈ (𝐺𝑁𝐻) → (𝐺 ∈ (𝐶 Func 𝐷) ∧ 𝐻 ∈ (𝐶 Func 𝐷)))
53	51, 52	syl 17	. . . 4 ⊢ (𝜑 → (𝐺 ∈ (𝐶 Func 𝐷) ∧ 𝐻 ∈ (𝐶 Func 𝐷)))
54	53	simprd 496	. . 3 ⊢ (𝜑 → 𝐻 ∈ (𝐶 Func 𝐷))
55		ovex 7390	. . . . 5 ⊢ (𝐺𝑁𝐻) ∈ V
56		ovex 7390	. . . . 5 ⊢ (𝐹𝑁𝐺) ∈ V
57	55, 56	mpoex 8012	. . . 4 ⊢ (𝑏 ∈ (𝐺𝑁𝐻), 𝑎 ∈ (𝐹𝑁𝐺) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥)))) ∈ V
58	57	a1i 11	. . 3 ⊢ (𝜑 → (𝑏 ∈ (𝐺𝑁𝐻), 𝑎 ∈ (𝐹𝑁𝐺) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥)))) ∈ V)
59	15, 48, 50, 54, 58	ovmpod 7507	. 2 ⊢ (𝜑 → (⟨𝐹, 𝐺⟩ ∙ 𝐻) = (𝑏 ∈ (𝐺𝑁𝐻), 𝑎 ∈ (𝐹𝑁𝐺) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥)))))
60		simprl 769	. . . . 5 ⊢ ((𝜑 ∧ (𝑏 = 𝑆 ∧ 𝑎 = 𝑅)) → 𝑏 = 𝑆)
61	60	fveq1d 6844	. . . 4 ⊢ ((𝜑 ∧ (𝑏 = 𝑆 ∧ 𝑎 = 𝑅)) → (𝑏‘𝑥) = (𝑆‘𝑥))
62		simprr 771	. . . . 5 ⊢ ((𝜑 ∧ (𝑏 = 𝑆 ∧ 𝑎 = 𝑅)) → 𝑎 = 𝑅)
63	62	fveq1d 6844	. . . 4 ⊢ ((𝜑 ∧ (𝑏 = 𝑆 ∧ 𝑎 = 𝑅)) → (𝑎‘𝑥) = (𝑅‘𝑥))
64	61, 63	oveq12d 7375	. . 3 ⊢ ((𝜑 ∧ (𝑏 = 𝑆 ∧ 𝑎 = 𝑅)) → ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥)) = ((𝑆‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑅‘𝑥)))
65	64	mpteq2dv 5207	. 2 ⊢ ((𝜑 ∧ (𝑏 = 𝑆 ∧ 𝑎 = 𝑅)) → (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥))) = (𝑥 ∈ 𝐴 ↦ ((𝑆‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑅‘𝑥))))
66	4	fvexi 6856	. . . 4 ⊢ 𝐴 ∈ V
67	66	mptex 7173	. . 3 ⊢ (𝑥 ∈ 𝐴 ↦ ((𝑆‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑅‘𝑥))) ∈ V
68	67	a1i 11	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ ((𝑆‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑅‘𝑥))) ∈ V)
69	59, 65, 51, 6, 68	ovmpod 7507	1 ⊢ (𝜑 → (𝑆(⟨𝐹, 𝐺⟩ ∙ 𝐻)𝑅) = (𝑥 ∈ 𝐴 ↦ ((𝑆‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑅‘𝑥))))

Syntax hints:   → wi 4   ∧ wa 396   = wceq 1541   ∈ wcel 2106  Vcvv 3445  ⦋csb 3855  ⟨cop 4592   ↦ cmpt 5188   × cxp 5631  ‘cfv 6496  (class class class)co 7357   ∈ cmpo 7359  1^st c1st 7919  2^nd c2nd 7920  Basecbs 17083  compcco 17145  Catccat 17544   Func cfunc 17740   Nat cnat 17828   FuncCat cfuc 17829

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-rep 5242  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672  ax-cnex 11107  ax-resscn 11108  ax-1cn 11109  ax-icn 11110  ax-addcl 11111  ax-addrcl 11112  ax-mulcl 11113  ax-mulrcl 11114  ax-mulcom 11115  ax-addass 11116  ax-mulass 11117  ax-distr 11118  ax-i2m1 11119  ax-1ne0 11120  ax-1rid 11121  ax-rnegex 11122  ax-rrecex 11123  ax-cnre 11124  ax-pre-lttri 11125  ax-pre-lttrn 11126  ax-pre-ltadd 11127  ax-pre-mulgt0 11128

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3065  df-rex 3074  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-pss 3929  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-tp 4591  df-op 4593  df-uni 4866  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-tr 5223  df-id 5531  df-eprel 5537  df-po 5545  df-so 5546  df-fr 5588  df-we 5590  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-pred 6253  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-riota 7313  df-ov 7360  df-oprab 7361  df-mpo 7362  df-om 7803  df-1st 7921  df-2nd 7922  df-frecs 8212  df-wrecs 8243  df-recs 8317  df-rdg 8356  df-1o 8412  df-er 8648  df-ixp 8836  df-en 8884  df-dom 8885  df-sdom 8886  df-fin 8887  df-pnf 11191  df-mnf 11192  df-xr 11193  df-ltxr 11194  df-le 11195  df-sub 11387  df-neg 11388  df-nn 12154  df-2 12216  df-3 12217  df-4 12218  df-5 12219  df-6 12220  df-7 12221  df-8 12222  df-9 12223  df-n0 12414  df-z 12500  df-dec 12619  df-uz 12764  df-fz 13425  df-struct 17019  df-slot 17054  df-ndx 17066  df-base 17084  df-hom 17157  df-cco 17158  df-func 17744  df-nat 17830  df-fuc 17831

This theorem is referenced by:  fuccoval  17852  fuccocl  17853  fuclid  17855  fucrid  17856  fucass  17857  fucsect  17861  curfcl  18121