Theorem mclspps 35778

Description: The closure is closed under application of provable pre-statements. (Compare mclsax 35763.) This theorem is what justifies the treatment of theorems as "equivalent" to axioms once they have been proven: the composition of one theorem in the proof of another yields a theorem. (Contributed by Mario Carneiro, 18-Jul-2016.)

Hypotheses

Ref	Expression
mclspps.d	⊢ 𝐷 = (mDV‘𝑇)
mclspps.e	⊢ 𝐸 = (mEx‘𝑇)
mclspps.c	⊢ 𝐶 = (mCls‘𝑇)
mclspps.1	⊢ (𝜑 → 𝑇 ∈ mFS)
mclspps.2	⊢ (𝜑 → 𝐾 ⊆ 𝐷)
mclspps.3	⊢ (𝜑 → 𝐵 ⊆ 𝐸)
mclspps.j	⊢ 𝐽 = (mPPSt‘𝑇)
mclspps.l	⊢ 𝐿 = (mSubst‘𝑇)
mclspps.v	⊢ 𝑉 = (mVR‘𝑇)
mclspps.h	⊢ 𝐻 = (mVH‘𝑇)
mclspps.w	⊢ 𝑊 = (mVars‘𝑇)
mclspps.4	⊢ (𝜑 → ⟨𝑀, 𝑂, 𝑃⟩ ∈ 𝐽)
mclspps.5	⊢ (𝜑 → 𝑆 ∈ ran 𝐿)
mclspps.6	⊢ ((𝜑 ∧ 𝑥 ∈ 𝑂) → (𝑆‘𝑥) ∈ (𝐾𝐶𝐵))
mclspps.7	⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉) → (𝑆‘(𝐻‘𝑣)) ∈ (𝐾𝐶𝐵))
mclspps.8	⊢ ((𝜑 ∧ (𝑥𝑀𝑦 ∧ 𝑎 ∈ (𝑊‘(𝑆‘(𝐻‘𝑥))) ∧ 𝑏 ∈ (𝑊‘(𝑆‘(𝐻‘𝑦))))) → 𝑎𝐾𝑏)

Assertion

Ref	Expression
mclspps	⊢ (𝜑 → (𝑆‘𝑃) ∈ (𝐾𝐶𝐵))

Distinct variable groups:   𝑣,𝐸   𝑎,𝑏,𝑣,𝑥,𝑦,𝐻   𝑣,𝑉   𝐾,𝑎,𝑏,𝑣,𝑥,𝑦   𝑇,𝑎,𝑏,𝑣,𝑥,𝑦   𝐿,𝑎,𝑏,𝑣,𝑥,𝑦   𝑆,𝑎,𝑏,𝑣,𝑥,𝑦   𝐵,𝑎,𝑏,𝑣,𝑥,𝑦   𝑊,𝑎,𝑏,𝑣,𝑥,𝑦   𝐶,𝑎,𝑏,𝑣,𝑥,𝑦   𝑀,𝑎,𝑏,𝑣,𝑥,𝑦   𝑣,𝑂,𝑥   𝜑,𝑎,𝑏,𝑣,𝑥,𝑦

Allowed substitution hints:   𝐷(𝑥,𝑦,𝑣,𝑎,𝑏)   𝑃(𝑥,𝑦,𝑣,𝑎,𝑏)   𝐸(𝑥,𝑦,𝑎,𝑏)   𝐽(𝑥,𝑦,𝑣,𝑎,𝑏)   𝑂(𝑦,𝑎,𝑏)   𝑉(𝑥,𝑦,𝑎,𝑏)

Proof of Theorem mclspps

