Theorem mclsind 35768

Description: Induction theorem for closure: any other set 𝑄 closed under the axioms and the hypotheses contains all the elements of the closure. (Contributed by Mario Carneiro, 18-Jul-2016.)

Hypotheses

Ref	Expression
mclsval.d	⊢ 𝐷 = (mDV‘𝑇)
mclsval.e	⊢ 𝐸 = (mEx‘𝑇)
mclsval.c	⊢ 𝐶 = (mCls‘𝑇)
mclsval.1	⊢ (𝜑 → 𝑇 ∈ mFS)
mclsval.2	⊢ (𝜑 → 𝐾 ⊆ 𝐷)
mclsval.3	⊢ (𝜑 → 𝐵 ⊆ 𝐸)
mclsax.a	⊢ 𝐴 = (mAx‘𝑇)
mclsax.l	⊢ 𝐿 = (mSubst‘𝑇)
mclsax.v	⊢ 𝑉 = (mVR‘𝑇)
mclsax.h	⊢ 𝐻 = (mVH‘𝑇)
mclsax.w	⊢ 𝑊 = (mVars‘𝑇)
mclsind.4	⊢ (𝜑 → 𝐵 ⊆ 𝑄)
mclsind.5	⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉) → (𝐻‘𝑣) ∈ 𝑄)
mclsind.6	⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄) ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ 𝑄)

Assertion

Ref	Expression
mclsind	⊢ (𝜑 → (𝐾𝐶𝐵) ⊆ 𝑄)

Distinct variable groups:   𝑚,𝑜,𝑝,𝑠,𝑣,𝐸   𝑥,𝑚,𝐻,𝑜,𝑝,𝑠,𝑣   𝑦,𝑚,𝐵,𝑜,𝑝,𝑠,𝑣,𝑥   𝐶,𝑚,𝑜,𝑝,𝑠,𝑣,𝑥   𝑚,𝐿,𝑜,𝑝,𝑠,𝑥,𝑦   𝐴,𝑚,𝑜,𝑝,𝑠   𝑇,𝑚,𝑜,𝑝,𝑠,𝑥,𝑦   𝜑,𝑚,𝑜,𝑝,𝑠,𝑣,𝑥,𝑦   𝑄,𝑚,𝑜,𝑝,𝑠,𝑣   𝑣,𝑉,𝑥   𝑚,𝑊,𝑜,𝑝,𝑠,𝑥   𝑚,𝐾,𝑜,𝑝,𝑠,𝑣,𝑥,𝑦

Allowed substitution hints:   𝐴(𝑥,𝑦,𝑣)   𝐶(𝑦)   𝐷(𝑥,𝑦,𝑣,𝑚,𝑜,𝑠,𝑝)   𝑄(𝑥,𝑦)   𝑇(𝑣)   𝐸(𝑥,𝑦)   𝐻(𝑦)   𝐿(𝑣)   𝑉(𝑦,𝑚,𝑜,𝑠,𝑝)   𝑊(𝑦,𝑣)

Proof of Theorem mclsind

