mdetunilem2 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > mdetunilem2		Structured version Visualization version GIF version

Theorem mdetunilem2 22507

Description: Lemma for mdetuni 22516. (Contributed by SO, 15-Jul-2018.)

**Hypotheses**
Ref	Expression
mdetuni.a	⊢ 𝐴 = (𝑁 Mat 𝑅)
mdetuni.b	⊢ 𝐵 = (Base‘𝐴)
mdetuni.k	⊢ 𝐾 = (Base‘𝑅)
mdetuni.0g	⊢ 0 = (0_g‘𝑅)
mdetuni.1r	⊢ 1 = (1_r‘𝑅)
mdetuni.pg	⊢ + = (+_g‘𝑅)
mdetuni.tg	⊢ · = (._r‘𝑅)
mdetuni.n	⊢ (𝜑 → 𝑁 ∈ Fin)
mdetuni.r	⊢ (𝜑 → 𝑅 ∈ Ring)
mdetuni.ff	⊢ (𝜑 → 𝐷:𝐵⟶𝐾)
mdetuni.al	⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝑁 ∀𝑧 ∈ 𝑁 ((𝑦 ≠ 𝑧 ∧ ∀𝑤 ∈ 𝑁 (𝑦𝑥𝑤) = (𝑧𝑥𝑤)) → (𝐷‘𝑥) = 0 ))
mdetuni.li	⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝑁 (((𝑥 ↾ ({𝑤} × 𝑁)) = ((𝑦 ↾ ({𝑤} × 𝑁)) ∘_f + (𝑧 ↾ ({𝑤} × 𝑁))) ∧ (𝑥 ↾ ((𝑁 ∖ {𝑤}) × 𝑁)) = (𝑦 ↾ ((𝑁 ∖ {𝑤}) × 𝑁)) ∧ (𝑥 ↾ ((𝑁 ∖ {𝑤}) × 𝑁)) = (𝑧 ↾ ((𝑁 ∖ {𝑤}) × 𝑁))) → (𝐷‘𝑥) = ((𝐷‘𝑦) + (𝐷‘𝑧))))
mdetuni.sc	⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐾 ∀𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝑁 (((𝑥 ↾ ({𝑤} × 𝑁)) = ((({𝑤} × 𝑁) × {𝑦}) ∘_f · (𝑧 ↾ ({𝑤} × 𝑁))) ∧ (𝑥 ↾ ((𝑁 ∖ {𝑤}) × 𝑁)) = (𝑧 ↾ ((𝑁 ∖ {𝑤}) × 𝑁))) → (𝐷‘𝑥) = (𝑦 · (𝐷‘𝑧))))
mdetunilem2.ph	⊢ (𝜓 → 𝜑)
mdetunilem2.eg	⊢ (𝜓 → (𝐸 ∈ 𝑁 ∧ 𝐺 ∈ 𝑁 ∧ 𝐸 ≠ 𝐺))
mdetunilem2.f	⊢ ((𝜓 ∧ 𝑏 ∈ 𝑁) → 𝐹 ∈ 𝐾)
mdetunilem2.h	⊢ ((𝜓 ∧ 𝑎 ∈ 𝑁 ∧ 𝑏 ∈ 𝑁) → 𝐻 ∈ 𝐾)

**Assertion**
Ref	Expression
mdetunilem2	⊢ (𝜓 → (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻)))) = 0 )

Distinct variable groups: 𝜑,𝑥,𝑦,𝑧,𝑤,𝑎,𝑏 𝑥,𝐵,𝑦,𝑧,𝑤,𝑎,𝑏 𝑥,𝐾,𝑦,𝑧,𝑤,𝑎,𝑏 𝑥,𝑁,𝑦,𝑧,𝑤,𝑎,𝑏 𝑥,𝐷,𝑦,𝑧,𝑤,𝑎,𝑏 𝑥, · ,𝑦,𝑧,𝑤 + ,𝑎,𝑏,𝑥,𝑦,𝑧,𝑤 0 ,𝑎,𝑏,𝑥,𝑦,𝑧,𝑤 1 ,𝑎,𝑏,𝑥,𝑦,𝑧,𝑤 𝑥,𝑅,𝑦,𝑧,𝑤 𝐴,𝑎,𝑏,𝑥,𝑦,𝑧,𝑤 𝑥,𝐸,𝑦,𝑧,𝑤 𝑥,𝐹,𝑦,𝑧,𝑤 𝑥,𝐺,𝑦,𝑧,𝑤 𝑥,𝐻,𝑦,𝑧,𝑤 𝜓,𝑎,𝑏,𝑥,𝑦,𝑧,𝑤 𝐸,𝑎,𝑏 𝐺,𝑎,𝑏 𝐹,𝑎 Allowed substitution hints: 𝑅(𝑎,𝑏) · (𝑎,𝑏) 𝐹(𝑏) 𝐻(𝑎,𝑏)

