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 22640

Description: Lemma for mdetuni 22649. (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 4594	. . . 4 ⊢ ((𝜓 ∧ 𝑎 ∈ 𝑁 ∧ 𝑏 ∈ 𝑁) → if(𝑎 = 𝐺, 𝐹, 𝐻) ∈ 𝐾)
13	10, 12	ifcld 4594	. . 3 ⊢ ((𝜓 ∧ 𝑎 ∈ 𝑁 ∧ 𝑏 ∈ 𝑁) → if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻)) ∈ 𝐾)
14	2, 3, 4, 6, 8, 13	matbas2d 22450	. 2 ⊢ (𝜓 → (𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻))) ∈ 𝐵)
15		eqidd 2741	. . . . 5 ⊢ ((𝜓 ∧ 𝑤 ∈ 𝑁) → (𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻))) = (𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻))))
16		iftrue 4554	. . . . . . 7 ⊢ (𝑎 = 𝐸 → if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻)) = 𝐹)
17		csbeq1a 3935	. . . . . . 7 ⊢ (𝑏 = 𝑤 → 𝐹 = ⦋𝑤 / 𝑏⦌𝐹)
18	16, 17	sylan9eq 2800	. . . . . 6 ⊢ ((𝑎 = 𝐸 ∧ 𝑏 = 𝑤) → if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻)) = ⦋𝑤 / 𝑏⦌𝐹)
19	18	adantl 481	. . . . 5 ⊢ (((𝜓 ∧ 𝑤 ∈ 𝑁) ∧ (𝑎 = 𝐸 ∧ 𝑏 = 𝑤)) → if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻)) = ⦋𝑤 / 𝑏⦌𝐹)
20		eqidd 2741	. . . . 5 ⊢ (((𝜓 ∧ 𝑤 ∈ 𝑁) ∧ 𝑎 = 𝐸) → 𝑁 = 𝑁)
21		mdetunilem2.eg	. . . . . . 7 ⊢ (𝜓 → (𝐸 ∈ 𝑁 ∧ 𝐺 ∈ 𝑁 ∧ 𝐸 ≠ 𝐺))
22	21	simp1d 1142	. . . . . 6 ⊢ (𝜓 → 𝐸 ∈ 𝑁)
23	22	adantr 480	. . . . 5 ⊢ ((𝜓 ∧ 𝑤 ∈ 𝑁) → 𝐸 ∈ 𝑁)
24		simpr 484	. . . . 5 ⊢ ((𝜓 ∧ 𝑤 ∈ 𝑁) → 𝑤 ∈ 𝑁)
25		nfv 1913	. . . . . . 7 ⊢ Ⅎ𝑏(𝜓 ∧ 𝑤 ∈ 𝑁)
26		nfcsb1v 3946	. . . . . . . 8 ⊢ Ⅎ𝑏⦋𝑤 / 𝑏⦌𝐹
27	26	nfel1 2925	. . . . . . 7 ⊢ Ⅎ𝑏⦋𝑤 / 𝑏⦌𝐹 ∈ 𝐾
28	25, 27	nfim 1895	. . . . . 6 ⊢ Ⅎ𝑏((𝜓 ∧ 𝑤 ∈ 𝑁) → ⦋𝑤 / 𝑏⦌𝐹 ∈ 𝐾)
29		eleq1w 2827	. . . . . . . 8 ⊢ (𝑏 = 𝑤 → (𝑏 ∈ 𝑁 ↔ 𝑤 ∈ 𝑁))
30	29	anbi2d 629	. . . . . . 7 ⊢ (𝑏 = 𝑤 → ((𝜓 ∧ 𝑏 ∈ 𝑁) ↔ (𝜓 ∧ 𝑤 ∈ 𝑁)))
31	17	eleq1d 2829	. . . . . . 7 ⊢ (𝑏 = 𝑤 → (𝐹 ∈ 𝐾 ↔ ⦋𝑤 / 𝑏⦌𝐹 ∈ 𝐾))
32	30, 31	imbi12d 344	. . . . . 6 ⊢ (𝑏 = 𝑤 → (((𝜓 ∧ 𝑏 ∈ 𝑁) → 𝐹 ∈ 𝐾) ↔ ((𝜓 ∧ 𝑤 ∈ 𝑁) → ⦋𝑤 / 𝑏⦌𝐹 ∈ 𝐾)))
33	28, 32, 9	chvarfv 2241	. . . . 5 ⊢ ((𝜓 ∧ 𝑤 ∈ 𝑁) → ⦋𝑤 / 𝑏⦌𝐹 ∈ 𝐾)
34		nfv 1913	. . . . 5 ⊢ Ⅎ𝑎(𝜓 ∧ 𝑤 ∈ 𝑁)
35		nfcv 2908	. . . . 5 ⊢ Ⅎ𝑏𝐸
36		nfcv 2908	. . . . 5 ⊢ Ⅎ𝑎𝑤
37		nfcv 2908	. . . . 5 ⊢ Ⅎ𝑎⦋𝑤 / 𝑏⦌𝐹
38	15, 19, 20, 23, 24, 33, 34, 25, 35, 36, 37, 26	ovmpodxf 7600	. . . 4 ⊢ ((𝜓 ∧ 𝑤 ∈ 𝑁) → (𝐸(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻)))𝑤) = ⦋𝑤 / 𝑏⦌𝐹)
39	21	simp3d 1144	. . . . . . . . . . . . 13 ⊢ (𝜓 → 𝐸 ≠ 𝐺)
40	39	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜓 ∧ 𝑤 ∈ 𝑁) → 𝐸 ≠ 𝐺)
41		neeq2 3010	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝐺 → (𝐸 ≠ 𝑎 ↔ 𝐸 ≠ 𝐺))
42	40, 41	syl5ibrcom 247	. . . . . . . . . . 11 ⊢ ((𝜓 ∧ 𝑤 ∈ 𝑁) → (𝑎 = 𝐺 → 𝐸 ≠ 𝑎))
43	42	imp 406	. . . . . . . . . 10 ⊢ (((𝜓 ∧ 𝑤 ∈ 𝑁) ∧ 𝑎 = 𝐺) → 𝐸 ≠ 𝑎)
44	43	necomd 3002	. . . . . . . . 9 ⊢ (((𝜓 ∧ 𝑤 ∈ 𝑁) ∧ 𝑎 = 𝐺) → 𝑎 ≠ 𝐸)
45	44	neneqd 2951	. . . . . . . 8 ⊢ (((𝜓 ∧ 𝑤 ∈ 𝑁) ∧ 𝑎 = 𝐺) → ¬ 𝑎 = 𝐸)
46	45	adantrr 716	. . . . . . 7 ⊢ (((𝜓 ∧ 𝑤 ∈ 𝑁) ∧ (𝑎 = 𝐺 ∧ 𝑏 = 𝑤)) → ¬ 𝑎 = 𝐸)
47	46	iffalsed 4559	. . . . . 6 ⊢ (((𝜓 ∧ 𝑤 ∈ 𝑁) ∧ (𝑎 = 𝐺 ∧ 𝑏 = 𝑤)) → if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻)) = if(𝑎 = 𝐺, 𝐹, 𝐻))
48		iftrue 4554	. . . . . . . 8 ⊢ (𝑎 = 𝐺 → if(𝑎 = 𝐺, 𝐹, 𝐻) = 𝐹)
49	48, 17	sylan9eq 2800	. . . . . . 7 ⊢ ((𝑎 = 𝐺 ∧ 𝑏 = 𝑤) → if(𝑎 = 𝐺, 𝐹, 𝐻) = ⦋𝑤 / 𝑏⦌𝐹)
50	49	adantl 481	. . . . . 6 ⊢ (((𝜓 ∧ 𝑤 ∈ 𝑁) ∧ (𝑎 = 𝐺 ∧ 𝑏 = 𝑤)) → if(𝑎 = 𝐺, 𝐹, 𝐻) = ⦋𝑤 / 𝑏⦌𝐹)
51	47, 50	eqtrd 2780	. . . . 5 ⊢ (((𝜓 ∧ 𝑤 ∈ 𝑁) ∧ (𝑎 = 𝐺 ∧ 𝑏 = 𝑤)) → if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻)) = ⦋𝑤 / 𝑏⦌𝐹)
52		eqidd 2741	. . . . 5 ⊢ (((𝜓 ∧ 𝑤 ∈ 𝑁) ∧ 𝑎 = 𝐺) → 𝑁 = 𝑁)
53	21	simp2d 1143	. . . . . 6 ⊢ (𝜓 → 𝐺 ∈ 𝑁)
54	53	adantr 480	. . . . 5 ⊢ ((𝜓 ∧ 𝑤 ∈ 𝑁) → 𝐺 ∈ 𝑁)
55		nfcv 2908	. . . . 5 ⊢ Ⅎ𝑏𝐺
56	15, 51, 52, 54, 24, 33, 34, 25, 55, 36, 37, 26	ovmpodxf 7600	. . . 4 ⊢ ((𝜓 ∧ 𝑤 ∈ 𝑁) → (𝐺(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻)))𝑤) = ⦋𝑤 / 𝑏⦌𝐹)
57	38, 56	eqtr4d 2783	. . 3 ⊢ ((𝜓 ∧ 𝑤 ∈ 𝑁) → (𝐸(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻)))𝑤) = (𝐺(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻)))𝑤))
58	57	ralrimiva 3152	. 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 22639	. 2 ⊢ (((𝜑 ∧ (𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻))) ∈ 𝐵 ∧ ∀𝑤 ∈ 𝑁 (𝐸(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻)))𝑤) = (𝐺(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻)))𝑤)) ∧ (𝐸 ∈ 𝑁 ∧ 𝐺 ∈ 𝑁 ∧ 𝐸 ≠ 𝐺)) → (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻)))) = 0 )
68	1, 14, 58, 21, 67	syl31anc 1373	1 ⊢ (𝜓 → (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐹, if(𝑎 = 𝐺, 𝐹, 𝐻)))) = 0 )

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1537 ∈ wcel 2108 ≠ wne 2946 ∀wral 3067 ⦋csb 3921 ∖ cdif 3973 ifcif 4548 {csn 4648 × cxp 5698 ↾ cres 5702 ⟶wf 6569 ‘cfv 6573 (class class class)co 7448 ∈ cmpo 7450 ∘_f cof 7712 Fincfn 9003 Basecbs 17258 +_gcplusg 17311 ._rcmulr 17312 0_gc0g 17499 1_rcur 20208 Ringcrg 20260 Mat cmat 22432

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-cnex 11240 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-mulcom 11248 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 ax-pre-mulgt0 11261

This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-tp 4653 df-op 4655 df-ot 4657 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-om 7904 df-1st 8030 df-2nd 8031 df-supp 8202 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 df-1o 8522 df-er 8763 df-map 8886 df-ixp 8956 df-en 9004 df-dom 9005 df-sdom 9006 df-fin 9007 df-fsupp 9432 df-sup 9511 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11522 df-neg 11523 df-nn 12294 df-2 12356 df-3 12357 df-4 12358 df-5 12359 df-6 12360 df-7 12361 df-8 12362 df-9 12363 df-n0 12554 df-z 12640 df-dec 12759 df-uz 12904 df-fz 13568 df-struct 17194 df-sets 17211 df-slot 17229 df-ndx 17241 df-base 17259 df-ress 17288 df-plusg 17324 df-mulr 17325 df-sca 17327 df-vsca 17328 df-ip 17329 df-tset 17330 df-ple 17331 df-ds 17333 df-hom 17335 df-cco 17336 df-0g 17501 df-prds 17507 df-pws 17509 df-sra 21195 df-rgmod 21196 df-dsmm 21775 df-frlm 21790 df-mat 22433

This theorem is referenced by: mdetunilem6 22644 mdetunilem8 22646

W3C validator