Theorem mclspps 35766

Description: The closure is closed under application of provable pre-statements. (Compare mclsax 35751.) 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 35714	. . . 4 ⊢ (𝑆 ∈ ran 𝐿 → 𝑆:𝐸⟶𝐸)
5	1, 4	syl 17	. . 3 ⊢ (𝜑 → 𝑆:𝐸⟶𝐸)
6	5	ffnd 6669	. 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 35756	. . . . . . . 8 ⊢ 𝐽 ⊆ (mPreSt‘𝑇)
13		mclspps.4	. . . . . . . 8 ⊢ (𝜑 → ⟨𝑀, 𝑂, 𝑃⟩ ∈ 𝐽)
14	12, 13	sselid 3919	. . . . . . 7 ⊢ (𝜑 → ⟨𝑀, 𝑂, 𝑃⟩ ∈ (mPreSt‘𝑇))
15	7, 3, 10	elmpst 35718	. . . . . . 7 ⊢ (⟨𝑀, 𝑂, 𝑃⟩ ∈ (mPreSt‘𝑇) ↔ ((𝑀 ⊆ 𝐷 ∧ ◡𝑀 = 𝑀) ∧ (𝑂 ⊆ 𝐸 ∧ 𝑂 ∈ Fin) ∧ 𝑃 ∈ 𝐸))
16	14, 15	sylib 218	. . . . . 6 ⊢ (𝜑 → ((𝑀 ⊆ 𝐷 ∧ ◡𝑀 = 𝑀) ∧ (𝑂 ⊆ 𝐸 ∧ 𝑂 ∈ Fin) ∧ 𝑃 ∈ 𝐸))
17	16	simp1d 1143	. . . . 5 ⊢ (𝜑 → (𝑀 ⊆ 𝐷 ∧ ◡𝑀 = 𝑀))
18	17	simpld 494	. . . 4 ⊢ (𝜑 → 𝑀 ⊆ 𝐷)
19	16	simp2d 1144	. . . . 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 3129	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝑂 (𝑆‘𝑥) ∈ (𝐾𝐶𝐵))
27	5	ffund 6672	. . . . . 6 ⊢ (𝜑 → Fun 𝑆)
28	5	fdmd 6678	. . . . . . 7 ⊢ (𝜑 → dom 𝑆 = 𝐸)
29	20, 28	sseqtrrd 3959	. . . . . 6 ⊢ (𝜑 → 𝑂 ⊆ dom 𝑆)
30		funimass5 7007	. . . . . 6 ⊢ ((Fun 𝑆 ∧ 𝑂 ⊆ dom 𝑆) → (𝑂 ⊆ (◡𝑆 “ (𝐾𝐶𝐵)) ↔ ∀𝑥 ∈ 𝑂 (𝑆‘𝑥) ∈ (𝐾𝐶𝐵)))
31	27, 29, 30	syl2anc 585	. . . . 5 ⊢ (𝜑 → (𝑂 ⊆ (◡𝑆 “ (𝐾𝐶𝐵)) ↔ ∀𝑥 ∈ 𝑂 (𝑆‘𝑥) ∈ (𝐾𝐶𝐵)))
32	26, 31	mpbird 257	. . . 4 ⊢ (𝜑 → 𝑂 ⊆ (◡𝑆 “ (𝐾𝐶𝐵)))
33	22, 3, 23	mvhf 35740	. . . . . . 7 ⊢ (𝑇 ∈ mFS → 𝐻:𝑉⟶𝐸)
34	9, 33	syl 17	. . . . . 6 ⊢ (𝜑 → 𝐻:𝑉⟶𝐸)
35	34	ffvelcdmda 7036	. . . . 5 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉) → (𝐻‘𝑣) ∈ 𝐸)
36		mclspps.7	. . . . 5 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉) → (𝑆‘(𝐻‘𝑣)) ∈ (𝐾𝐶𝐵))
37		elpreima 7010	. . . . . . 7 ⊢ (𝑆 Fn 𝐸 → ((𝐻‘𝑣) ∈ (◡𝑆 “ (𝐾𝐶𝐵)) ↔ ((𝐻‘𝑣) ∈ 𝐸 ∧ (𝑆‘(𝐻‘𝑣)) ∈ (𝐾𝐶𝐵))))
38	6, 37	syl 17	. . . . . 6 ⊢ (𝜑 → ((𝐻‘𝑣) ∈ (◡𝑆 “ (𝐾𝐶𝐵)) ↔ ((𝐻‘𝑣) ∈ 𝐸 ∧ (𝑆‘(𝐻‘𝑣)) ∈ (𝐾𝐶𝐵))))
39	38	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉) → ((𝐻‘𝑣) ∈ (◡𝑆 “ (𝐾𝐶𝐵)) ↔ ((𝐻‘𝑣) ∈ 𝐸 ∧ (𝑆‘(𝐻‘𝑣)) ∈ (𝐾𝐶𝐵))))
40	35, 36, 39	mpbir2and 714	. . . 4 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉) → (𝐻‘𝑣) ∈ (◡𝑆 “ (𝐾𝐶𝐵)))
41	9	3ad2ant1 1134	. . . . 5 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) → 𝑇 ∈ mFS)
42		mclspps.2	. . . . . 6 ⊢ (𝜑 → 𝐾 ⊆ 𝐷)
43	42	3ad2ant1 1134	. . . . 5 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) → 𝐾 ⊆ 𝐷)
44		mclspps.3	. . . . . 6 ⊢ (𝜑 → 𝐵 ⊆ 𝐸)
45	44	3ad2ant1 1134	. . . . 5 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) → 𝐵 ⊆ 𝐸)
46	13	3ad2ant1 1134	. . . . 5 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) → ⟨𝑀, 𝑂, 𝑃⟩ ∈ 𝐽)
47	1	3ad2ant1 1134	. . . . 5 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) → 𝑆 ∈ ran 𝐿)
48	25	3ad2antl1 1187	. . . . 5 ⊢ (((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) ∧ 𝑥 ∈ 𝑂) → (𝑆‘𝑥) ∈ (𝐾𝐶𝐵))
49	36	3ad2antl1 1187	. . . . 5 ⊢ (((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) ∧ 𝑣 ∈ 𝑉) → (𝑆‘(𝐻‘𝑣)) ∈ (𝐾𝐶𝐵))
50		mclspps.8	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥𝑀𝑦 ∧ 𝑎 ∈ (𝑊‘(𝑆‘(𝐻‘𝑥))) ∧ 𝑏 ∈ (𝑊‘(𝑆‘(𝐻‘𝑦))))) → 𝑎𝐾𝑏)
51	50	3ad2antl1 1187	. . . . 5 ⊢ (((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) ∧ (𝑥𝑀𝑦 ∧ 𝑎 ∈ (𝑊‘(𝑆‘(𝐻‘𝑥))) ∧ 𝑏 ∈ (𝑊‘(𝑆‘(𝐻‘𝑦))))) → 𝑎𝐾𝑏)
52		simp21 1208	. . . . 5 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) → ⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇))
53		simp22 1209	. . . . 5 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) → 𝑠 ∈ ran 𝐿)
54		simp23 1210	. . . . 5 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) → (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵)))
55		simp3 1139	. . . . 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 35765	. . . 4 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) → (𝑠‘𝑝) ∈ (◡𝑆 “ (𝐾𝐶𝐵)))
57	7, 3, 8, 9, 18, 20, 21, 2, 22, 23, 24, 32, 40, 56	mclsind 35752	. . 3 ⊢ (𝜑 → (𝑀𝐶𝑂) ⊆ (◡𝑆 “ (𝐾𝐶𝐵)))
58	10, 11, 8	elmpps 35755	. . . . 5 ⊢ (⟨𝑀, 𝑂, 𝑃⟩ ∈ 𝐽 ↔ (⟨𝑀, 𝑂, 𝑃⟩ ∈ (mPreSt‘𝑇) ∧ 𝑃 ∈ (𝑀𝐶𝑂)))
59	58	simprbi 497	. . . 4 ⊢ (⟨𝑀, 𝑂, 𝑃⟩ ∈ 𝐽 → 𝑃 ∈ (𝑀𝐶𝑂))
60	13, 59	syl 17	. . 3 ⊢ (𝜑 → 𝑃 ∈ (𝑀𝐶𝑂))
61	57, 60	sseldd 3922	. 2 ⊢ (𝜑 → 𝑃 ∈ (◡𝑆 “ (𝐾𝐶𝐵)))
62		elpreima 7010	. . 3 ⊢ (𝑆 Fn 𝐸 → (𝑃 ∈ (◡𝑆 “ (𝐾𝐶𝐵)) ↔ (𝑃 ∈ 𝐸 ∧ (𝑆‘𝑃) ∈ (𝐾𝐶𝐵))))
63	62	simplbda 499	. 2 ⊢ ((𝑆 Fn 𝐸 ∧ 𝑃 ∈ (◡𝑆 “ (𝐾𝐶𝐵))) → (𝑆‘𝑃) ∈ (𝐾𝐶𝐵))
64	6, 61, 63	syl2anc 585	1 ⊢ (𝜑 → (𝑆‘𝑃) ∈ (𝐾𝐶𝐵))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087  ∀wal 1540   = wceq 1542   ∈ wcel 2114  ∀wral 3051   ∪ cun 3887   ⊆ wss 3889  ⟨cotp 4575   class class class wbr 5085   × cxp 5629  ^◡ccnv 5630  dom cdm 5631  ran crn 5632   “ cima 5634  Fun wfun 6492   Fn wfn 6493  ⟶wf 6494  ‘cfv 6498  (class class class)co 7367  Fincfn 8893  mVRcmvar 35643  mAxcmax 35647  mExcmex 35649  mDVcmdv 35650  mVarscmvrs 35651  mSubstcmsub 35653  mVHcmvh 35654  mPreStcmpst 35655  mFScmfs 35658  mClscmcls 35659  mPPStcmpps 35660

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  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 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-ot 4576  df-uni 4851  df-int 4890  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-om 7818  df-1st 7942  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-1o 8405  df-er 8643  df-map 8775  df-pm 8776  df-en 8894  df-dom 8895  df-sdom 8896  df-fin 8897  df-card 9863  df-pnf 11181  df-mnf 11182  df-xr 11183  df-ltxr 11184  df-le 11185  df-sub 11379  df-neg 11380  df-nn 12175  df-2 12244  df-n0 12438  df-xnn0 12511  df-z 12525  df-uz 12789  df-fz 13462  df-fzo 13609  df-seq 13964  df-hash 14293  df-word 14476  df-lsw 14525  df-concat 14533  df-s1 14559  df-substr 14604  df-pfx 14634  df-struct 17117  df-sets 17134  df-slot 17152  df-ndx 17164  df-base 17180  df-ress 17201  df-plusg 17233  df-0g 17404  df-gsum 17405  df-mgm 18608  df-sgrp 18687  df-mnd 18703  df-mhm 18751  df-submnd 18752  df-frmd 18817  df-vrmd 18818  df-mrex 35668  df-mex 35669  df-mdv 35670  df-mvrs 35671  df-mrsub 35672  df-msub 35673  df-mvh 35674  df-mpst 35675  df-msr 35676  df-msta 35677  df-mfs 35678  df-mcls 35679  df-mpps 35680

This theorem is referenced by: (None)