Theorem mrsubco 35737

Description: The composition of two substitutions is a substitution. (Contributed by Mario Carneiro, 18-Jul-2016.)

Hypothesis

Ref	Expression
mrsubco.s	⊢ 𝑆 = (mRSubst‘𝑇)

Assertion

Ref	Expression
mrsubco	⊢ ((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) → (𝐹 ∘ 𝐺) ∈ ran 𝑆)

Proof of Theorem mrsubco

Dummy variables 𝑐 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mrsubco.s	. . . . 5 ⊢ 𝑆 = (mRSubst‘𝑇)
2		eqid 2737	. . . . 5 ⊢ (mREx‘𝑇) = (mREx‘𝑇)
3	1, 2	mrsubf 35733	. . . 4 ⊢ (𝐹 ∈ ran 𝑆 → 𝐹:(mREx‘𝑇)⟶(mREx‘𝑇))
4	3	adantr 480	. . 3 ⊢ ((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) → 𝐹:(mREx‘𝑇)⟶(mREx‘𝑇))
5	1, 2	mrsubf 35733	. . . 4 ⊢ (𝐺 ∈ ran 𝑆 → 𝐺:(mREx‘𝑇)⟶(mREx‘𝑇))
6	5	adantl 481	. . 3 ⊢ ((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) → 𝐺:(mREx‘𝑇)⟶(mREx‘𝑇))
7		fco 6694	. . 3 ⊢ ((𝐹:(mREx‘𝑇)⟶(mREx‘𝑇) ∧ 𝐺:(mREx‘𝑇)⟶(mREx‘𝑇)) → (𝐹 ∘ 𝐺):(mREx‘𝑇)⟶(mREx‘𝑇))
8	4, 6, 7	syl2anc 585	. 2 ⊢ ((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) → (𝐹 ∘ 𝐺):(mREx‘𝑇)⟶(mREx‘𝑇))
9	6	adantr 480	. . . . 5 ⊢ (((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) ∧ 𝑐 ∈ ((mCN‘𝑇) ∖ (mVR‘𝑇))) → 𝐺:(mREx‘𝑇)⟶(mREx‘𝑇))
10		eldifi 4085	. . . . . . . . 9 ⊢ (𝑐 ∈ ((mCN‘𝑇) ∖ (mVR‘𝑇)) → 𝑐 ∈ (mCN‘𝑇))
11		elun1 4136	. . . . . . . . 9 ⊢ (𝑐 ∈ (mCN‘𝑇) → 𝑐 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)))
12	10, 11	syl 17	. . . . . . . 8 ⊢ (𝑐 ∈ ((mCN‘𝑇) ∖ (mVR‘𝑇)) → 𝑐 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)))
13	12	adantl 481	. . . . . . 7 ⊢ (((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) ∧ 𝑐 ∈ ((mCN‘𝑇) ∖ (mVR‘𝑇))) → 𝑐 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)))
14	13	s1cld 14539	. . . . . 6 ⊢ (((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) ∧ 𝑐 ∈ ((mCN‘𝑇) ∖ (mVR‘𝑇))) → ⟨“𝑐”⟩ ∈ Word ((mCN‘𝑇) ∪ (mVR‘𝑇)))
15		n0i 4294	. . . . . . . . . 10 ⊢ (𝐹 ∈ ran 𝑆 → ¬ ran 𝑆 = ∅)
16	1	rnfvprc 6836	. . . . . . . . . 10 ⊢ (¬ 𝑇 ∈ V → ran 𝑆 = ∅)
17	15, 16	nsyl2 141	. . . . . . . . 9 ⊢ (𝐹 ∈ ran 𝑆 → 𝑇 ∈ V)
18	17	adantr 480	. . . . . . . 8 ⊢ ((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) → 𝑇 ∈ V)
19	18	adantr 480	. . . . . . 7 ⊢ (((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) ∧ 𝑐 ∈ ((mCN‘𝑇) ∖ (mVR‘𝑇))) → 𝑇 ∈ V)
20		eqid 2737	. . . . . . . 8 ⊢ (mCN‘𝑇) = (mCN‘𝑇)
21		eqid 2737	. . . . . . . 8 ⊢ (mVR‘𝑇) = (mVR‘𝑇)
22	20, 21, 2	mrexval 35717	. . . . . . 7 ⊢ (𝑇 ∈ V → (mREx‘𝑇) = Word ((mCN‘𝑇) ∪ (mVR‘𝑇)))
23	19, 22	syl 17	. . . . . 6 ⊢ (((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) ∧ 𝑐 ∈ ((mCN‘𝑇) ∖ (mVR‘𝑇))) → (mREx‘𝑇) = Word ((mCN‘𝑇) ∪ (mVR‘𝑇)))
24	14, 23	eleqtrrd 2840	. . . . 5 ⊢ (((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) ∧ 𝑐 ∈ ((mCN‘𝑇) ∖ (mVR‘𝑇))) → ⟨“𝑐”⟩ ∈ (mREx‘𝑇))
25		fvco3 6941	. . . . 5 ⊢ ((𝐺:(mREx‘𝑇)⟶(mREx‘𝑇) ∧ ⟨“𝑐”⟩ ∈ (mREx‘𝑇)) → ((𝐹 ∘ 𝐺)‘⟨“𝑐”⟩) = (𝐹‘(𝐺‘⟨“𝑐”⟩)))
26	9, 24, 25	syl2anc 585	. . . 4 ⊢ (((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) ∧ 𝑐 ∈ ((mCN‘𝑇) ∖ (mVR‘𝑇))) → ((𝐹 ∘ 𝐺)‘⟨“𝑐”⟩) = (𝐹‘(𝐺‘⟨“𝑐”⟩)))
27	1, 2, 21, 20	mrsubcn 35735	. . . . . 6 ⊢ ((𝐺 ∈ ran 𝑆 ∧ 𝑐 ∈ ((mCN‘𝑇) ∖ (mVR‘𝑇))) → (𝐺‘⟨“𝑐”⟩) = ⟨“𝑐”⟩)
28	27	adantll 715	. . . . 5 ⊢ (((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) ∧ 𝑐 ∈ ((mCN‘𝑇) ∖ (mVR‘𝑇))) → (𝐺‘⟨“𝑐”⟩) = ⟨“𝑐”⟩)
29	28	fveq2d 6846	. . . 4 ⊢ (((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) ∧ 𝑐 ∈ ((mCN‘𝑇) ∖ (mVR‘𝑇))) → (𝐹‘(𝐺‘⟨“𝑐”⟩)) = (𝐹‘⟨“𝑐”⟩))
30	1, 2, 21, 20	mrsubcn 35735	. . . . 5 ⊢ ((𝐹 ∈ ran 𝑆 ∧ 𝑐 ∈ ((mCN‘𝑇) ∖ (mVR‘𝑇))) → (𝐹‘⟨“𝑐”⟩) = ⟨“𝑐”⟩)
31	30	adantlr 716	. . . 4 ⊢ (((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) ∧ 𝑐 ∈ ((mCN‘𝑇) ∖ (mVR‘𝑇))) → (𝐹‘⟨“𝑐”⟩) = ⟨“𝑐”⟩)
32	26, 29, 31	3eqtrd 2776	. . 3 ⊢ (((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) ∧ 𝑐 ∈ ((mCN‘𝑇) ∖ (mVR‘𝑇))) → ((𝐹 ∘ 𝐺)‘⟨“𝑐”⟩) = ⟨“𝑐”⟩)
33	32	ralrimiva 3130	. 2 ⊢ ((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) → ∀𝑐 ∈ ((mCN‘𝑇) ∖ (mVR‘𝑇))((𝐹 ∘ 𝐺)‘⟨“𝑐”⟩) = ⟨“𝑐”⟩)
34	1, 2	mrsubccat 35734	. . . . . . . 8 ⊢ ((𝐺 ∈ ran 𝑆 ∧ 𝑥 ∈ (mREx‘𝑇) ∧ 𝑦 ∈ (mREx‘𝑇)) → (𝐺‘(𝑥 ++ 𝑦)) = ((𝐺‘𝑥) ++ (𝐺‘𝑦)))
35	34	3expb 1121	. . . . . . 7 ⊢ ((𝐺 ∈ ran 𝑆 ∧ (𝑥 ∈ (mREx‘𝑇) ∧ 𝑦 ∈ (mREx‘𝑇))) → (𝐺‘(𝑥 ++ 𝑦)) = ((𝐺‘𝑥) ++ (𝐺‘𝑦)))
36	35	adantll 715	. . . . . 6 ⊢ (((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) ∧ (𝑥 ∈ (mREx‘𝑇) ∧ 𝑦 ∈ (mREx‘𝑇))) → (𝐺‘(𝑥 ++ 𝑦)) = ((𝐺‘𝑥) ++ (𝐺‘𝑦)))
37	36	fveq2d 6846	. . . . 5 ⊢ (((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) ∧ (𝑥 ∈ (mREx‘𝑇) ∧ 𝑦 ∈ (mREx‘𝑇))) → (𝐹‘(𝐺‘(𝑥 ++ 𝑦))) = (𝐹‘((𝐺‘𝑥) ++ (𝐺‘𝑦))))
38		simpll 767	. . . . . 6 ⊢ (((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) ∧ (𝑥 ∈ (mREx‘𝑇) ∧ 𝑦 ∈ (mREx‘𝑇))) → 𝐹 ∈ ran 𝑆)
39	6	adantr 480	. . . . . . 7 ⊢ (((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) ∧ (𝑥 ∈ (mREx‘𝑇) ∧ 𝑦 ∈ (mREx‘𝑇))) → 𝐺:(mREx‘𝑇)⟶(mREx‘𝑇))
40		simprl 771	. . . . . . 7 ⊢ (((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) ∧ (𝑥 ∈ (mREx‘𝑇) ∧ 𝑦 ∈ (mREx‘𝑇))) → 𝑥 ∈ (mREx‘𝑇))
41	39, 40	ffvelcdmd 7039	. . . . . 6 ⊢ (((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) ∧ (𝑥 ∈ (mREx‘𝑇) ∧ 𝑦 ∈ (mREx‘𝑇))) → (𝐺‘𝑥) ∈ (mREx‘𝑇))
42		simprr 773	. . . . . . 7 ⊢ (((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) ∧ (𝑥 ∈ (mREx‘𝑇) ∧ 𝑦 ∈ (mREx‘𝑇))) → 𝑦 ∈ (mREx‘𝑇))
43	39, 42	ffvelcdmd 7039	. . . . . 6 ⊢ (((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) ∧ (𝑥 ∈ (mREx‘𝑇) ∧ 𝑦 ∈ (mREx‘𝑇))) → (𝐺‘𝑦) ∈ (mREx‘𝑇))
44	1, 2	mrsubccat 35734	. . . . . 6 ⊢ ((𝐹 ∈ ran 𝑆 ∧ (𝐺‘𝑥) ∈ (mREx‘𝑇) ∧ (𝐺‘𝑦) ∈ (mREx‘𝑇)) → (𝐹‘((𝐺‘𝑥) ++ (𝐺‘𝑦))) = ((𝐹‘(𝐺‘𝑥)) ++ (𝐹‘(𝐺‘𝑦))))
45	38, 41, 43, 44	syl3anc 1374	. . . . 5 ⊢ (((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) ∧ (𝑥 ∈ (mREx‘𝑇) ∧ 𝑦 ∈ (mREx‘𝑇))) → (𝐹‘((𝐺‘𝑥) ++ (𝐺‘𝑦))) = ((𝐹‘(𝐺‘𝑥)) ++ (𝐹‘(𝐺‘𝑦))))
46	37, 45	eqtrd 2772	. . . 4 ⊢ (((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) ∧ (𝑥 ∈ (mREx‘𝑇) ∧ 𝑦 ∈ (mREx‘𝑇))) → (𝐹‘(𝐺‘(𝑥 ++ 𝑦))) = ((𝐹‘(𝐺‘𝑥)) ++ (𝐹‘(𝐺‘𝑦))))
47	18, 22	syl 17	. . . . . . . . 9 ⊢ ((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) → (mREx‘𝑇) = Word ((mCN‘𝑇) ∪ (mVR‘𝑇)))
48	47	adantr 480	. . . . . . . 8 ⊢ (((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) ∧ (𝑥 ∈ (mREx‘𝑇) ∧ 𝑦 ∈ (mREx‘𝑇))) → (mREx‘𝑇) = Word ((mCN‘𝑇) ∪ (mVR‘𝑇)))
49	40, 48	eleqtrd 2839	. . . . . . 7 ⊢ (((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) ∧ (𝑥 ∈ (mREx‘𝑇) ∧ 𝑦 ∈ (mREx‘𝑇))) → 𝑥 ∈ Word ((mCN‘𝑇) ∪ (mVR‘𝑇)))
50	42, 48	eleqtrd 2839	. . . . . . 7 ⊢ (((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) ∧ (𝑥 ∈ (mREx‘𝑇) ∧ 𝑦 ∈ (mREx‘𝑇))) → 𝑦 ∈ Word ((mCN‘𝑇) ∪ (mVR‘𝑇)))
51		ccatcl 14509	. . . . . . 7 ⊢ ((𝑥 ∈ Word ((mCN‘𝑇) ∪ (mVR‘𝑇)) ∧ 𝑦 ∈ Word ((mCN‘𝑇) ∪ (mVR‘𝑇))) → (𝑥 ++ 𝑦) ∈ Word ((mCN‘𝑇) ∪ (mVR‘𝑇)))
52	49, 50, 51	syl2anc 585	. . . . . 6 ⊢ (((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) ∧ (𝑥 ∈ (mREx‘𝑇) ∧ 𝑦 ∈ (mREx‘𝑇))) → (𝑥 ++ 𝑦) ∈ Word ((mCN‘𝑇) ∪ (mVR‘𝑇)))
53	52, 48	eleqtrrd 2840	. . . . 5 ⊢ (((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) ∧ (𝑥 ∈ (mREx‘𝑇) ∧ 𝑦 ∈ (mREx‘𝑇))) → (𝑥 ++ 𝑦) ∈ (mREx‘𝑇))
54		fvco3 6941	. . . . 5 ⊢ ((𝐺:(mREx‘𝑇)⟶(mREx‘𝑇) ∧ (𝑥 ++ 𝑦) ∈ (mREx‘𝑇)) → ((𝐹 ∘ 𝐺)‘(𝑥 ++ 𝑦)) = (𝐹‘(𝐺‘(𝑥 ++ 𝑦))))
55	39, 53, 54	syl2anc 585	. . . 4 ⊢ (((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) ∧ (𝑥 ∈ (mREx‘𝑇) ∧ 𝑦 ∈ (mREx‘𝑇))) → ((𝐹 ∘ 𝐺)‘(𝑥 ++ 𝑦)) = (𝐹‘(𝐺‘(𝑥 ++ 𝑦))))
56		fvco3 6941	. . . . . 6 ⊢ ((𝐺:(mREx‘𝑇)⟶(mREx‘𝑇) ∧ 𝑥 ∈ (mREx‘𝑇)) → ((𝐹 ∘ 𝐺)‘𝑥) = (𝐹‘(𝐺‘𝑥)))
57	39, 40, 56	syl2anc 585	. . . . 5 ⊢ (((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) ∧ (𝑥 ∈ (mREx‘𝑇) ∧ 𝑦 ∈ (mREx‘𝑇))) → ((𝐹 ∘ 𝐺)‘𝑥) = (𝐹‘(𝐺‘𝑥)))
58		fvco3 6941	. . . . . 6 ⊢ ((𝐺:(mREx‘𝑇)⟶(mREx‘𝑇) ∧ 𝑦 ∈ (mREx‘𝑇)) → ((𝐹 ∘ 𝐺)‘𝑦) = (𝐹‘(𝐺‘𝑦)))
59	39, 42, 58	syl2anc 585	. . . . 5 ⊢ (((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) ∧ (𝑥 ∈ (mREx‘𝑇) ∧ 𝑦 ∈ (mREx‘𝑇))) → ((𝐹 ∘ 𝐺)‘𝑦) = (𝐹‘(𝐺‘𝑦)))
60	57, 59	oveq12d 7386	. . . 4 ⊢ (((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) ∧ (𝑥 ∈ (mREx‘𝑇) ∧ 𝑦 ∈ (mREx‘𝑇))) → (((𝐹 ∘ 𝐺)‘𝑥) ++ ((𝐹 ∘ 𝐺)‘𝑦)) = ((𝐹‘(𝐺‘𝑥)) ++ (𝐹‘(𝐺‘𝑦))))
61	46, 55, 60	3eqtr4d 2782	. . 3 ⊢ (((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) ∧ (𝑥 ∈ (mREx‘𝑇) ∧ 𝑦 ∈ (mREx‘𝑇))) → ((𝐹 ∘ 𝐺)‘(𝑥 ++ 𝑦)) = (((𝐹 ∘ 𝐺)‘𝑥) ++ ((𝐹 ∘ 𝐺)‘𝑦)))
62	61	ralrimivva 3181	. 2 ⊢ ((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) → ∀𝑥 ∈ (mREx‘𝑇)∀𝑦 ∈ (mREx‘𝑇)((𝐹 ∘ 𝐺)‘(𝑥 ++ 𝑦)) = (((𝐹 ∘ 𝐺)‘𝑥) ++ ((𝐹 ∘ 𝐺)‘𝑦)))
63	1, 2, 21, 20	elmrsubrn 35736	. . 3 ⊢ (𝑇 ∈ V → ((𝐹 ∘ 𝐺) ∈ ran 𝑆 ↔ ((𝐹 ∘ 𝐺):(mREx‘𝑇)⟶(mREx‘𝑇) ∧ ∀𝑐 ∈ ((mCN‘𝑇) ∖ (mVR‘𝑇))((𝐹 ∘ 𝐺)‘⟨“𝑐”⟩) = ⟨“𝑐”⟩ ∧ ∀𝑥 ∈ (mREx‘𝑇)∀𝑦 ∈ (mREx‘𝑇)((𝐹 ∘ 𝐺)‘(𝑥 ++ 𝑦)) = (((𝐹 ∘ 𝐺)‘𝑥) ++ ((𝐹 ∘ 𝐺)‘𝑦)))))
64	18, 63	syl 17	. 2 ⊢ ((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) → ((𝐹 ∘ 𝐺) ∈ ran 𝑆 ↔ ((𝐹 ∘ 𝐺):(mREx‘𝑇)⟶(mREx‘𝑇) ∧ ∀𝑐 ∈ ((mCN‘𝑇) ∖ (mVR‘𝑇))((𝐹 ∘ 𝐺)‘⟨“𝑐”⟩) = ⟨“𝑐”⟩ ∧ ∀𝑥 ∈ (mREx‘𝑇)∀𝑦 ∈ (mREx‘𝑇)((𝐹 ∘ 𝐺)‘(𝑥 ++ 𝑦)) = (((𝐹 ∘ 𝐺)‘𝑥) ++ ((𝐹 ∘ 𝐺)‘𝑦)))))
65	8, 33, 62, 64	mpbir3and 1344	1 ⊢ ((𝐹 ∈ ran 𝑆 ∧ 𝐺 ∈ ran 𝑆) → (𝐹 ∘ 𝐺) ∈ ran 𝑆)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114  ∀wral 3052  Vcvv 3442   ∖ cdif 3900   ∪ cun 3901  ∅c0 4287  ran crn 5633   ∘ ccom 5636  ⟶wf 6496  ‘cfv 6500  (class class class)co 7368  Word cword 14448   ++ cconcat 14505  ⟨“cs1 14531  mCNcmcn 35676  mVRcmvar 35677  mRExcmrex 35682  mRSubstcmrsub 35686

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 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690  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 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 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4905  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-riota 7325  df-ov 7371  df-oprab 7372  df-mpo 7373  df-om 7819  df-1st 7943  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-rdg 8351  df-1o 8407  df-er 8645  df-map 8777  df-pm 8778  df-en 8896  df-dom 8897  df-sdom 8898  df-fin 8899  df-card 9863  df-pnf 11180  df-mnf 11181  df-xr 11182  df-ltxr 11183  df-le 11184  df-sub 11378  df-neg 11379  df-nn 12158  df-2 12220  df-n0 12414  df-xnn0 12487  df-z 12501  df-uz 12764  df-fz 13436  df-fzo 13583  df-seq 13937  df-hash 14266  df-word 14449  df-lsw 14498  df-concat 14506  df-s1 14532  df-substr 14577  df-pfx 14607  df-struct 17086  df-sets 17103  df-slot 17121  df-ndx 17133  df-base 17149  df-ress 17170  df-plusg 17202  df-0g 17373  df-gsum 17374  df-mgm 18577  df-sgrp 18656  df-mnd 18672  df-mhm 18720  df-submnd 18721  df-frmd 18786  df-vrmd 18787  df-mrex 35702  df-mrsub 35706

This theorem is referenced by:  msubco  35747