Theorem fucco 18054

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 2760	. . . 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 18042	. . . . . . . 8 ⊢ (𝑅 ∈ (𝐹𝑁𝐺) → (𝐹 ∈ (𝐶 Func 𝐷) ∧ 𝐺 ∈ (𝐶 Func 𝐷)))
8	6, 7	syl 18	. . . . . . 7 ⊢ (𝜑 → (𝐹 ∈ (𝐶 Func 𝐷) ∧ 𝐺 ∈ (𝐶 Func 𝐷)))
9	8	simpld 500	. . . . . 6 ⊢ (𝜑 → 𝐹 ∈ (𝐶 Func 𝐷))
10		funcrcl 17952	. . . . . 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 18051	. . 3 ⊢ (𝜑 → ∙ = (𝑣 ∈ ((𝐶 Func 𝐷) × (𝐶 Func 𝐷)), ℎ ∈ (𝐶 Func 𝐷) ↦ ⦋(1st ‘𝑣) / 𝑓⦌⦋(2nd ‘𝑣) / 𝑔⦌(𝑏 ∈ (𝑔𝑁ℎ), 𝑎 ∈ (𝑓𝑁𝑔) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝑓)‘𝑥), ((1st ‘𝑔)‘𝑥)⟩ · ((1st ‘ℎ)‘𝑥))(𝑎‘𝑥))))))
16		fvexd 6893	. . . 4 ⊢ ((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) → (1st ‘𝑣) ∈ V)
17		simprl 783	. . . . . 6 ⊢ ((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) → 𝑣 = ⟨𝐹, 𝐺⟩)
18	17	fveq2d 6882	. . . . 5 ⊢ ((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) → (1st ‘𝑣) = (1st ‘⟨𝐹, 𝐺⟩))
19		op1stg 7998	. . . . . . 7 ⊢ ((𝐹 ∈ (𝐶 Func 𝐷) ∧ 𝐺 ∈ (𝐶 Func 𝐷)) → (1st ‘⟨𝐹, 𝐺⟩) = 𝐹)
20	8, 19	syl 18	. . . . . 6 ⊢ (𝜑 → (1st ‘⟨𝐹, 𝐺⟩) = 𝐹)
21	20	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) → (1st ‘⟨𝐹, 𝐺⟩) = 𝐹)
22	18, 21	eqtrd 2795	. . . 4 ⊢ ((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) → (1st ‘𝑣) = 𝐹)
23		fvexd 6893	. . . . 5 ⊢ (((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) → (2nd ‘𝑣) ∈ V)
24	17	adantr 486	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) → 𝑣 = ⟨𝐹, 𝐺⟩)
25	24	fveq2d 6882	. . . . . 6 ⊢ (((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) → (2nd ‘𝑣) = (2nd ‘⟨𝐹, 𝐺⟩))
26		op2ndg 7999	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝐶 Func 𝐷) ∧ 𝐺 ∈ (𝐶 Func 𝐷)) → (2nd ‘⟨𝐹, 𝐺⟩) = 𝐺)
27	8, 26	syl 18	. . . . . . 7 ⊢ (𝜑 → (2nd ‘⟨𝐹, 𝐺⟩) = 𝐺)
28	27	ad2antrr 739	. . . . . 6 ⊢ (((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) → (2nd ‘⟨𝐹, 𝐺⟩) = 𝐺)
29	25, 28	eqtrd 2795	. . . . 5 ⊢ (((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) → (2nd ‘𝑣) = 𝐺)
30		simpr 490	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → 𝑔 = 𝐺)
31		simprr 785	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) → ℎ = 𝐻)
32	31	ad2antrr 739	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → ℎ = 𝐻)
33	30, 32	oveq12d 7431	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (𝑔𝑁ℎ) = (𝐺𝑁𝐻))
34		simplr 781	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → 𝑓 = 𝐹)
35	34, 30	oveq12d 7431	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (𝑓𝑁𝑔) = (𝐹𝑁𝐺))
36	34	fveq2d 6882	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (1st ‘𝑓) = (1st ‘𝐹))
37	36	fveq1d 6880	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → ((1st ‘𝑓)‘𝑥) = ((1st ‘𝐹)‘𝑥))
38	30	fveq2d 6882	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (1st ‘𝑔) = (1st ‘𝐺))
39	38	fveq1d 6880	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → ((1st ‘𝑔)‘𝑥) = ((1st ‘𝐺)‘𝑥))
40	37, 39	opeq12d 4841	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → ⟨((1st ‘𝑓)‘𝑥), ((1st ‘𝑔)‘𝑥)⟩ = ⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩)
41	32	fveq2d 6882	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (1st ‘ℎ) = (1st ‘𝐻))
42	41	fveq1d 6880	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → ((1st ‘ℎ)‘𝑥) = ((1st ‘𝐻)‘𝑥))
43	40, 42	oveq12d 7431	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (⟨((1st ‘𝑓)‘𝑥), ((1st ‘𝑔)‘𝑥)⟩ · ((1st ‘ℎ)‘𝑥)) = (⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥)))
44	43	oveqd 7430	. . . . . . 7 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → ((𝑏‘𝑥)(⟨((1st ‘𝑓)‘𝑥), ((1st ‘𝑔)‘𝑥)⟩ · ((1st ‘ℎ)‘𝑥))(𝑎‘𝑥)) = ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥)))
45	44	mpteq2dv 5199	. . . . . 6 ⊢ ((((𝜑 ∧ (𝑣 = ⟨𝐹, 𝐺⟩ ∧ ℎ = 𝐻)) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝑓)‘𝑥), ((1st ‘𝑔)‘𝑥)⟩ · ((1st ‘ℎ)‘𝑥))(𝑎‘𝑥))) = (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥))))
46	33, 35, 45	mpoeq123dv 7488	. . . . 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 5692	. . . 4 ⊢ ((𝐹 ∈ (𝐶 Func 𝐷) ∧ 𝐺 ∈ (𝐶 Func 𝐷)) → ⟨𝐹, 𝐺⟩ ∈ ((𝐶 Func 𝐷) × (𝐶 Func 𝐷)))
50	8, 49	syl 18	. . 3 ⊢ (𝜑 → ⟨𝐹, 𝐺⟩ ∈ ((𝐶 Func 𝐷) × (𝐶 Func 𝐷)))
51		fucco.g	. . . . 5 ⊢ (𝜑 → 𝑆 ∈ (𝐺𝑁𝐻))
52	3	natrcl 18042	. . . . 5 ⊢ (𝑆 ∈ (𝐺𝑁𝐻) → (𝐺 ∈ (𝐶 Func 𝐷) ∧ 𝐻 ∈ (𝐶 Func 𝐷)))
53	51, 52	syl 18	. . . 4 ⊢ (𝜑 → (𝐺 ∈ (𝐶 Func 𝐷) ∧ 𝐻 ∈ (𝐶 Func 𝐷)))
54	53	simprd 501	. . 3 ⊢ (𝜑 → 𝐻 ∈ (𝐶 Func 𝐷))
55		ovex 7446	. . . . 5 ⊢ (𝐺𝑁𝐻) ∈ V
56		ovex 7446	. . . . 5 ⊢ (𝐹𝑁𝐺) ∈ V
57	55, 56	mpoex 8078	. . . 4 ⊢ (𝑏 ∈ (𝐺𝑁𝐻), 𝑎 ∈ (𝐹𝑁𝐺) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥)))) ∈ V
58	57	a1i 11	. . 3 ⊢ (𝜑 → (𝑏 ∈ (𝐺𝑁𝐻), 𝑎 ∈ (𝐹𝑁𝐺) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥)))) ∈ V)
59	15, 48, 50, 54, 58	ovmpod 7565	. 2 ⊢ (𝜑 → (⟨𝐹, 𝐺⟩ ∙ 𝐻) = (𝑏 ∈ (𝐺𝑁𝐻), 𝑎 ∈ (𝐹𝑁𝐺) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥)))))
60		simprl 783	. . . . 5 ⊢ ((𝜑 ∧ (𝑏 = 𝑆 ∧ 𝑎 = 𝑅)) → 𝑏 = 𝑆)
61	60	fveq1d 6880	. . . 4 ⊢ ((𝜑 ∧ (𝑏 = 𝑆 ∧ 𝑎 = 𝑅)) → (𝑏‘𝑥) = (𝑆‘𝑥))
62		simprr 785	. . . . 5 ⊢ ((𝜑 ∧ (𝑏 = 𝑆 ∧ 𝑎 = 𝑅)) → 𝑎 = 𝑅)
63	62	fveq1d 6880	. . . 4 ⊢ ((𝜑 ∧ (𝑏 = 𝑆 ∧ 𝑎 = 𝑅)) → (𝑎‘𝑥) = (𝑅‘𝑥))
64	61, 63	oveq12d 7431	. . 3 ⊢ ((𝜑 ∧ (𝑏 = 𝑆 ∧ 𝑎 = 𝑅)) → ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥)) = ((𝑆‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑅‘𝑥)))
65	64	mpteq2dv 5199	. 2 ⊢ ((𝜑 ∧ (𝑏 = 𝑆 ∧ 𝑎 = 𝑅)) → (𝑥 ∈ 𝐴 ↦ ((𝑏‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑎‘𝑥))) = (𝑥 ∈ 𝐴 ↦ ((𝑆‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑅‘𝑥))))
66	4	fvexi 6892	. . . 4 ⊢ 𝐴 ∈ V
67	66	mptex 7222	. . 3 ⊢ (𝑥 ∈ 𝐴 ↦ ((𝑆‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑅‘𝑥))) ∈ V
68	67	a1i 11	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ ((𝑆‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑅‘𝑥))) ∈ V)
69	59, 65, 51, 6, 68	ovmpod 7565	1 ⊢ (𝜑 → (𝑆(⟨𝐹, 𝐺⟩ ∙ 𝐻)𝑅) = (𝑥 ∈ 𝐴 ↦ ((𝑆‘𝑥)(⟨((1st ‘𝐹)‘𝑥), ((1st ‘𝐺)‘𝑥)⟩ · ((1st ‘𝐻)‘𝑥))(𝑅‘𝑥))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3450  ⦋csb 3847  ⟨cop 4590   ↦ cmpt 5186   × cxp 5653  ‘cfv 6533  (class class class)co 7413   ∈ cmpo 7415  1^st c1st 7984  2^nd c2nd 7985  Basecbs 17301  compcco 17354  Catccat 17752   Func cfunc 17943   Nat cnat 18033   FuncCat cfuc 18034

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 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736  ax-cnex 11180  ax-resscn 11181  ax-1cn 11182  ax-icn 11183  ax-addcl 11184  ax-addrcl 11185  ax-mulcl 11186  ax-mulrcl 11187  ax-mulcom 11188  ax-addass 11189  ax-mulass 11190  ax-distr 11191  ax-i2m1 11192  ax-1ne0 11193  ax-1rid 11194  ax-rnegex 11195  ax-rrecex 11196  ax-cnre 11197  ax-pre-lttri 11198  ax-pre-lttrn 11199  ax-pre-ltadd 11200  ax-pre-mulgt0 11201

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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  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 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6299  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7370  df-ov 7416  df-oprab 7417  df-mpo 7418  df-om 7863  df-1st 7986  df-2nd 7987  df-frecs 8280  df-wrecs 8311  df-recs 8360  df-rdg 8399  df-1o 8455  df-er 8696  df-ixp 8905  df-en 8953  df-dom 8954  df-sdom 8955  df-fin 8956  df-pnf 11269  df-mnf 11270  df-xr 11271  df-ltxr 11272  df-le 11273  df-sub 11467  df-neg 11468  df-nn 12258  df-2 12327  df-3 12328  df-4 12329  df-5 12330  df-6 12331  df-7 12332  df-8 12333  df-9 12334  df-n0 12529  df-z 12616  df-dec 12737  df-uz 12888  df-fz 13562  df-struct 17239  df-slot 17274  df-ndx 17286  df-base 17302  df-hom 17366  df-cco 17367  df-func 17947  df-nat 18035  df-fuc 18036

This theorem is used by:  fuccoval  18055  fuccocl  18056  fuclid  18058  fucrid  18059  fucass  18060  fucsect  18064  curfcl  18320  xpcfucco3  50184  fucocolem4  50282  fucoppcco  50335  islmd  50591  iscmd  50592