Theorem mclspps 32833

Description: The closure is closed under application of provable pre-statements. (Compare mclsax 32818.) 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 32781	. . . 4 ⊢ (𝑆 ∈ ran 𝐿 → 𝑆:𝐸⟶𝐸)
5	1, 4	syl 17	. . 3 ⊢ (𝜑 → 𝑆:𝐸⟶𝐸)
6	5	ffnd 6517	. 2 ⊢ (𝜑 → 𝑆 Fn 𝐸)
7		mclspps.d	. . . 4 ⊢ 𝐷 = (mDV‘𝑇)
8		mclspps.c	. . . 4 ⊢ 𝐶 = (mCls‘𝑇)
9		mclspps.1	. . . 4 ⊢ (𝜑 → 𝑇 ∈ mFS)
10		eqid 2823	. . . . . . . . 9 ⊢ (mPreSt‘𝑇) = (mPreSt‘𝑇)
11		mclspps.j	. . . . . . . . 9 ⊢ 𝐽 = (mPPSt‘𝑇)
12	10, 11	mppspst 32823	. . . . . . . 8 ⊢ 𝐽 ⊆ (mPreSt‘𝑇)
13		mclspps.4	. . . . . . . 8 ⊢ (𝜑 → ⟨𝑀, 𝑂, 𝑃⟩ ∈ 𝐽)
14	12, 13	sseldi 3967	. . . . . . 7 ⊢ (𝜑 → ⟨𝑀, 𝑂, 𝑃⟩ ∈ (mPreSt‘𝑇))
15	7, 3, 10	elmpst 32785	. . . . . . 7 ⊢ (⟨𝑀, 𝑂, 𝑃⟩ ∈ (mPreSt‘𝑇) ↔ ((𝑀 ⊆ 𝐷 ∧ ◡𝑀 = 𝑀) ∧ (𝑂 ⊆ 𝐸 ∧ 𝑂 ∈ Fin) ∧ 𝑃 ∈ 𝐸))
16	14, 15	sylib 220	. . . . . 6 ⊢ (𝜑 → ((𝑀 ⊆ 𝐷 ∧ ◡𝑀 = 𝑀) ∧ (𝑂 ⊆ 𝐸 ∧ 𝑂 ∈ Fin) ∧ 𝑃 ∈ 𝐸))
17	16	simp1d 1138	. . . . 5 ⊢ (𝜑 → (𝑀 ⊆ 𝐷 ∧ ◡𝑀 = 𝑀))
18	17	simpld 497	. . . 4 ⊢ (𝜑 → 𝑀 ⊆ 𝐷)
19	16	simp2d 1139	. . . . 5 ⊢ (𝜑 → (𝑂 ⊆ 𝐸 ∧ 𝑂 ∈ Fin))
20	19	simpld 497	. . . 4 ⊢ (𝜑 → 𝑂 ⊆ 𝐸)
21		eqid 2823	. . . 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 3184	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝑂 (𝑆‘𝑥) ∈ (𝐾𝐶𝐵))
27	5	ffund 6520	. . . . . 6 ⊢ (𝜑 → Fun 𝑆)
28	5	fdmd 6525	. . . . . . 7 ⊢ (𝜑 → dom 𝑆 = 𝐸)
29	20, 28	sseqtrrd 4010	. . . . . 6 ⊢ (𝜑 → 𝑂 ⊆ dom 𝑆)
30		funimass5 6827	. . . . . 6 ⊢ ((Fun 𝑆 ∧ 𝑂 ⊆ dom 𝑆) → (𝑂 ⊆ (◡𝑆 “ (𝐾𝐶𝐵)) ↔ ∀𝑥 ∈ 𝑂 (𝑆‘𝑥) ∈ (𝐾𝐶𝐵)))
31	27, 29, 30	syl2anc 586	. . . . 5 ⊢ (𝜑 → (𝑂 ⊆ (◡𝑆 “ (𝐾𝐶𝐵)) ↔ ∀𝑥 ∈ 𝑂 (𝑆‘𝑥) ∈ (𝐾𝐶𝐵)))
32	26, 31	mpbird 259	. . . 4 ⊢ (𝜑 → 𝑂 ⊆ (◡𝑆 “ (𝐾𝐶𝐵)))
33	22, 3, 23	mvhf 32807	. . . . . . 7 ⊢ (𝑇 ∈ mFS → 𝐻:𝑉⟶𝐸)
34	9, 33	syl 17	. . . . . 6 ⊢ (𝜑 → 𝐻:𝑉⟶𝐸)
35	34	ffvelrnda 6853	. . . . 5 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉) → (𝐻‘𝑣) ∈ 𝐸)
36		mclspps.7	. . . . 5 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉) → (𝑆‘(𝐻‘𝑣)) ∈ (𝐾𝐶𝐵))
37		elpreima 6830	. . . . . . 7 ⊢ (𝑆 Fn 𝐸 → ((𝐻‘𝑣) ∈ (◡𝑆 “ (𝐾𝐶𝐵)) ↔ ((𝐻‘𝑣) ∈ 𝐸 ∧ (𝑆‘(𝐻‘𝑣)) ∈ (𝐾𝐶𝐵))))
38	6, 37	syl 17	. . . . . 6 ⊢ (𝜑 → ((𝐻‘𝑣) ∈ (◡𝑆 “ (𝐾𝐶𝐵)) ↔ ((𝐻‘𝑣) ∈ 𝐸 ∧ (𝑆‘(𝐻‘𝑣)) ∈ (𝐾𝐶𝐵))))
39	38	adantr 483	. . . . 5 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉) → ((𝐻‘𝑣) ∈ (◡𝑆 “ (𝐾𝐶𝐵)) ↔ ((𝐻‘𝑣) ∈ 𝐸 ∧ (𝑆‘(𝐻‘𝑣)) ∈ (𝐾𝐶𝐵))))
40	35, 36, 39	mpbir2and 711	. . . 4 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉) → (𝐻‘𝑣) ∈ (◡𝑆 “ (𝐾𝐶𝐵)))
41	9	3ad2ant1 1129	. . . . 5 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) → 𝑇 ∈ mFS)
42		mclspps.2	. . . . . 6 ⊢ (𝜑 → 𝐾 ⊆ 𝐷)
43	42	3ad2ant1 1129	. . . . 5 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) → 𝐾 ⊆ 𝐷)
44		mclspps.3	. . . . . 6 ⊢ (𝜑 → 𝐵 ⊆ 𝐸)
45	44	3ad2ant1 1129	. . . . 5 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) → 𝐵 ⊆ 𝐸)
46	13	3ad2ant1 1129	. . . . 5 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) → ⟨𝑀, 𝑂, 𝑃⟩ ∈ 𝐽)
47	1	3ad2ant1 1129	. . . . 5 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) → 𝑆 ∈ ran 𝐿)
48	25	3ad2antl1 1181	. . . . 5 ⊢ (((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) ∧ 𝑥 ∈ 𝑂) → (𝑆‘𝑥) ∈ (𝐾𝐶𝐵))
49	36	3ad2antl1 1181	. . . . 5 ⊢ (((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) ∧ 𝑣 ∈ 𝑉) → (𝑆‘(𝐻‘𝑣)) ∈ (𝐾𝐶𝐵))
50		mclspps.8	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥𝑀𝑦 ∧ 𝑎 ∈ (𝑊‘(𝑆‘(𝐻‘𝑥))) ∧ 𝑏 ∈ (𝑊‘(𝑆‘(𝐻‘𝑦))))) → 𝑎𝐾𝑏)
51	50	3ad2antl1 1181	. . . . 5 ⊢ (((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) ∧ (𝑥𝑀𝑦 ∧ 𝑎 ∈ (𝑊‘(𝑆‘(𝐻‘𝑥))) ∧ 𝑏 ∈ (𝑊‘(𝑆‘(𝐻‘𝑦))))) → 𝑎𝐾𝑏)
52		simp21 1202	. . . . 5 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) → ⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇))
53		simp22 1203	. . . . 5 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) → 𝑠 ∈ ran 𝐿)
54		simp23 1204	. . . . 5 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) → (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵)))
55		simp3 1134	. . . . 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 32832	. . . 4 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) → (𝑠‘𝑝) ∈ (◡𝑆 “ (𝐾𝐶𝐵)))
57	7, 3, 8, 9, 18, 20, 21, 2, 22, 23, 24, 32, 40, 56	mclsind 32819	. . 3 ⊢ (𝜑 → (𝑀𝐶𝑂) ⊆ (◡𝑆 “ (𝐾𝐶𝐵)))
58	10, 11, 8	elmpps 32822	. . . . 5 ⊢ (⟨𝑀, 𝑂, 𝑃⟩ ∈ 𝐽 ↔ (⟨𝑀, 𝑂, 𝑃⟩ ∈ (mPreSt‘𝑇) ∧ 𝑃 ∈ (𝑀𝐶𝑂)))
59	58	simprbi 499	. . . 4 ⊢ (⟨𝑀, 𝑂, 𝑃⟩ ∈ 𝐽 → 𝑃 ∈ (𝑀𝐶𝑂))
60	13, 59	syl 17	. . 3 ⊢ (𝜑 → 𝑃 ∈ (𝑀𝐶𝑂))
61	57, 60	sseldd 3970	. 2 ⊢ (𝜑 → 𝑃 ∈ (◡𝑆 “ (𝐾𝐶𝐵)))
62		elpreima 6830	. . 3 ⊢ (𝑆 Fn 𝐸 → (𝑃 ∈ (◡𝑆 “ (𝐾𝐶𝐵)) ↔ (𝑃 ∈ 𝐸 ∧ (𝑆‘𝑃) ∈ (𝐾𝐶𝐵))))
63	62	simplbda 502	. 2 ⊢ ((𝑆 Fn 𝐸 ∧ 𝑃 ∈ (◡𝑆 “ (𝐾𝐶𝐵))) → (𝑆‘𝑃) ∈ (𝐾𝐶𝐵))
64	6, 61, 63	syl2anc 586	1 ⊢ (𝜑 → (𝑆‘𝑃) ∈ (𝐾𝐶𝐵))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   ∧ w3a 1083  ∀wal 1535   = wceq 1537   ∈ wcel 2114  ∀wral 3140   ∪ cun 3936   ⊆ wss 3938  ⟨cotp 4577   class class class wbr 5068   × cxp 5555  ^◡ccnv 5556  dom cdm 5557  ran crn 5558   “ cima 5560  Fun wfun 6351   Fn wfn 6352  ⟶wf 6353  ‘cfv 6357  (class class class)co 7158  Fincfn 8511  mVRcmvar 32710  mAxcmax 32714  mExcmex 32716  mDVcmdv 32717  mVarscmvrs 32718  mSubstcmsub 32720  mVHcmvh 32721  mPreStcmpst 32722  mFScmfs 32725  mClscmcls 32726  mPPStcmpps 32727

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 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-rep 5192  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463  ax-cnex 10595  ax-resscn 10596  ax-1cn 10597  ax-icn 10598  ax-addcl 10599  ax-addrcl 10600  ax-mulcl 10601  ax-mulrcl 10602  ax-mulcom 10603  ax-addass 10604  ax-mulass 10605  ax-distr 10606  ax-i2m1 10607  ax-1ne0 10608  ax-1rid 10609  ax-rnegex 10610  ax-rrecex 10611  ax-cnre 10612  ax-pre-lttri 10613  ax-pre-lttrn 10614  ax-pre-ltadd 10615  ax-pre-mulgt0 10616

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-fal 1550  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-nel 3126  df-ral 3145  df-rex 3146  df-reu 3147  df-rmo 3148  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-pss 3956  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-tp 4574  df-op 4576  df-ot 4578  df-uni 4841  df-int 4879  df-iun 4923  df-br 5069  df-opab 5131  df-mpt 5149  df-tr 5175  df-id 5462  df-eprel 5467  df-po 5476  df-so 5477  df-fr 5516  df-we 5518  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-pred 6150  df-ord 6196  df-on 6197  df-lim 6198  df-suc 6199  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-riota 7116  df-ov 7161  df-oprab 7162  df-mpo 7163  df-om 7583  df-1st 7691  df-2nd 7692  df-wrecs 7949  df-recs 8010  df-rdg 8048  df-1o 8104  df-oadd 8108  df-er 8291  df-map 8410  df-pm 8411  df-en 8512  df-dom 8513  df-sdom 8514  df-fin 8515  df-card 9370  df-pnf 10679  df-mnf 10680  df-xr 10681  df-ltxr 10682  df-le 10683  df-sub 10874  df-neg 10875  df-nn 11641  df-2 11703  df-n0 11901  df-xnn0 11971  df-z 11985  df-uz 12247  df-fz 12896  df-fzo 13037  df-seq 13373  df-hash 13694  df-word 13865  df-lsw 13917  df-concat 13925  df-s1 13952  df-substr 14005  df-pfx 14035  df-struct 16487  df-ndx 16488  df-slot 16489  df-base 16491  df-sets 16492  df-ress 16493  df-plusg 16580  df-0g 16717  df-gsum 16718  df-mgm 17854  df-sgrp 17903  df-mnd 17914  df-mhm 17958  df-submnd 17959  df-frmd 18016  df-vrmd 18017  df-mrex 32735  df-mex 32736  df-mdv 32737  df-mvrs 32738  df-mrsub 32739  df-msub 32740  df-mvh 32741  df-mpst 32742  df-msr 32743  df-msta 32744  df-mfs 32745  df-mcls 32746  df-mpps 32747

This theorem is referenced by: (None)