**Proof of Theorem mdetunilem2**
Step	Hyp	Ref	Expression
1		mdetunilem2.ph	. 2 ⊢ (𝜓 → 𝜑)
2		mdetuni.a	. . 3 ⊢ 𝐴 = (𝑁 Mat 𝑅)
3		mdetuni.k	. . 3 ⊢ 𝐾 = (Base‘𝑅)
4		mdetuni.b	. . 3 ⊢ 𝐵 = (Base‘𝐴)
5		mdetuni.n	. . . 4 ⊢ (𝜑 → 𝑁 ∈ Fin)
6	1, 5	syl 17	. . 3 ⊢ (𝜓 → 𝑁 ∈ Fin)
7		mdetuni.r	. . . 4 ⊢ (𝜑 → 𝑅 ∈ Ring)
8	1, 7	syl 17	. . 3 ⊢ (𝜓 → 𝑅 ∈ Ring)
9		mdetunilem2.f	. . . . 5 ⊢ ((𝜓 ∧ 𝑏 ∈ 𝑁) → 𝐹 ∈ 𝐾)
10	9	3adant2 1131	. . . 4 ⊢ ((𝜓 ∧ 𝑎 ∈ 𝑁 ∧ 𝑏 ∈ 𝑁) → 𝐹 ∈ 𝐾)
11		mdetunilem2.h	. . . . 5 ⊢ ((𝜓 ∧ 𝑎 ∈ 𝑁 ∧ 𝑏 ∈ 𝑁) → 𝐻 ∈ 𝐾)
12	10, 11	ifcld 4538	. . . 4 ⊢ ((𝜓 ∧ 𝑎 ∈ 𝑁 ∧ 𝑏 ∈ 𝑁) → if(𝑎 = 𝐺, 𝐹, 𝐻) ∈ 𝐾)
13	10, 12	ifcld 4538	. . 3 ⊢ ((𝜓 ∧ 𝑎 ∈ 𝑁 ∧ 𝑏 ∈ 𝑁) → if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻)) ∈ 𝐾)
14	2, 3, 4, 6, 8, 13	matbas2d 22317	. 2 ⊢ (𝜓 → (𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻))) ∈ 𝐵)
15		eqidd 2731	. . . . 5 ⊢ ((𝜓 ∧ 𝑤 ∈ 𝑁) → (𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻))) = (𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻))))
16		iftrue 4497	. . . . . . 7 ⊢ (𝑎 = 𝐸 → if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻)) = 𝐹)
17		csbeq1a 3879	. . . . . . 7 ⊢ (𝑏 = 𝑤 → 𝐹 = ⦋𝑤 / 𝑏⦌𝐹)
18	16, 17	sylan9eq 2785	. . . . . 6 ⊢ ((𝑎 = 𝐸 ∧ 𝑏 = 𝑤) → if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻)) = ⦋𝑤 / 𝑏⦌𝐹)
19	18	adantl 481	. . . . 5 ⊢ (((𝜓 ∧ 𝑤 ∈ 𝑁) ∧ (𝑎 = 𝐸 ∧ 𝑏 = 𝑤)) → if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻)) = ⦋𝑤 / 𝑏⦌𝐹)
20		eqidd 2731	. . . . 5 ⊢ (((𝜓 ∧ 𝑤 ∈ 𝑁) ∧ 𝑎 = 𝐸) → 𝑁 = 𝑁)
21		mdetunilem2.eg	. . . . . . 7 ⊢ (𝜓 → (𝐸 ∈ 𝑁 ∧ 𝐺 ∈ 𝑁 ∧ 𝐸 ≠ 𝐺))
22	21	simp1d 1142	. . . . . 6 ⊢ (𝜓 → 𝐸 ∈ 𝑁)
23	22	adantr 480	. . . . 5 ⊢ ((𝜓 ∧ 𝑤 ∈ 𝑁) → 𝐸 ∈ 𝑁)
24		simpr 484	. . . . 5 ⊢ ((𝜓 ∧ 𝑤 ∈ 𝑁) → 𝑤 ∈ 𝑁)
25		nfv 1914	. . . . . . 7 ⊢ Ⅎ𝑏(𝜓 ∧ 𝑤 ∈ 𝑁)
26		nfcsb1v 3889	. . . . . . . 8 ⊢ Ⅎ𝑏⦋𝑤 / 𝑏⦌𝐹
27	26	nfel1 2909	. . . . . . 7 ⊢ Ⅎ𝑏⦋𝑤 / 𝑏⦌𝐹 ∈ 𝐾
28	25, 27	nfim 1896	. . . . . 6 ⊢ Ⅎ𝑏((𝜓 ∧ 𝑤 ∈ 𝑁) → ⦋𝑤 / 𝑏⦌𝐹 ∈ 𝐾)
29		eleq1w 2812	. . . . . . . 8 ⊢ (𝑏 = 𝑤 → (𝑏 ∈ 𝑁 ↔ 𝑤 ∈ 𝑁))
30	29	anbi2d 630	. . . . . . 7 ⊢ (𝑏 = 𝑤 → ((𝜓 ∧ 𝑏 ∈ 𝑁) ↔ (𝜓 ∧ 𝑤 ∈ 𝑁)))
31	17	eleq1d 2814	. . . . . . 7 ⊢ (𝑏 = 𝑤 → (𝐹 ∈ 𝐾 ↔ ⦋𝑤 / 𝑏⦌𝐹 ∈ 𝐾))
32	30, 31	imbi12d 344	. . . . . 6 ⊢ (𝑏 = 𝑤 → (((𝜓 ∧ 𝑏 ∈ 𝑁) → 𝐹 ∈ 𝐾) ↔ ((𝜓 ∧ 𝑤 ∈ 𝑁) → ⦋𝑤 / 𝑏⦌𝐹 ∈ 𝐾)))
33	28, 32, 9	chvarfv 2241	. . . . 5 ⊢ ((𝜓 ∧ 𝑤 ∈ 𝑁) → ⦋𝑤 / 𝑏⦌𝐹 ∈ 𝐾)
34		nfv 1914	. . . . 5 ⊢ Ⅎ𝑎(𝜓 ∧ 𝑤 ∈ 𝑁)
35		nfcv 2892	. . . . 5 ⊢ Ⅎ𝑏𝐸
36		nfcv 2892	. . . . 5 ⊢ Ⅎ𝑎𝑤
37		nfcv 2892	. . . . 5 ⊢ Ⅎ𝑎⦋𝑤 / 𝑏⦌𝐹
38	15, 19, 20, 23, 24, 33, 34, 25, 35, 36, 37, 26	ovmpodxf 7542	. . . 4 ⊢ ((𝜓 ∧ 𝑤 ∈ 𝑁) → (𝐸(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻)))𝑤) = ⦋𝑤 / 𝑏⦌𝐹)
39	21	simp3d 1144	. . . . . . . . . . . . 13 ⊢ (𝜓 → 𝐸 ≠ 𝐺)
40	39	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜓 ∧ 𝑤 ∈ 𝑁) → 𝐸 ≠ 𝐺)
41		neeq2 2989	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝐺 → (𝐸 ≠ 𝑎 ↔ 𝐸 ≠ 𝐺))
42	40, 41	syl5ibrcom 247	. . . . . . . . . . 11 ⊢ ((𝜓 ∧ 𝑤 ∈ 𝑁) → (𝑎 = 𝐺 → 𝐸 ≠ 𝑎))
43	42	imp 406	. . . . . . . . . 10 ⊢ (((𝜓 ∧ 𝑤 ∈ 𝑁) ∧ 𝑎 = 𝐺) → 𝐸 ≠ 𝑎)
44	43	necomd 2981	. . . . . . . . 9 ⊢ (((𝜓 ∧ 𝑤 ∈ 𝑁) ∧ 𝑎 = 𝐺) → 𝑎 ≠ 𝐸)
45	44	neneqd 2931	. . . . . . . 8 ⊢ (((𝜓 ∧ 𝑤 ∈ 𝑁) ∧ 𝑎 = 𝐺) → ¬ 𝑎 = 𝐸)
46	45	adantrr 717	. . . . . . 7 ⊢ (((𝜓 ∧ 𝑤 ∈ 𝑁) ∧ (𝑎 = 𝐺 ∧ 𝑏 = 𝑤)) → ¬ 𝑎 = 𝐸)
47	46	iffalsed 4502	. . . . . 6 ⊢ (((𝜓 ∧ 𝑤 ∈ 𝑁) ∧ (𝑎 = 𝐺 ∧ 𝑏 = 𝑤)) → if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻)) = if(𝑎 = 𝐺, 𝐹, 𝐻))
48		iftrue 4497	. . . . . . . 8 ⊢ (𝑎 = 𝐺 → if(𝑎 = 𝐺, 𝐹, 𝐻) = 𝐹)
49	48, 17	sylan9eq 2785	. . . . . . 7 ⊢ ((𝑎 = 𝐺 ∧ 𝑏 = 𝑤) → if(𝑎 = 𝐺, 𝐹, 𝐻) = ⦋𝑤 / 𝑏⦌𝐹)
50	49	adantl 481	. . . . . 6 ⊢ (((𝜓 ∧ 𝑤 ∈ 𝑁) ∧ (𝑎 = 𝐺 ∧ 𝑏 = 𝑤)) → if(𝑎 = 𝐺, 𝐹, 𝐻) = ⦋𝑤 / 𝑏⦌𝐹)
51	47, 50	eqtrd 2765	. . . . 5 ⊢ (((𝜓 ∧ 𝑤 ∈ 𝑁) ∧ (𝑎 = 𝐺 ∧ 𝑏 = 𝑤)) → if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻)) = ⦋𝑤 / 𝑏⦌𝐹)
52		eqidd 2731	. . . . 5 ⊢ (((𝜓 ∧ 𝑤 ∈ 𝑁) ∧ 𝑎 = 𝐺) → 𝑁 = 𝑁)
53	21	simp2d 1143	. . . . . 6 ⊢ (𝜓 → 𝐺 ∈ 𝑁)
54	53	adantr 480	. . . . 5 ⊢ ((𝜓 ∧ 𝑤 ∈ 𝑁) → 𝐺 ∈ 𝑁)
55		nfcv 2892	. . . . 5 ⊢ Ⅎ𝑏𝐺
56	15, 51, 52, 54, 24, 33, 34, 25, 55, 36, 37, 26	ovmpodxf 7542	. . . 4 ⊢ ((𝜓 ∧ 𝑤 ∈ 𝑁) → (𝐺(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻)))𝑤) = ⦋𝑤 / 𝑏⦌𝐹)
57	38, 56	eqtr4d 2768	. . 3 ⊢ ((𝜓 ∧ 𝑤 ∈ 𝑁) → (𝐸(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻)))𝑤) = (𝐺(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻)))𝑤))
58	57	ralrimiva 3126	. 2 ⊢ (𝜓 → ∀𝑤 ∈ 𝑁 (𝐸(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻)))𝑤) = (𝐺(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻)))𝑤))
59		mdetuni.0g	. . 3 ⊢ 0 = (0_g‘𝑅)
60		mdetuni.1r	. . 3 ⊢ 1 = (1_r‘𝑅)
61		mdetuni.pg	. . 3 ⊢ + = (+_g‘𝑅)
62		mdetuni.tg	. . 3 ⊢ · = (._r‘𝑅)
63		mdetuni.ff	. . 3 ⊢ (𝜑 → 𝐷:𝐵⟶𝐾)
64		mdetuni.al	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝑁 ∀𝑧 ∈ 𝑁 ((𝑦 ≠ 𝑧 ∧ ∀𝑤 ∈ 𝑁 (𝑦𝑥𝑤) = (𝑧𝑥𝑤)) → (𝐷‘𝑥) = 0 ))
65		mdetuni.li	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝑁 (((𝑥 ↾ ({𝑤} × 𝑁)) = ((𝑦 ↾ ({𝑤} × 𝑁)) ∘_f + (𝑧 ↾ ({𝑤} × 𝑁))) ∧ (𝑥 ↾ ((𝑁 ∖ {𝑤}) × 𝑁)) = (𝑦 ↾ ((𝑁 ∖ {𝑤}) × 𝑁)) ∧ (𝑥 ↾ ((𝑁 ∖ {𝑤}) × 𝑁)) = (𝑧 ↾ ((𝑁 ∖ {𝑤}) × 𝑁))) → (𝐷‘𝑥) = ((𝐷‘𝑦) + (𝐷‘𝑧))))
66		mdetuni.sc	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐾 ∀𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝑁 (((𝑥 ↾ ({𝑤} × 𝑁)) = ((({𝑤} × 𝑁) × {𝑦}) ∘_f · (𝑧 ↾ ({𝑤} × 𝑁))) ∧ (𝑥 ↾ ((𝑁 ∖ {𝑤}) × 𝑁)) = (𝑧 ↾ ((𝑁 ∖ {𝑤}) × 𝑁))) → (𝐷‘𝑥) = (𝑦 · (𝐷‘𝑧))))
67	2, 4, 3, 59, 60, 61, 62, 5, 7, 63, 64, 65, 66	mdetunilem1 22506	. 2 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻))) ∈ 𝐵 ∧ ∀𝑤 ∈ 𝑁 (𝐸(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻)))𝑤) = (𝐺(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻)))𝑤)) ∧ (𝐸 ∈ 𝑁 ∧ 𝐺 ∈ 𝑁 ∧ 𝐸 ≠ 𝐺)) → (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻)))) = 0 )
68	1, 14, 58, 21, 67	syl31anc 1375	1 ⊢ (𝜓 → (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻)))) = 0 )

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ≠ wne 2926 ∀wral 3045 ⦋csb 3865 ∖ cdif 3914 ifcif 4491 {csn 4592 × cxp 5639 ↾ cres 5643 ⟶wf 6510 ‘cfv 6514 (class class class)co 7390 ∈ cmpo 7392 ∘_f cof 7654 Fincfn 8921 Basecbs 17186 +_gcplusg 17227 ._rcmulr 17228 0_gc0g 17409 1_rcur 20097 Ringcrg 20149 Mat cmat 22301

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-rep 5237 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 ax-cnex 11131 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 ax-pre-mulgt0 11152

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-pss 3937 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-tp 4597 df-op 4599 df-ot 4601 df-uni 4875 df-iun 4960 df-br 5111 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5536 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5594 df-we 5596 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-om 7846 df-1st 7971 df-2nd 7972 df-supp 8143 df-frecs 8263 df-wrecs 8294 df-recs 8343 df-rdg 8381 df-1o 8437 df-er 8674 df-map 8804 df-ixp 8874 df-en 8922 df-dom 8923 df-sdom 8924 df-fin 8925 df-fsupp 9320 df-sup 9400 df-pnf 11217 df-mnf 11218 df-xr 11219 df-ltxr 11220 df-le 11221 df-sub 11414 df-neg 11415 df-nn 12194 df-2 12256 df-3 12257 df-4 12258 df-5 12259 df-6 12260 df-7 12261 df-8 12262 df-9 12263 df-n0 12450 df-z 12537 df-dec 12657 df-uz 12801 df-fz 13476 df-struct 17124 df-sets 17141 df-slot 17159 df-ndx 17171 df-base 17187 df-ress 17208 df-plusg 17240 df-mulr 17241 df-sca 17243 df-vsca 17244 df-ip 17245 df-tset 17246 df-ple 17247 df-ds 17249 df-hom 17251 df-cco 17252 df-0g 17411 df-prds 17417 df-pws 17419 df-sra 21087 df-rgmod 21088 df-dsmm 21648 df-frlm 21663 df-mat 22302

This theorem is referenced by: mdetunilem6 22511 mdetunilem8 22513

W3C validator