mclspps - Mathbox for Mario Carneiro

	Mathbox for Mario Carneiro		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > mclspps		Structured version Visualization version GIF version

Theorem mclspps 34575

Description: The closure is closed under application of provable pre-statements. (Compare mclsax 34560.) 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 34523	. . . 4 ⊢ (𝑆 ∈ ran 𝐿 → 𝑆:𝐸⟶𝐸)
5	1, 4	syl 17	. . 3 ⊢ (𝜑 → 𝑆:𝐸⟶𝐸)
6	5	ffnd 6719	. 2 ⊢ (𝜑 → 𝑆 Fn 𝐸)
7		mclspps.d	. . . 4 ⊢ 𝐷 = (mDV‘𝑇)
8		mclspps.c	. . . 4 ⊢ 𝐶 = (mCls‘𝑇)
9		mclspps.1	. . . 4 ⊢ (𝜑 → 𝑇 ∈ mFS)
10		eqid 2733	. . . . . . . . 9 ⊢ (mPreSt‘𝑇) = (mPreSt‘𝑇)
11		mclspps.j	. . . . . . . . 9 ⊢ 𝐽 = (mPPSt‘𝑇)
12	10, 11	mppspst 34565	. . . . . . . 8 ⊢ 𝐽 ⊆ (mPreSt‘𝑇)
13		mclspps.4	. . . . . . . 8 ⊢ (𝜑 → ⟨𝑀, 𝑂, 𝑃⟩ ∈ 𝐽)
14	12, 13	sselid 3981	. . . . . . 7 ⊢ (𝜑 → ⟨𝑀, 𝑂, 𝑃⟩ ∈ (mPreSt‘𝑇))
15	7, 3, 10	elmpst 34527	. . . . . . 7 ⊢ (⟨𝑀, 𝑂, 𝑃⟩ ∈ (mPreSt‘𝑇) ↔ ((𝑀 ⊆ 𝐷 ∧ ^◡𝑀 = 𝑀) ∧ (𝑂 ⊆ 𝐸 ∧ 𝑂 ∈ Fin) ∧ 𝑃 ∈ 𝐸))
16	14, 15	sylib 217	. . . . . 6 ⊢ (𝜑 → ((𝑀 ⊆ 𝐷 ∧ ^◡𝑀 = 𝑀) ∧ (𝑂 ⊆ 𝐸 ∧ 𝑂 ∈ Fin) ∧ 𝑃 ∈ 𝐸))
17	16	simp1d 1143	. . . . 5 ⊢ (𝜑 → (𝑀 ⊆ 𝐷 ∧ ^◡𝑀 = 𝑀))
18	17	simpld 496	. . . 4 ⊢ (𝜑 → 𝑀 ⊆ 𝐷)
19	16	simp2d 1144	. . . . 5 ⊢ (𝜑 → (𝑂 ⊆ 𝐸 ∧ 𝑂 ∈ Fin))
20	19	simpld 496	. . . 4 ⊢ (𝜑 → 𝑂 ⊆ 𝐸)
21		eqid 2733	. . . 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 3147	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝑂 (𝑆‘𝑥) ∈ (𝐾𝐶𝐵))
27	5	ffund 6722	. . . . . 6 ⊢ (𝜑 → Fun 𝑆)
28	5	fdmd 6729	. . . . . . 7 ⊢ (𝜑 → dom 𝑆 = 𝐸)
29	20, 28	sseqtrrd 4024	. . . . . 6 ⊢ (𝜑 → 𝑂 ⊆ dom 𝑆)
30		funimass5 7057	. . . . . 6 ⊢ ((Fun 𝑆 ∧ 𝑂 ⊆ dom 𝑆) → (𝑂 ⊆ (^◡𝑆 “ (𝐾𝐶𝐵)) ↔ ∀𝑥 ∈ 𝑂 (𝑆‘𝑥) ∈ (𝐾𝐶𝐵)))
31	27, 29, 30	syl2anc 585	. . . . 5 ⊢ (𝜑 → (𝑂 ⊆ (^◡𝑆 “ (𝐾𝐶𝐵)) ↔ ∀𝑥 ∈ 𝑂 (𝑆‘𝑥) ∈ (𝐾𝐶𝐵)))
32	26, 31	mpbird 257	. . . 4 ⊢ (𝜑 → 𝑂 ⊆ (^◡𝑆 “ (𝐾𝐶𝐵)))
33	22, 3, 23	mvhf 34549	. . . . . . 7 ⊢ (𝑇 ∈ mFS → 𝐻:𝑉⟶𝐸)
34	9, 33	syl 17	. . . . . 6 ⊢ (𝜑 → 𝐻:𝑉⟶𝐸)
35	34	ffvelcdmda 7087	. . . . 5 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉) → (𝐻‘𝑣) ∈ 𝐸)
36		mclspps.7	. . . . 5 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉) → (𝑆‘(𝐻‘𝑣)) ∈ (𝐾𝐶𝐵))
37		elpreima 7060	. . . . . . 7 ⊢ (𝑆 Fn 𝐸 → ((𝐻‘𝑣) ∈ (^◡𝑆 “ (𝐾𝐶𝐵)) ↔ ((𝐻‘𝑣) ∈ 𝐸 ∧ (𝑆‘(𝐻‘𝑣)) ∈ (𝐾𝐶𝐵))))
38	6, 37	syl 17	. . . . . 6 ⊢ (𝜑 → ((𝐻‘𝑣) ∈ (^◡𝑆 “ (𝐾𝐶𝐵)) ↔ ((𝐻‘𝑣) ∈ 𝐸 ∧ (𝑆‘(𝐻‘𝑣)) ∈ (𝐾𝐶𝐵))))
39	38	adantr 482	. . . . 5 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉) → ((𝐻‘𝑣) ∈ (^◡𝑆 “ (𝐾𝐶𝐵)) ↔ ((𝐻‘𝑣) ∈ 𝐸 ∧ (𝑆‘(𝐻‘𝑣)) ∈ (𝐾𝐶𝐵))))
40	35, 36, 39	mpbir2and 712	. . . 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 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 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 34574	. . . 4 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mAx‘𝑇) ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (^◡𝑆 “ (𝐾𝐶𝐵))) ∧ ∀𝑧∀𝑤(𝑧𝑚𝑤 → ((𝑊‘(𝑠‘(𝐻‘𝑧))) × (𝑊‘(𝑠‘(𝐻‘𝑤)))) ⊆ 𝑀)) → (𝑠‘𝑝) ∈ (^◡𝑆 “ (𝐾𝐶𝐵)))
57	7, 3, 8, 9, 18, 20, 21, 2, 22, 23, 24, 32, 40, 56	mclsind 34561	. . 3 ⊢ (𝜑 → (𝑀𝐶𝑂) ⊆ (^◡𝑆 “ (𝐾𝐶𝐵)))
58	10, 11, 8	elmpps 34564	. . . . 5 ⊢ (⟨𝑀, 𝑂, 𝑃⟩ ∈ 𝐽 ↔ (⟨𝑀, 𝑂, 𝑃⟩ ∈ (mPreSt‘𝑇) ∧ 𝑃 ∈ (𝑀𝐶𝑂)))
59	58	simprbi 498	. . . 4 ⊢ (⟨𝑀, 𝑂, 𝑃⟩ ∈ 𝐽 → 𝑃 ∈ (𝑀𝐶𝑂))
60	13, 59	syl 17	. . 3 ⊢ (𝜑 → 𝑃 ∈ (𝑀𝐶𝑂))
61	57, 60	sseldd 3984	. 2 ⊢ (𝜑 → 𝑃 ∈ (^◡𝑆 “ (𝐾𝐶𝐵)))
62		elpreima 7060	. . 3 ⊢ (𝑆 Fn 𝐸 → (𝑃 ∈ (^◡𝑆 “ (𝐾𝐶𝐵)) ↔ (𝑃 ∈ 𝐸 ∧ (𝑆‘𝑃) ∈ (𝐾𝐶𝐵))))
63	62	simplbda 501	. 2 ⊢ ((𝑆 Fn 𝐸 ∧ 𝑃 ∈ (^◡𝑆 “ (𝐾𝐶𝐵))) → (𝑆‘𝑃) ∈ (𝐾𝐶𝐵))
64	6, 61, 63	syl2anc 585	1 ⊢ (𝜑 → (𝑆‘𝑃) ∈ (𝐾𝐶𝐵))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 ∧ w3a 1088 ∀wal 1540 = wceq 1542 ∈ wcel 2107 ∀wral 3062 ∪ cun 3947 ⊆ wss 3949 ⟨cotp 4637 class class class wbr 5149 × cxp 5675 ^◡ccnv 5676 dom cdm 5677 ran crn 5678 “ cima 5680 Fun wfun 6538 Fn wfn 6539 ⟶wf 6540 ‘cfv 6544 (class class class)co 7409 Fincfn 8939 mVRcmvar 34452 mAxcmax 34456 mExcmex 34458 mDVcmdv 34459 mVarscmvrs 34460 mSubstcmsub 34462 mVHcmvh 34463 mPreStcmpst 34464 mFScmfs 34467 mClscmcls 34468 mPPStcmpps 34469

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-ot 4638 df-uni 4910 df-int 4952 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7856 df-1st 7975 df-2nd 7976 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-1o 8466 df-er 8703 df-map 8822 df-pm 8823 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-card 9934 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-sub 11446 df-neg 11447 df-nn 12213 df-2 12275 df-n0 12473 df-xnn0 12545 df-z 12559 df-uz 12823 df-fz 13485 df-fzo 13628 df-seq 13967 df-hash 14291 df-word 14465 df-lsw 14513 df-concat 14521 df-s1 14546 df-substr 14591 df-pfx 14621 df-struct 17080 df-sets 17097 df-slot 17115 df-ndx 17127 df-base 17145 df-ress 17174 df-plusg 17210 df-0g 17387 df-gsum 17388 df-mgm 18561 df-sgrp 18610 df-mnd 18626 df-mhm 18671 df-submnd 18672 df-frmd 18730 df-vrmd 18731 df-mrex 34477 df-mex 34478 df-mdv 34479 df-mvrs 34480 df-mrsub 34481 df-msub 34482 df-mvh 34483 df-mpst 34484 df-msr 34485 df-msta 34486 df-mfs 34487 df-mcls 34488 df-mpps 34489

This theorem is referenced by: (None)

W3C validator