Dummy variable 𝑐 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		mclsval.d	. . 3 ⊢ 𝐷 = (mDV‘𝑇)
2		mclsval.e	. . 3 ⊢ 𝐸 = (mEx‘𝑇)
3		mclsval.c	. . 3 ⊢ 𝐶 = (mCls‘𝑇)
4		mclsval.1	. . 3 ⊢ (𝜑 → 𝑇 ∈ mFS)
5		mclsval.2	. . 3 ⊢ (𝜑 → 𝐾 ⊆ 𝐷)
6		mclsval.3	. . 3 ⊢ (𝜑 → 𝐵 ⊆ 𝐸)
7		mclsax.h	. . 3 ⊢ 𝐻 = (mVH‘𝑇)
8		mclsax.a	. . 3 ⊢ 𝐴 = (mAx‘𝑇)
9		mclsax.l	. . 3 ⊢ 𝐿 = (mSubst‘𝑇)
10		mclsax.w	. . 3 ⊢ 𝑊 = (mVars‘𝑇)
11	1, 2, 3, 4, 5, 6, 7, 8, 9, 10	mclsval 35761	. 2 ⊢ (𝜑 → (𝐾𝐶𝐵) = ∩ {𝑐 ∣ ((𝐵 ∪ ran 𝐻) ⊆ 𝑐 ∧ ∀𝑚∀𝑜∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑐 ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ 𝑐)))})
12		mclsind.4	. . . . . . 7 ⊢ (𝜑 → 𝐵 ⊆ 𝑄)
13	6, 12	ssind 4182	. . . . . 6 ⊢ (𝜑 → 𝐵 ⊆ (𝐸 ∩ 𝑄))
14		mclsax.v	. . . . . . . . . . 11 ⊢ 𝑉 = (mVR‘𝑇)
15	14, 2, 7	mvhf 35756	. . . . . . . . . 10 ⊢ (𝑇 ∈ mFS → 𝐻:𝑉⟶𝐸)
16	4, 15	syl 17	. . . . . . . . 9 ⊢ (𝜑 → 𝐻:𝑉⟶𝐸)
17	16	ffnd 6663	. . . . . . . 8 ⊢ (𝜑 → 𝐻 Fn 𝑉)
18	16	ffvelcdmda 7030	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉) → (𝐻‘𝑣) ∈ 𝐸)
19		mclsind.5	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉) → (𝐻‘𝑣) ∈ 𝑄)
20	18, 19	elind 4141	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝑉) → (𝐻‘𝑣) ∈ (𝐸 ∩ 𝑄))
21	20	ralrimiva 3130	. . . . . . . 8 ⊢ (𝜑 → ∀𝑣 ∈ 𝑉 (𝐻‘𝑣) ∈ (𝐸 ∩ 𝑄))
22		ffnfv 7065	. . . . . . . 8 ⊢ (𝐻:𝑉⟶(𝐸 ∩ 𝑄) ↔ (𝐻 Fn 𝑉 ∧ ∀𝑣 ∈ 𝑉 (𝐻‘𝑣) ∈ (𝐸 ∩ 𝑄)))
23	17, 21, 22	sylanbrc 584	. . . . . . 7 ⊢ (𝜑 → 𝐻:𝑉⟶(𝐸 ∩ 𝑄))
24	23	frnd 6670	. . . . . 6 ⊢ (𝜑 → ran 𝐻 ⊆ (𝐸 ∩ 𝑄))
25	13, 24	unssd 4133	. . . . 5 ⊢ (𝜑 → (𝐵 ∪ ran 𝐻) ⊆ (𝐸 ∩ 𝑄))
26		id 22	. . . . . . . . . . . 12 ⊢ ((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄) → (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄))
27		inss2 4179	. . . . . . . . . . . 12 ⊢ (𝐸 ∩ 𝑄) ⊆ 𝑄
28	26, 27	sstrdi 3935	. . . . . . . . . . 11 ⊢ ((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄) → (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄)
29	4	adantr 480	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄)) → 𝑇 ∈ mFS)
30		eqid 2737	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (mREx‘𝑇) = (mREx‘𝑇)
31	14, 30, 9, 2	msubff 35728	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑇 ∈ mFS → 𝐿:((mREx‘𝑇) ↑pm 𝑉)⟶(𝐸 ↑m 𝐸))
32		frn 6669	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝐿:((mREx‘𝑇) ↑pm 𝑉)⟶(𝐸 ↑m 𝐸) → ran 𝐿 ⊆ (𝐸 ↑m 𝐸))
33	29, 31, 32	3syl 18	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄)) → ran 𝐿 ⊆ (𝐸 ↑m 𝐸))
34		simpr2 1197	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄)) → 𝑠 ∈ ran 𝐿)
35	33, 34	sseldd 3923	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄)) → 𝑠 ∈ (𝐸 ↑m 𝐸))
36		elmapi 8789	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑠 ∈ (𝐸 ↑m 𝐸) → 𝑠:𝐸⟶𝐸)
37	35, 36	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄)) → 𝑠:𝐸⟶𝐸)
38		eqid 2737	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (mStat‘𝑇) = (mStat‘𝑇)
39	8, 38	maxsta 35752	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑇 ∈ mFS → 𝐴 ⊆ (mStat‘𝑇))
40	29, 39	syl 17	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄)) → 𝐴 ⊆ (mStat‘𝑇))
41		eqid 2737	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (mPreSt‘𝑇) = (mPreSt‘𝑇)
42	41, 38	mstapst 35745	. . . . . . . . . . . . . . . . . . . 20 ⊢ (mStat‘𝑇) ⊆ (mPreSt‘𝑇)
43	40, 42	sstrdi 3935	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄)) → 𝐴 ⊆ (mPreSt‘𝑇))
44		simpr1 1196	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄)) → ⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴)
45	43, 44	sseldd 3923	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄)) → ⟨𝑚, 𝑜, 𝑝⟩ ∈ (mPreSt‘𝑇))
46	1, 2, 41	elmpst 35734	. . . . . . . . . . . . . . . . . . 19 ⊢ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mPreSt‘𝑇) ↔ ((𝑚 ⊆ 𝐷 ∧ ◡𝑚 = 𝑚) ∧ (𝑜 ⊆ 𝐸 ∧ 𝑜 ∈ Fin) ∧ 𝑝 ∈ 𝐸))
47	46	simp3bi 1148	. . . . . . . . . . . . . . . . . 18 ⊢ (⟨𝑚, 𝑜, 𝑝⟩ ∈ (mPreSt‘𝑇) → 𝑝 ∈ 𝐸)
48	45, 47	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄)) → 𝑝 ∈ 𝐸)
49	37, 48	ffvelcdmd 7031	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄)) → (𝑠‘𝑝) ∈ 𝐸)
50	49	3adant3 1133	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄) ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ 𝐸)
51		mclsind.6	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄) ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ 𝑄)
52	50, 51	elind 4141	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄) ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄))
53	52	3exp 1120	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 ∧ 𝑠 ∈ ran 𝐿 ∧ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄) → (∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾) → (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄))))
54	53	3expd 1355	. . . . . . . . . . . 12 ⊢ (𝜑 → (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → (𝑠 ∈ ran 𝐿 → ((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄 → (∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾) → (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄))))))
55	54	imp31 417	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴) ∧ 𝑠 ∈ ran 𝐿) → ((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑄 → (∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾) → (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄))))
56	28, 55	syl5 34	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴) ∧ 𝑠 ∈ ran 𝐿) → ((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄) → (∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾) → (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄))))
57	56	impd 410	. . . . . . . . 9 ⊢ (((𝜑 ∧ ⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴) ∧ 𝑠 ∈ ran 𝐿) → (((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄) ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄)))
58	57	ralrimiva 3130	. . . . . . . 8 ⊢ ((𝜑 ∧ ⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴) → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄) ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄)))
59	58	ex 412	. . . . . . 7 ⊢ (𝜑 → (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄) ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄))))
60	59	alrimiv 1929	. . . . . 6 ⊢ (𝜑 → ∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄) ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄))))
61	60	alrimivv 1930	. . . . 5 ⊢ (𝜑 → ∀𝑚∀𝑜∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄) ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄))))
62	2	fvexi 6848	. . . . . . 7 ⊢ 𝐸 ∈ V
63	62	inex1 5254	. . . . . 6 ⊢ (𝐸 ∩ 𝑄) ∈ V
64		sseq2 3949	. . . . . . 7 ⊢ (𝑐 = (𝐸 ∩ 𝑄) → ((𝐵 ∪ ran 𝐻) ⊆ 𝑐 ↔ (𝐵 ∪ ran 𝐻) ⊆ (𝐸 ∩ 𝑄)))
65		sseq2 3949	. . . . . . . . . . . . 13 ⊢ (𝑐 = (𝐸 ∩ 𝑄) → ((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑐 ↔ (𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄)))
66	65	anbi1d 632	. . . . . . . . . . . 12 ⊢ (𝑐 = (𝐸 ∩ 𝑄) → (((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑐 ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) ↔ ((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄) ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾))))
67		eleq2 2826	. . . . . . . . . . . 12 ⊢ (𝑐 = (𝐸 ∩ 𝑄) → ((𝑠‘𝑝) ∈ 𝑐 ↔ (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄)))
68	66, 67	imbi12d 344	. . . . . . . . . . 11 ⊢ (𝑐 = (𝐸 ∩ 𝑄) → ((((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑐 ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ 𝑐) ↔ (((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄) ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄))))
69	68	ralbidv 3161	. . . . . . . . . 10 ⊢ (𝑐 = (𝐸 ∩ 𝑄) → (∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑐 ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ 𝑐) ↔ ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄) ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄))))
70	69	imbi2d 340	. . . . . . . . 9 ⊢ (𝑐 = (𝐸 ∩ 𝑄) → ((⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑐 ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ 𝑐)) ↔ (⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄) ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄)))))
71	70	albidv 1922	. . . . . . . 8 ⊢ (𝑐 = (𝐸 ∩ 𝑄) → (∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑐 ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ 𝑐)) ↔ ∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄) ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄)))))
72	71	2albidv 1925	. . . . . . 7 ⊢ (𝑐 = (𝐸 ∩ 𝑄) → (∀𝑚∀𝑜∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑐 ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ 𝑐)) ↔ ∀𝑚∀𝑜∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄) ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄)))))
73	64, 72	anbi12d 633	. . . . . 6 ⊢ (𝑐 = (𝐸 ∩ 𝑄) → (((𝐵 ∪ ran 𝐻) ⊆ 𝑐 ∧ ∀𝑚∀𝑜∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑐 ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ 𝑐))) ↔ ((𝐵 ∪ ran 𝐻) ⊆ (𝐸 ∩ 𝑄) ∧ ∀𝑚∀𝑜∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄) ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄))))))
74	63, 73	elab 3623	. . . . 5 ⊢ ((𝐸 ∩ 𝑄) ∈ {𝑐 ∣ ((𝐵 ∪ ran 𝐻) ⊆ 𝑐 ∧ ∀𝑚∀𝑜∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑐 ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ 𝑐)))} ↔ ((𝐵 ∪ ran 𝐻) ⊆ (𝐸 ∩ 𝑄) ∧ ∀𝑚∀𝑜∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ (𝐸 ∩ 𝑄) ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ (𝐸 ∩ 𝑄)))))
75	25, 61, 74	sylanbrc 584	. . . 4 ⊢ (𝜑 → (𝐸 ∩ 𝑄) ∈ {𝑐 ∣ ((𝐵 ∪ ran 𝐻) ⊆ 𝑐 ∧ ∀𝑚∀𝑜∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑐 ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ 𝑐)))})
76		intss1 4906	. . . 4 ⊢ ((𝐸 ∩ 𝑄) ∈ {𝑐 ∣ ((𝐵 ∪ ran 𝐻) ⊆ 𝑐 ∧ ∀𝑚∀𝑜∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑐 ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ 𝑐)))} → ∩ {𝑐 ∣ ((𝐵 ∪ ran 𝐻) ⊆ 𝑐 ∧ ∀𝑚∀𝑜∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑐 ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ 𝑐)))} ⊆ (𝐸 ∩ 𝑄))
77	75, 76	syl 17	. . 3 ⊢ (𝜑 → ∩ {𝑐 ∣ ((𝐵 ∪ ran 𝐻) ⊆ 𝑐 ∧ ∀𝑚∀𝑜∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑐 ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ 𝑐)))} ⊆ (𝐸 ∩ 𝑄))
78	77, 27	sstrdi 3935	. 2 ⊢ (𝜑 → ∩ {𝑐 ∣ ((𝐵 ∪ ran 𝐻) ⊆ 𝑐 ∧ ∀𝑚∀𝑜∀𝑝(⟨𝑚, 𝑜, 𝑝⟩ ∈ 𝐴 → ∀𝑠 ∈ ran 𝐿(((𝑠 “ (𝑜 ∪ ran 𝐻)) ⊆ 𝑐 ∧ ∀𝑥∀𝑦(𝑥𝑚𝑦 → ((𝑊‘(𝑠‘(𝐻‘𝑥))) × (𝑊‘(𝑠‘(𝐻‘𝑦)))) ⊆ 𝐾)) → (𝑠‘𝑝) ∈ 𝑐)))} ⊆ 𝑄)
79	11, 78	eqsstrd 3957	1 ⊢ (𝜑 → (𝐾𝐶𝐵) ⊆ 𝑄)

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1087  ∀wal 1540   = wceq 1542   ∈ wcel 2114  {cab 2715  ∀wral 3052   ∪ cun 3888   ∩ cin 3889   ⊆ wss 3890  ⟨cotp 4576  ∩ cint 4890   class class class wbr 5086   × cxp 5622  ^◡ccnv 5623  ran crn 5625   “ cima 5627   Fn wfn 6487  ⟶wf 6488  ‘cfv 6492  (class class class)co 7360   ↑_m cmap 8766   ↑_pm cpm 8767  Fincfn 8886  mVRcmvar 35659  mAxcmax 35663  mRExcmrex 35664  mExcmex 35665  mDVcmdv 35666  mVarscmvrs 35667  mSubstcmsub 35669  mVHcmvh 35670  mPreStcmpst 35671  mStatcmsta 35673  mFScmfs 35674  mClscmcls 35675

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 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682  ax-cnex 11085  ax-resscn 11086  ax-1cn 11087  ax-icn 11088  ax-addcl 11089  ax-addrcl 11090  ax-mulcl 11091  ax-mulrcl 11092  ax-mulcom 11093  ax-addass 11094  ax-mulass 11095  ax-distr 11096  ax-i2m1 11097  ax-1ne0 11098  ax-1rid 11099  ax-rnegex 11100  ax-rrecex 11101  ax-cnre 11102  ax-pre-lttri 11103  ax-pre-lttrn 11104  ax-pre-ltadd 11105  ax-pre-mulgt0 11106

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 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-ot 4577  df-uni 4852  df-int 4891  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  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 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-om 7811  df-1st 7935  df-2nd 7936  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-rdg 8342  df-1o 8398  df-er 8636  df-map 8768  df-pm 8769  df-en 8887  df-dom 8888  df-sdom 8889  df-fin 8890  df-card 9854  df-pnf 11172  df-mnf 11173  df-xr 11174  df-ltxr 11175  df-le 11176  df-sub 11370  df-neg 11371  df-nn 12166  df-2 12235  df-n0 12429  df-z 12516  df-uz 12780  df-fz 13453  df-fzo 13600  df-seq 13955  df-hash 14284  df-word 14467  df-concat 14524  df-s1 14550  df-struct 17108  df-sets 17125  df-slot 17143  df-ndx 17155  df-base 17171  df-ress 17192  df-plusg 17224  df-0g 17395  df-gsum 17396  df-mgm 18599  df-sgrp 18678  df-mnd 18694  df-submnd 18743  df-frmd 18808  df-mrex 35684  df-mex 35685  df-mrsub 35688  df-msub 35689  df-mvh 35690  df-mpst 35691  df-msr 35692  df-msta 35693  df-mfs 35694  df-mcls 35695

This theorem is referenced by:  mclspps  35782