Dummy variables 𝑚 𝑜 𝑝 𝑠 𝑤 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mclspps.5	. . . 4 ⊢ (𝜑 → 𝑆 ∈ ran 𝐿)
2		mclspps.l	. . . . 5 ⊢ 𝐿 = (mSubst‘𝑇)
3		mclspps.e	. . . . 5 ⊢ 𝐸 = (mEx‘𝑇)
4	2, 3	msubf 35726	. . . 4 ⊢ (𝑆 ∈ ran 𝐿 → 𝑆:𝐸⟶𝐸)
5	1, 4	syl 17	. . 3 ⊢ (𝜑 → 𝑆:𝐸⟶𝐸)
6	5	ffnd 6663	. 2 ⊢ (𝜑 → 𝑆 Fn 𝐸)
7		mclspps.d	. . . 4 ⊢ 𝐷 = (mDV‘𝑇)
8		mclspps.c	. . . 4 ⊢ 𝐶 = (mCls‘𝑇)
9		mclspps.1	. . . 4 ⊢ (𝜑 → 𝑇 ∈ mFS)
10		eqid 2736	. . . . . . . . 9 ⊢ (mPreSt‘𝑇) = (mPreSt‘𝑇)
11		mclspps.j	. . . . . . . . 9 ⊢ 𝐽 = (mPPSt‘𝑇)
12	10, 11	mppspst 35768	. . . . . . . 8 ⊢ 𝐽 ⊆ (mPreSt‘𝑇)
13		mclspps.4	. . . . . . . 8 ⊢ (𝜑 → ⟨𝑀, 𝑂, 𝑃⟩ ∈ 𝐽)
14	12, 13	sselid 3931	. . . . . . 7 ⊢ (𝜑 → ⟨𝑀, 𝑂, 𝑃⟩ ∈ (mPreSt‘𝑇))
15	7, 3, 10	elmpst 35730	. . . . . . 7 ⊢ (⟨𝑀, 𝑂, 𝑃⟩ ∈ (mPreSt‘𝑇) ↔ ((𝑀 ⊆ 𝐷 ∧ ◡𝑀 = 𝑀) ∧ (𝑂 ⊆ 𝐸 ∧ 𝑂 ∈ Fin) ∧ 𝑃 ∈ 𝐸))
16	14, 15	sylib 218	. . . . . 6 ⊢ (𝜑 → ((𝑀 ⊆ 𝐷 ∧ ◡𝑀 = 𝑀) ∧ (𝑂 ⊆ 𝐸 ∧ 𝑂 ∈ Fin) ∧ 𝑃 ∈ 𝐸))
17	16	simp1d 1142	. . . . 5 ⊢ (𝜑 → (𝑀 ⊆ 𝐷 ∧ ◡𝑀 = 𝑀))
18	17	simpld 494	. . . 4 ⊢ (𝜑 → 𝑀 ⊆ 𝐷)
19	16	simp2d 1143	. . . . 5 ⊢ (𝜑 → (𝑂 ⊆ 𝐸 ∧ 𝑂 ∈ Fin))
20	19	simpld 494	. . . 4 ⊢ (𝜑 → 𝑂 ⊆ 𝐸)
21		eqid 2736	. . . 4 ⊢ (mAx‘𝑇) = (mAx‘𝑇)
22		mclspps.v	. . . 4 ⊢ 𝑉 = (mVR‘𝑇)
23		mclspps.h	. . . 4 ⊢ 𝐻 = (mVH‘𝑇)
24		mclspps.w	. . . 4 ⊢ 𝑊 = (mVars‘𝑇)
25		mclspps.6	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑂) → (𝑆‘𝑥) ∈ (𝐾𝐶𝐵))
26	25	ralrimiva 3128	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝑂 (𝑆‘𝑥) ∈ (𝐾𝐶𝐵))
27	5	ffund 6666	. . . . . 6 ⊢ (𝜑 → Fun 𝑆)
28	5	fdmd 6672	. . . . . . 7 ⊢ (𝜑 → dom 𝑆 = 𝐸)
29	20, 28	sseqtrrd 3971	. . . . . 6 ⊢ (𝜑 → 𝑂 ⊆ dom 𝑆)
30		funimass5 7000	. . . . . 6 ⊢ ((Fun 𝑆 ∧ 𝑂 ⊆ dom 𝑆) → (𝑂 ⊆ (◡𝑆 “ (𝐾𝐶𝐵)) ↔ ∀𝑥 ∈ 𝑂 (𝑆‘𝑥) ∈ (𝐾𝐶𝐵)))
31	27, 29, 30	syl2anc 584	. . . . 5 ⊢ (𝜑 → (𝑂 ⊆ (◡𝑆 “ (𝐾𝐶𝐵)) ↔ ∀𝑥 ∈ 𝑂 (𝑆‘𝑥) ∈ (𝐾𝐶𝐵)))
32	26, 31	mpbird 257	. . . 4 ⊢ (𝜑 → 𝑂 ⊆ (◡𝑆 “ (𝐾𝐶𝐵)))
33	22, 3, 23	mvhf 35752	. . . . . . 7 ⊢ (𝑇 ∈ mFS → 𝐻:𝑉⟶𝐸)
34	9, 33	syl 17	. . . . . 6 ⊢ (𝜑 → 𝐻:𝑉⟶𝐸)
35	34	ffvelcdmda 7029	. . . . 5 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉) → (𝐻‘𝑣) ∈ 𝐸)
36		mclspps.7	. . . . 5 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉) → (𝑆‘(𝐻‘𝑣)) ∈ (𝐾𝐶𝐵))
37		elpreima 7003	. . . . . . 7 ⊢ (𝑆 Fn 𝐸 → ((𝐻‘𝑣) ∈ (◡𝑆 “ (𝐾𝐶𝐵)) ↔ ((𝐻‘𝑣) ∈ 𝐸 ∧ (𝑆‘(𝐻‘𝑣)) ∈ (𝐾𝐶𝐵))))
38	6, 37	syl 17	. . . . . 6 ⊢ (𝜑 → ((𝐻‘𝑣) ∈ (◡𝑆 “ (𝐾𝐶𝐵)) ↔ ((𝐻‘𝑣) ∈ 𝐸 ∧ (𝑆‘(𝐻‘𝑣)) ∈ (𝐾𝐶𝐵))))
39	38	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉) → ((𝐻‘𝑣) ∈ (◡𝑆 “ (𝐾𝐶𝐵)) ↔ ((𝐻‘𝑣) ∈ 𝐸 ∧ (𝑆‘(𝐻‘𝑣)) ∈ (𝐾𝐶𝐵))))
40	35, 36, 39	mpbir2and 713	. . . 4 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉) → (𝐻‘𝑣) ∈ (◡𝑆 “ (𝐾𝐶𝐵)))
41	9	3ad2ant1 1133	. . . . 5 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) → 𝑇 ∈ mFS)
42		mclspps.2	. . . . . 6 ⊢ (𝜑 → 𝐾 ⊆ 𝐷)
43	42	3ad2ant1 1133	. . . . 5 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) → 𝐾 ⊆ 𝐷)
44		mclspps.3	. . . . . 6 ⊢ (𝜑 → 𝐵 ⊆ 𝐸)
45	44	3ad2ant1 1133	. . . . 5 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) → 𝐵 ⊆ 𝐸)
46	13	3ad2ant1 1133	. . . . 5 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) → ⟨𝑀, 𝑂, 𝑃⟩ ∈ 𝐽)
47	1	3ad2ant1 1133	. . . . 5 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) → 𝑆 ∈ ran 𝐿)
48	25	3ad2antl1 1186	. . . . 5 ⊢ (((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) ∧ 𝑥 ∈ 𝑂) → (𝑆‘𝑥) ∈ (𝐾𝐶𝐵))
49	36	3ad2antl1 1186	. . . . 5 ⊢ (((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) ∧ 𝑣 ∈ 𝑉) → (𝑆‘(𝐻‘𝑣)) ∈ (𝐾𝐶𝐵))
50		mclspps.8	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥𝑀𝑦 ∧ 𝑎 ∈ (𝑊‘(𝑆‘(𝐻‘𝑥))) ∧ 𝑏 ∈ (𝑊‘(𝑆‘(𝐻‘𝑦))))) → 𝑎𝐾𝑏)
51	50	3ad2antl1 1186	. . . . 5 ⊢ (((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) ∧ (𝑥𝑀𝑦 ∧ 𝑎 ∈ (𝑊‘(𝑆‘(𝐻‘𝑥))) ∧ 𝑏 ∈ (𝑊‘(𝑆‘(𝐻‘𝑦))))) → 𝑎𝐾𝑏)
52		simp21 1207	. . . . 5 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) → ⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇))
53		simp22 1208	. . . . 5 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) → 𝑠 ∈ ran 𝐿)
54		simp23 1209	. . . . 5 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) → (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵)))
55		simp3 1138	. . . . 5 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) → ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀))
56	7, 3, 8, 41, 43, 45, 11, 2, 22, 23, 24, 46, 47, 48, 49, 51, 52, 53, 54, 55	mclsppslem 35777	. . . 4 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) → (𝑠‘𝑝) ∈ (◡𝑆 “ (𝐾𝐶𝐵)))
57	7, 3, 8, 9, 18, 20, 21, 2, 22, 23, 24, 32, 40, 56	mclsind 35764	. . 3 ⊢ (𝜑 → (𝑀𝐶𝑂) ⊆ (◡𝑆 “ (𝐾𝐶𝐵)))
58	10, 11, 8	elmpps 35767	. . . . 5 ⊢ (⟨𝑀, 𝑂, 𝑃⟩ ∈ 𝐽 ↔ (⟨𝑀, 𝑂, 𝑃⟩ ∈ (mPreSt‘𝑇) ∧ 𝑃 ∈ (𝑀𝐶𝑂)))
59	58	simprbi 496	. . . 4 ⊢ (⟨𝑀, 𝑂, 𝑃⟩ ∈ 𝐽 → 𝑃 ∈ (𝑀𝐶𝑂))
60	13, 59	syl 17	. . 3 ⊢ (𝜑 → 𝑃 ∈ (𝑀𝐶𝑂))
61	57, 60	sseldd 3934	. 2 ⊢ (𝜑 → 𝑃 ∈ (◡𝑆 “ (𝐾𝐶𝐵)))
62		elpreima 7003	. . 3 ⊢ (𝑆 Fn 𝐸 → (𝑃 ∈ (◡𝑆 “ (𝐾𝐶𝐵)) ↔ (𝑃 ∈ 𝐸 ∧ (𝑆‘𝑃) ∈ (𝐾𝐶𝐵))))
63	62	simplbda 499	. 2 ⊢ ((𝑆 Fn 𝐸 ∧ 𝑃 ∈ (◡𝑆 “ (𝐾𝐶𝐵))) → (𝑆‘𝑃) ∈ (𝐾𝐶𝐵))
64	6, 61, 63	syl2anc 584	1 ⊢ (𝜑 → (𝑆‘𝑃) ∈ (𝐾𝐶𝐵))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086  ∀wal 1539   = wceq 1541   ∈ wcel 2113  ∀wral 3051   ∪ cun 3899   ⊆ wss 3901  ⟨cotp 4588   class class class wbr 5098   × cxp 5622  ^◡ccnv 5623  dom cdm 5624  ran crn 5625   “ cima 5627  Fun wfun 6486   Fn wfn 6487  ⟶wf 6488  ‘cfv 6492  (class class class)co 7358  Fincfn 8883  mVRcmvar 35655  mAxcmax 35659  mExcmex 35661  mDVcmdv 35662  mVarscmvrs 35663  mSubstcmsub 35665  mVHcmvh 35666  mPreStcmpst 35667  mFScmfs 35670  mClscmcls 35671  mPPStcmpps 35672

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-rep 5224  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680  ax-cnex 11082  ax-resscn 11083  ax-1cn 11084  ax-icn 11085  ax-addcl 11086  ax-addrcl 11087  ax-mulcl 11088  ax-mulrcl 11089  ax-mulcom 11090  ax-addass 11091  ax-mulass 11092  ax-distr 11093  ax-i2m1 11094  ax-1ne0 11095  ax-1rid 11096  ax-rnegex 11097  ax-rrecex 11098  ax-cnre 11099  ax-pre-lttri 11100  ax-pre-lttrn 11101  ax-pre-ltadd 11102  ax-pre-mulgt0 11103

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3061  df-rmo 3350  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-pss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-ot 4589  df-uni 4864  df-int 4903  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-tr 5206  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7315  df-ov 7361  df-oprab 7362  df-mpo 7363  df-om 7809  df-1st 7933  df-2nd 7934  df-frecs 8223  df-wrecs 8254  df-recs 8303  df-rdg 8341  df-1o 8397  df-er 8635  df-map 8765  df-pm 8766  df-en 8884  df-dom 8885  df-sdom 8886  df-fin 8887  df-card 9851  df-pnf 11168  df-mnf 11169  df-xr 11170  df-ltxr 11171  df-le 11172  df-sub 11366  df-neg 11367  df-nn 12146  df-2 12208  df-n0 12402  df-xnn0 12475  df-z 12489  df-uz 12752  df-fz 13424  df-fzo 13571  df-seq 13925  df-hash 14254  df-word 14437  df-lsw 14486  df-concat 14494  df-s1 14520  df-substr 14565  df-pfx 14595  df-struct 17074  df-sets 17091  df-slot 17109  df-ndx 17121  df-base 17137  df-ress 17158  df-plusg 17190  df-0g 17361  df-gsum 17362  df-mgm 18565  df-sgrp 18644  df-mnd 18660  df-mhm 18708  df-submnd 18709  df-frmd 18774  df-vrmd 18775  df-mrex 35680  df-mex 35681  df-mdv 35682  df-mvrs 35683  df-mrsub 35684  df-msub 35685  df-mvh 35686  df-mpst 35687  df-msr 35688  df-msta 35689  df-mfs 35690  df-mcls 35691  df-mpps 35692

This theorem is referenced by: (None)