Theorem fucco 18133

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 2761	. . . 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 18121	. . . . . . . 8 ⊢ (𝑅 ∈ (𝐹𝑁𝐺) → (𝐹 ∈ (𝐶 Func 𝐷) ∧ 𝐺 ∈ (𝐶 Func 𝐷)))
8	6, 7	syl 18	. . . . . . 7 ⊢ (𝜑 → (𝐹 ∈ (𝐶 Func 𝐷) ∧ 𝐺 ∈ (𝐶 Func 𝐷)))
9	8	simpld 500	. . . . . 6 ⊢ (𝜑 → 𝐹 ∈ (𝐶 Func 𝐷))
10		funcrcl 18031	. . . . . 6 ⊢ (𝐹 ∈ (𝐶 Func 𝐷) → (𝐶 ∈ Cat ∧ 𝐷 ∈ Cat))
11	9, 10	syl 18	. . . . 5 ⊢ (𝜑 → (𝐶 ∈ Cat ∧ 𝐷 ∈ Cat))
12	11	simpld 500	. . . 4 ⊢ (𝜑 → 𝐶 ∈ Cat)
13	11	simprd 501	. . . 4 ⊢ (𝜑 → 𝐷 ∈ Cat)
14		fucco.x	. . . 4 ⊢ ∙ = (comp‘𝑄)
15	1, 2, 3, 4, 5, 12, 13, 14	fuccofval 18130	. . 3 ⊢ (𝜑 → ∙ = (𝑣 ∈ ((𝐶 Func 𝐷) × (𝐶 Func 𝐷)), ℎ ∈ (𝐶 Func 𝐷) ↦ ⦋(1st ‘𝑣) / 𝑓⦌⦋(2nd ‘𝑣) / 𝑔⦌(𝑏 ∈ (𝑔𝑁ℎ), 𝑎 ∈ (𝑓𝑁𝑔) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝑓)‘𝑥), ((1st ‘𝑔)‘𝑥)⟩ · ((1st ‘ℎ)‘𝑥))(𝑎‘𝑥))))))
16		fvexd 6898	. . . 4 ⊢ ((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) → (1st ‘𝑣) ∈ V)
17		simprl 783	. . . . . 6 ⊢ ((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) → 𝑣 = ⟨𝐹, 𝐺⟩)
18	17	fveq2d 6887	. . . . 5 ⊢ ((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) → (1st ‘𝑣) = (1st ‘⟨𝐹, 𝐺⟩))
19		op1stg 8011	. . . . . . 7 ⊢ ((𝐹 ∈ (𝐶 Func 𝐷) ∧ 𝐺 ∈ (𝐶 Func 𝐷)) → (1st ‘⟨𝐹, 𝐺⟩) = 𝐹)
20	8, 19	syl 18	. . . . . 6 ⊢ (𝜑 → (1st ‘⟨𝐹, 𝐺⟩) = 𝐹)
21	20	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) → (1st ‘⟨𝐹, 𝐺⟩) = 𝐹)
22	18, 21	eqtrd 2796	. . . 4 ⊢ ((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) → (1st ‘𝑣) = 𝐹)
23		fvexd 6898	. . . . 5 ⊢ (((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) → (2nd ‘𝑣) ∈ V)
24	17	adantr 486	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) → 𝑣 = ⟨𝐹, 𝐺⟩)
25	24	fveq2d 6887	. . . . . 6 ⊢ (((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) → (2nd ‘𝑣) = (2nd ‘⟨𝐹, 𝐺⟩))
26		op2ndg 8012	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝐶 Func 𝐷) ∧ 𝐺 ∈ (𝐶 Func 𝐷)) → (2nd ‘⟨𝐹, 𝐺⟩) = 𝐺)
27	8, 26	syl 18	. . . . . . 7 ⊢ (𝜑 → (2nd ‘⟨𝐹, 𝐺⟩) = 𝐺)
28	27	ad2antrr 739	. . . . . 6 ⊢ (((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) → (2nd ‘⟨𝐹, 𝐺⟩) = 𝐺)
29	25, 28	eqtrd 2796	. . . . 5 ⊢ (((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) → (2nd ‘𝑣) = 𝐺)
30		simpr 490	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → 𝑔 = 𝐺)
31		simprr 785	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) → ℎ = 𝐻)
32	31	ad2antrr 739	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → ℎ = 𝐻)
33	30, 32	oveq12d 7436	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (𝑔𝑁ℎ) = (𝐺𝑁𝐻))
34		simplr 781	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → 𝑓 = 𝐹)
35	34, 30	oveq12d 7436	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (𝑓𝑁𝑔) = (𝐹𝑁𝐺))
36	34	fveq2d 6887	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (1st ‘𝑓) = (1st ‘𝐹))
37	36	fveq1d 6885	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → ((1st ‘𝑓)‘𝑥) = ((1st ‘𝐹)‘𝑥))
38	30	fveq2d 6887	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (1st ‘𝑔) = (1st ‘𝐺))
39	38	fveq1d 6885	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → ((1st ‘𝑔)‘𝑥) = ((1st ‘𝐺)‘𝑥))
40	37, 39	opeq12d 4841	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → ⟨((1st ‘𝑓)‘𝑥), ((1st ‘𝑔)‘𝑥)⟩ = ⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩)
41	32	fveq2d 6887	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (1st ‘ℎ) = (1st ‘𝐻))
42	41	fveq1d 6885	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → ((1st ‘ℎ)‘𝑥) = ((1st ‘𝐻)‘𝑥))
43	40, 42	oveq12d 7436	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (⟨((1st ‘𝑓)‘𝑥), ((1st ‘𝑔)‘𝑥)⟩ · ((1st ‘ℎ)‘𝑥)) = (⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥)))
44	43	oveqd 7435	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → ((𝑏‘𝑥)(⟨((1st ‘𝑓)‘𝑥), ((1st ‘𝑔)‘𝑥)⟩ · ((1st ‘ℎ)‘𝑥))(𝑎‘𝑥)) = ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥)))
45	44	mpteq2dv 5199	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝑓)‘𝑥), ((1st ‘𝑔)‘𝑥)⟩ · ((1st ‘ℎ)‘𝑥))(𝑎‘𝑥))) = (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥))))
46	33, 35, 45	mpoeq123dv 7493	. . . . 5 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (𝑏 ∈ (𝑔𝑁ℎ), 𝑎 ∈ (𝑓𝑁𝑔) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝑓)‘𝑥), ((1st ‘𝑔)‘𝑥)⟩ · ((1st ‘ℎ)‘𝑥))(𝑎‘𝑥)))) = (𝑏 ∈ (𝐺𝑁𝐻), 𝑎 ∈ (𝐹𝑁𝐺) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥)))))
47	23, 29, 46	csbied2 3884	. . . 4 ⊢ (((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) → ⦋(2nd ‘𝑣) / 𝑔⦌(𝑏 ∈ (𝑔𝑁ℎ), 𝑎 ∈ (𝑓𝑁𝑔) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝑓)‘𝑥), ((1st ‘𝑔)‘𝑥)⟩ · ((1st ‘ℎ)‘𝑥))(𝑎‘𝑥)))) = (𝑏 ∈ (𝐺𝑁𝐻), 𝑎 ∈ (𝐹𝑁𝐺) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥)))))
48	16, 22, 47	csbied2 3884	. . 3 ⊢ ((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) → ⦋(1st ‘𝑣) / 𝑓⦌⦋(2nd ‘𝑣) / 𝑔⦌(𝑏 ∈ (𝑔𝑁ℎ), 𝑎 ∈ (𝑓𝑁𝑔) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝑓)‘𝑥), ((1st ‘𝑔)‘𝑥)⟩ · ((1st ‘ℎ)‘𝑥))(𝑎‘𝑥)))) = (𝑏 ∈ (𝐺𝑁𝐻), 𝑎 ∈ (𝐹𝑁𝐺) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥)))))
49		opelxpi 5688	. . . 4 ⊢ ((𝐹 ∈ (𝐶 Func 𝐷) ∧ 𝐺 ∈ (𝐶 Func 𝐷)) → ⟨𝐹, 𝐺⟩ ∈ ((𝐶 Func 𝐷) × (𝐶 Func 𝐷)))
50	8, 49	syl 18	. . 3 ⊢ (𝜑 → ⟨𝐹, 𝐺⟩ ∈ ((𝐶 Func 𝐷) × (𝐶 Func 𝐷)))
51		fucco.g	. . . . 5 ⊢ (𝜑 → 𝑆 ∈ (𝐺𝑁𝐻))
52	3	natrcl 18121	. . . . 5 ⊢ (𝑆 ∈ (𝐺𝑁𝐻) → (𝐺 ∈ (𝐶 Func 𝐷) ∧ 𝐻 ∈ (𝐶 Func 𝐷)))
53	51, 52	syl 18	. . . 4 ⊢ (𝜑 → (𝐺 ∈ (𝐶 Func 𝐷) ∧ 𝐻 ∈ (𝐶 Func 𝐷)))
54	53	simprd 501	. . 3 ⊢ (𝜑 → 𝐻 ∈ (𝐶 Func 𝐷))
55		ovex 7451	. . . . 5 ⊢ (𝐺𝑁𝐻) ∈ V
56		ovex 7451	. . . . 5 ⊢ (𝐹𝑁𝐺) ∈ V
57	55, 56	mpoex 8090	. . . 4 ⊢ (𝑏 ∈ (𝐺𝑁𝐻), 𝑎 ∈ (𝐹𝑁𝐺) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥)))) ∈ V
58	57	a1i 11	. . 3 ⊢ (𝜑 → (𝑏 ∈ (𝐺𝑁𝐻), 𝑎 ∈ (𝐹𝑁𝐺) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥)))) ∈ V)
59	15, 48, 50, 54, 58	ovmpod 7570	. 2 ⊢ (𝜑 → (⟨𝐹, 𝐺⟩ ∙ 𝐻) = (𝑏 ∈ (𝐺𝑁𝐻), 𝑎 ∈ (𝐹𝑁𝐺) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥)))))
60		simprl 783	. . . . 5 ⊢ ((𝜑 ∧ (𝑏 = 𝑆 ∧ 𝑎 = 𝑅)) → 𝑏 = 𝑆)
61	60	fveq1d 6885	. . . 4 ⊢ ((𝜑 ∧ (𝑏 = 𝑆 ∧ 𝑎 = 𝑅)) → (𝑏‘𝑥) = (𝑆‘𝑥))
62		simprr 785	. . . . 5 ⊢ ((𝜑 ∧ (𝑏 = 𝑆 ∧ 𝑎 = 𝑅)) → 𝑎 = 𝑅)
63	62	fveq1d 6885	. . . 4 ⊢ ((𝜑 ∧ (𝑏 = 𝑆 ∧ 𝑎 = 𝑅)) → (𝑎‘𝑥) = (𝑅‘𝑥))
64	61, 63	oveq12d 7436	. . 3 ⊢ ((𝜑 ∧ (𝑏 = 𝑆 ∧ 𝑎 = 𝑅)) → ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥)) = ((𝑆‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑅‘𝑥)))
65	64	mpteq2dv 5199	. 2 ⊢ ((𝜑 ∧ (𝑏 = 𝑆 ∧ 𝑎 = 𝑅)) → (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥))) = (𝑥 ∈ 𝐴 ↦ ((𝑆‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑅‘𝑥))))
66	4	fvexi 6897	. . . 4 ⊢ 𝐴 ∈ V
67	66	mptex 7227	. . 3 ⊢ (𝑥 ∈ 𝐴 ↦ ((𝑆‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑅‘𝑥))) ∈ V
68	67	a1i 11	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ ((𝑆‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑅‘𝑥))) ∈ V)
69	59, 65, 51, 6, 68	ovmpod 7570	1 ⊢ (𝜑 → (𝑆(⟨𝐹, 𝐺⟩ ∙ 𝐻)𝑅) = (𝑥 ∈ 𝐴 ↦ ((𝑆‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑅‘𝑥))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3451  ⦋csb 3847  ⟨cop 4590   ↦ cmpt 5186   × cxp 5649  ‘cfv 6537  (class class class)co 7418   ∈ cmpo 7420  1^st c1st 7997  2^nd c2nd 7998  Basecbs 17380  compcco 17433  Catccat 17831   Func cfunc 18022   Nat cnat 18112   FuncCat cfuc 18113

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749  ax-cnex 11249  ax-resscn 11250  ax-1cn 11251  ax-icn 11252  ax-addcl 11253  ax-addrcl 11254  ax-mulcl 11255  ax-mulrcl 11256  ax-mulcom 11257  ax-addass 11258  ax-mulass 11259  ax-distr 11260  ax-i2m1 11261  ax-1ne0 11262  ax-1rid 11263  ax-rnegex 11264  ax-rrecex 11265  ax-cnre 11266  ax-pre-lttri 11267  ax-pre-lttrn 11268  ax-pre-ltadd 11269  ax-pre-mulgt0 11270

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7375  df-ov 7421  df-oprab 7422  df-mpo 7423  df-om 7876  df-1st 7999  df-2nd 8000  df-frecs 8292  df-wrecs 8323  df-recs 8372  df-rdg 8411  df-1o 8469  df-er 8710  df-ixp 8919  df-en 8967  df-dom 8968  df-sdom 8969  df-fin 8970  df-pnf 11338  df-mnf 11339  df-xr 11340  df-ltxr 11341  df-le 11342  df-sub 11536  df-neg 11537  df-nn 12329  df-2 12398  df-3 12399  df-4 12400  df-5 12401  df-6 12402  df-7 12403  df-8 12404  df-9 12405  df-n0 12600  df-z 12687  df-dec 12808  df-uz 12959  df-fz 13633  df-struct 17318  df-slot 17353  df-ndx 17365  df-base 17381  df-hom 17445  df-cco 17446  df-func 18026  df-nat 18114  df-fuc 18115

This theorem is used by:  fuccoval  18134  fuccocl  18135  fuclid  18137  fucrid  18138  fucass  18139  fucsect  18143  curfcl  18399  xpcfucco3  50335  fucocolem4  50433  fucoppcco  50486  islmd  50742  iscmd  50743