mdetunilem6 - Metamath Proof Explorer

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

Theorem mdetunilem6 22677

Description: Lemma for mdetuni 22682. (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 · (𝑧 ↾ ({𝑤} × 𝑁))) ∧ (𝑥 ↾ ((𝑁 ∖ {𝑤}) × 𝑁)) = (𝑧 ↾ ((𝑁 ∖ {𝑤}) × 𝑁))) → (𝐷‘𝑥) = (𝑦 · (𝐷‘𝑧))))
mdetunilem6.ph	⊢ (𝜓 → 𝜑)
mdetunilem6.ef	⊢ (𝜓 → (𝐸 ∈ 𝑁 ∧ 𝐹 ∈ 𝑁 ∧ 𝐸 ≠ 𝐹))
mdetunilem6.gh	⊢ ((𝜓 ∧ 𝑏 ∈ 𝑁) → (𝐺 ∈ 𝐾 ∧ 𝐻 ∈ 𝐾))
mdetunilem6.i	⊢ ((𝜓 ∧ 𝑎 ∈ 𝑁 ∧ 𝑏 ∈ 𝑁) → 𝐼 ∈ 𝐾)

**Assertion**
Ref	Expression
mdetunilem6	⊢ (𝜓 → (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐺, if(𝑎 = 𝐹, 𝐻, 𝐼)))) = ((inv_g‘𝑅)‘(𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐻, if(𝑎 = 𝐹, 𝐺, 𝐼))))))

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

**Proof of Theorem mdetunilem6**
Step	Hyp	Ref	Expression
1		mdetuni.a	. . . . 5 ⊢ 𝐴 = (𝑁 Mat 𝑅)
2		mdetuni.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐴)
3		mdetuni.k	. . . . 5 ⊢ 𝐾 = (Base‘𝑅)
4		mdetuni.0g	. . . . 5 ⊢ 0 = (0_g‘𝑅)
5		mdetuni.1r	. . . . 5 ⊢ 1 = (1_r‘𝑅)
6		mdetuni.pg	. . . . 5 ⊢ + = (+_g‘𝑅)
7		mdetuni.tg	. . . . 5 ⊢ · = (._r‘𝑅)
8		mdetuni.n	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ Fin)
9		mdetuni.r	. . . . 5 ⊢ (𝜑 → 𝑅 ∈ Ring)
10		mdetuni.ff	. . . . 5 ⊢ (𝜑 → 𝐷:𝐵⟶𝐾)
11		mdetuni.al	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝑁 ∀𝑧 ∈ 𝑁 ((𝑦 ≠ 𝑧 ∧ ∀𝑤 ∈ 𝑁 (𝑦𝑥𝑤) = (𝑧𝑥𝑤)) → (𝐷‘𝑥) = 0 ))
12		mdetuni.li	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝑁 (((𝑥 ↾ ({𝑤} × 𝑁)) = ((𝑦 ↾ ({𝑤} × 𝑁)) ∘_f + (𝑧 ↾ ({𝑤} × 𝑁))) ∧ (𝑥 ↾ ((𝑁 ∖ {𝑤}) × 𝑁)) = (𝑦 ↾ ((𝑁 ∖ {𝑤}) × 𝑁)) ∧ (𝑥 ↾ ((𝑁 ∖ {𝑤}) × 𝑁)) = (𝑧 ↾ ((𝑁 ∖ {𝑤}) × 𝑁))) → (𝐷‘𝑥) = ((𝐷‘𝑦) + (𝐷‘𝑧))))
13		mdetuni.sc	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐾 ∀𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝑁 (((𝑥 ↾ ({𝑤} × 𝑁)) = ((({𝑤} × 𝑁) × {𝑦}) ∘_f · (𝑧 ↾ ({𝑤} × 𝑁))) ∧ (𝑥 ↾ ((𝑁 ∖ {𝑤}) × 𝑁)) = (𝑧 ↾ ((𝑁 ∖ {𝑤}) × 𝑁))) → (𝐷‘𝑥) = (𝑦 · (𝐷‘𝑧))))
14		mdetunilem6.ph	. . . . 5 ⊢ (𝜓 → 𝜑)
15		mdetunilem6.ef	. . . . . 6 ⊢ (𝜓 → (𝐸 ∈ 𝑁 ∧ 𝐹 ∈ 𝑁 ∧ 𝐸 ≠ 𝐹))
16	15	simp1d 1155	. . . . 5 ⊢ (𝜓 → 𝐸 ∈ 𝑁)
17		mdetunilem6.gh	. . . . . . . 8 ⊢ ((𝜓 ∧ 𝑏 ∈ 𝑁) → (𝐺 ∈ 𝐾 ∧ 𝐻 ∈ 𝐾))
18	17	simprd 499	. . . . . . 7 ⊢ ((𝜓 ∧ 𝑏 ∈ 𝑁) → 𝐻 ∈ 𝐾)
19	18	3adant2 1144	. . . . . 6 ⊢ ((𝜓 ∧ 𝑎 ∈ 𝑁 ∧ 𝑏 ∈ 𝑁) → 𝐻 ∈ 𝐾)
20	17	simpld 498	. . . . . . 7 ⊢ ((𝜓 ∧ 𝑏 ∈ 𝑁) → 𝐺 ∈ 𝐾)
21	20	3adant2 1144	. . . . . 6 ⊢ ((𝜓 ∧ 𝑎 ∈ 𝑁 ∧ 𝑏 ∈ 𝑁) → 𝐺 ∈ 𝐾)
22		ringgrp 20288	. . . . . . . . . . 11 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Grp)
23	14, 9, 22	3syl 18	. . . . . . . . . 10 ⊢ (𝜓 → 𝑅 ∈ Grp)
24	23	adantr 484	. . . . . . . . 9 ⊢ ((𝜓 ∧ 𝑏 ∈ 𝑁) → 𝑅 ∈ Grp)
25	3, 6	grpcl 18983	. . . . . . . . 9 ⊢ ((𝑅 ∈ Grp ∧ 𝐻 ∈ 𝐾 ∧ 𝐺 ∈ 𝐾) → (𝐻 + 𝐺) ∈ 𝐾)
26	24, 18, 20, 25	syl3anc 1390	. . . . . . . 8 ⊢ ((𝜓 ∧ 𝑏 ∈ 𝑁) → (𝐻 + 𝐺) ∈ 𝐾)
27	26	3adant2 1144	. . . . . . 7 ⊢ ((𝜓 ∧ 𝑎 ∈ 𝑁 ∧ 𝑏 ∈ 𝑁) → (𝐻 + 𝐺) ∈ 𝐾)
28		mdetunilem6.i	. . . . . . 7 ⊢ ((𝜓 ∧ 𝑎 ∈ 𝑁 ∧ 𝑏 ∈ 𝑁) → 𝐼 ∈ 𝐾)
29	27, 28	ifcld 4527	. . . . . 6 ⊢ ((𝜓 ∧ 𝑎 ∈ 𝑁 ∧ 𝑏 ∈ 𝑁) → if(𝑎 = 𝐹, (𝐻 + 𝐺), 𝐼) ∈ 𝐾)
30	19, 21, 29	3jca 1141	. . . . 5 ⊢ ((𝜓 ∧ 𝑎 ∈ 𝑁 ∧ 𝑏 ∈ 𝑁) → (𝐻 ∈ 𝐾 ∧ 𝐺 ∈ 𝐾 ∧ if(𝑎 = 𝐹, (𝐻 + 𝐺), 𝐼) ∈ 𝐾))
31	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 16, 30	mdetunilem5 22676	. . . 4 ⊢ (𝜓 → (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, (𝐻 + 𝐺), if(𝑎 = 𝐹, (𝐻 + 𝐺), 𝐼)))) = ((𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐻, if(𝑎 = 𝐹, (𝐻 + 𝐺), 𝐼)))) + (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐺, if(𝑎 = 𝐹, (𝐻 + 𝐺), 𝐼))))))
32	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 26, 28	mdetunilem2 22673	. . . 4 ⊢ (𝜓 → (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, (𝐻 + 𝐺), if(𝑎 = 𝐹, (𝐻 + 𝐺), 𝐼)))) = 0 )
33	15	simp2d 1156	. . . . . . . 8 ⊢ (𝜓 → 𝐹 ∈ 𝑁)
34	19, 28	ifcld 4527	. . . . . . . . 9 ⊢ ((𝜓 ∧ 𝑎 ∈ 𝑁 ∧ 𝑏 ∈ 𝑁) → if(𝑎 = 𝐸, 𝐻, 𝐼) ∈ 𝐾)
35	19, 21, 34	3jca 1141	. . . . . . . 8 ⊢ ((𝜓 ∧ 𝑎 ∈ 𝑁 ∧ 𝑏 ∈ 𝑁) → (𝐻 ∈ 𝐾 ∧ 𝐺 ∈ 𝐾 ∧ if(𝑎 = 𝐸, 𝐻, 𝐼) ∈ 𝐾))
36	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 33, 35	mdetunilem5 22676	. . . . . . 7 ⊢ (𝜓 → (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, (𝐻 + 𝐺), if(𝑎 = 𝐸, 𝐻, 𝐼)))) = ((𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, 𝐻, if(𝑎 = 𝐸, 𝐻, 𝐼)))) + (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, 𝐺, if(𝑎 = 𝐸, 𝐻, 𝐼))))))
37	15	simp3d 1157	. . . . . . . . . . 11 ⊢ (𝜓 → 𝐸 ≠ 𝐹)
38	37	necomd 3012	. . . . . . . . . 10 ⊢ (𝜓 → 𝐹 ≠ 𝐸)
39	33, 16, 38	3jca 1141	. . . . . . . . 9 ⊢ (𝜓 → (𝐹 ∈ 𝑁 ∧ 𝐸 ∈ 𝑁 ∧ 𝐹 ≠ 𝐸))
40	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 39, 18, 28	mdetunilem2 22673	. . . . . . . 8 ⊢ (𝜓 → (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, 𝐻, if(𝑎 = 𝐸, 𝐻, 𝐼)))) = 0 )
41	40	oveq1d 7411	. . . . . . 7 ⊢ (𝜓 → ((𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, 𝐻, if(𝑎 = 𝐸, 𝐻, 𝐼)))) + (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, 𝐺, if(𝑎 = 𝐸, 𝐻, 𝐼))))) = ( 0 + (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, 𝐺, if(𝑎 = 𝐸, 𝐻, 𝐼))))))
42	37	neneqd 2962	. . . . . . . . . . . . . 14 ⊢ (𝜓 → ¬ 𝐸 = 𝐹)
43		eqtr2 2783	. . . . . . . . . . . . . 14 ⊢ ((𝑎 = 𝐸 ∧ 𝑎 = 𝐹) → 𝐸 = 𝐹)
44	42, 43	nsyl 140	. . . . . . . . . . . . 13 ⊢ (𝜓 → ¬ (𝑎 = 𝐸 ∧ 𝑎 = 𝐹))
45	44	3ad2ant1 1146	. . . . . . . . . . . 12 ⊢ ((𝜓 ∧ 𝑎 ∈ 𝑁 ∧ 𝑏 ∈ 𝑁) → ¬ (𝑎 = 𝐸 ∧ 𝑎 = 𝐹))
46		ifcomnan 4537	. . . . . . . . . . . 12 ⊢ (¬ (𝑎 = 𝐸 ∧ 𝑎 = 𝐹) → if(𝑎 = 𝐸, 𝐻, if(𝑎 = 𝐹, 𝐺, 𝐼)) = if(𝑎 = 𝐹, 𝐺, if(𝑎 = 𝐸, 𝐻, 𝐼)))
47	45, 46	syl 17	. . . . . . . . . . 11 ⊢ ((𝜓 ∧ 𝑎 ∈ 𝑁 ∧ 𝑏 ∈ 𝑁) → if(𝑎 = 𝐸, 𝐻, if(𝑎 = 𝐹, 𝐺, 𝐼)) = if(𝑎 = 𝐹, 𝐺, if(𝑎 = 𝐸, 𝐻, 𝐼)))
48	47	mpoeq3dva 7473	. . . . . . . . . 10 ⊢ (𝜓 → (𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐻, if(𝑎 = 𝐹, 𝐺, 𝐼))) = (𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, 𝐺, if(𝑎 = 𝐸, 𝐻, 𝐼))))
49	48	fveq2d 6871	. . . . . . . . 9 ⊢ (𝜓 → (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐻, if(𝑎 = 𝐹, 𝐺, 𝐼)))) = (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, 𝐺, if(𝑎 = 𝐸, 𝐻, 𝐼)))))
50	14, 10	syl 17	. . . . . . . . . 10 ⊢ (𝜓 → 𝐷:𝐵⟶𝐾)
51	14, 8	syl 17	. . . . . . . . . . 11 ⊢ (𝜓 → 𝑁 ∈ Fin)
52	21, 28	ifcld 4527	. . . . . . . . . . . 12 ⊢ ((𝜓 ∧ 𝑎 ∈ 𝑁 ∧ 𝑏 ∈ 𝑁) → if(𝑎 = 𝐹, 𝐺, 𝐼) ∈ 𝐾)
53	19, 52	ifcld 4527	. . . . . . . . . . 11 ⊢ ((𝜓 ∧ 𝑎 ∈ 𝑁 ∧ 𝑏 ∈ 𝑁) → if(𝑎 = 𝐸, 𝐻, if(𝑎 = 𝐹, 𝐺, 𝐼)) ∈ 𝐾)
54	1, 3, 2, 51, 23, 53	matbas2d 22483	. . . . . . . . . 10 ⊢ (𝜓 → (𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐻, if(𝑎 = 𝐹, 𝐺, 𝐼))) ∈ 𝐵)
55	50, 54	ffvelcdmd 7066	. . . . . . . . 9 ⊢ (𝜓 → (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐻, if(𝑎 = 𝐹, 𝐺, 𝐼)))) ∈ 𝐾)
56	49, 55	eqeltrrd 2863	. . . . . . . 8 ⊢ (𝜓 → (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, 𝐺, if(𝑎 = 𝐸, 𝐻, 𝐼)))) ∈ 𝐾)
57	3, 6, 4	grplid 19009	. . . . . . . 8 ⊢ ((𝑅 ∈ Grp ∧ (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, 𝐺, if(𝑎 = 𝐸, 𝐻, 𝐼)))) ∈ 𝐾) → ( 0 + (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, 𝐺, if(𝑎 = 𝐸, 𝐻, 𝐼))))) = (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, 𝐺, if(𝑎 = 𝐸, 𝐻, 𝐼)))))
58	23, 56, 57	syl2anc 593	. . . . . . 7 ⊢ (𝜓 → ( 0 + (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, 𝐺, if(𝑎 = 𝐸, 𝐻, 𝐼))))) = (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, 𝐺, if(𝑎 = 𝐸, 𝐻, 𝐼)))))
59	36, 41, 58	3eqtrd 2801	. . . . . 6 ⊢ (𝜓 → (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, (𝐻 + 𝐺), if(𝑎 = 𝐸, 𝐻, 𝐼)))) = (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, 𝐺, if(𝑎 = 𝐸, 𝐻, 𝐼)))))
60		ifcomnan 4537	. . . . . . . . 9 ⊢ (¬ (𝑎 = 𝐸 ∧ 𝑎 = 𝐹) → if(𝑎 = 𝐸, 𝐻, if(𝑎 = 𝐹, (𝐻 + 𝐺), 𝐼)) = if(𝑎 = 𝐹, (𝐻 + 𝐺), if(𝑎 = 𝐸, 𝐻, 𝐼)))
61	45, 60	syl 17	. . . . . . . 8 ⊢ ((𝜓 ∧ 𝑎 ∈ 𝑁 ∧ 𝑏 ∈ 𝑁) → if(𝑎 = 𝐸, 𝐻, if(𝑎 = 𝐹, (𝐻 + 𝐺), 𝐼)) = if(𝑎 = 𝐹, (𝐻 + 𝐺), if(𝑎 = 𝐸, 𝐻, 𝐼)))
62	61	mpoeq3dva 7473	. . . . . . 7 ⊢ (𝜓 → (𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐻, if(𝑎 = 𝐹, (𝐻 + 𝐺), 𝐼))) = (𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, (𝐻 + 𝐺), if(𝑎 = 𝐸, 𝐻, 𝐼))))
63	62	fveq2d 6871	. . . . . 6 ⊢ (𝜓 → (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐻, if(𝑎 = 𝐹, (𝐻 + 𝐺), 𝐼)))) = (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, (𝐻 + 𝐺), if(𝑎 = 𝐸, 𝐻, 𝐼)))))
64	59, 63, 49	3eqtr4d 2807	. . . . 5 ⊢ (𝜓 → (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐻, if(𝑎 = 𝐹, (𝐻 + 𝐺), 𝐼)))) = (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐻, if(𝑎 = 𝐹, 𝐺, 𝐼)))))
65	21, 28	ifcld 4527	. . . . . . . . 9 ⊢ ((𝜓 ∧ 𝑎 ∈ 𝑁 ∧ 𝑏 ∈ 𝑁) → if(𝑎 = 𝐸, 𝐺, 𝐼) ∈ 𝐾)
66	19, 21, 65	3jca 1141	. . . . . . . 8 ⊢ ((𝜓 ∧ 𝑎 ∈ 𝑁 ∧ 𝑏 ∈ 𝑁) → (𝐻 ∈ 𝐾 ∧ 𝐺 ∈ 𝐾 ∧ if(𝑎 = 𝐸, 𝐺, 𝐼) ∈ 𝐾))
67	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 33, 66	mdetunilem5 22676	. . . . . . 7 ⊢ (𝜓 → (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, (𝐻 + 𝐺), if(𝑎 = 𝐸, 𝐺, 𝐼)))) = ((𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, 𝐻, if(𝑎 = 𝐸, 𝐺, 𝐼)))) + (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, 𝐺, if(𝑎 = 𝐸, 𝐺, 𝐼))))))
68	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 39, 20, 28	mdetunilem2 22673	. . . . . . . 8 ⊢ (𝜓 → (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, 𝐺, if(𝑎 = 𝐸, 𝐺, 𝐼)))) = 0 )
69	68	oveq2d 7412	. . . . . . 7 ⊢ (𝜓 → ((𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, 𝐻, if(𝑎 = 𝐸, 𝐺, 𝐼)))) + (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, 𝐺, if(𝑎 = 𝐸, 𝐺, 𝐼))))) = ((𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, 𝐻, if(𝑎 = 𝐸, 𝐺, 𝐼)))) + 0 ))
70		ifcomnan 4537	. . . . . . . . . . . 12 ⊢ (¬ (𝑎 = 𝐸 ∧ 𝑎 = 𝐹) → if(𝑎 = 𝐸, 𝐺, if(𝑎 = 𝐹, 𝐻, 𝐼)) = if(𝑎 = 𝐹, 𝐻, if(𝑎 = 𝐸, 𝐺, 𝐼)))
71	45, 70	syl 17	. . . . . . . . . . 11 ⊢ ((𝜓 ∧ 𝑎 ∈ 𝑁 ∧ 𝑏 ∈ 𝑁) → if(𝑎 = 𝐸, 𝐺, if(𝑎 = 𝐹, 𝐻, 𝐼)) = if(𝑎 = 𝐹, 𝐻, if(𝑎 = 𝐸, 𝐺, 𝐼)))
72	71	mpoeq3dva 7473	. . . . . . . . . 10 ⊢ (𝜓 → (𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐺, if(𝑎 = 𝐹, 𝐻, 𝐼))) = (𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, 𝐻, if(𝑎 = 𝐸, 𝐺, 𝐼))))
73	72	fveq2d 6871	. . . . . . . . 9 ⊢ (𝜓 → (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐺, if(𝑎 = 𝐹, 𝐻, 𝐼)))) = (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, 𝐻, if(𝑎 = 𝐸, 𝐺, 𝐼)))))
74	19, 28	ifcld 4527	. . . . . . . . . . . 12 ⊢ ((𝜓 ∧ 𝑎 ∈ 𝑁 ∧ 𝑏 ∈ 𝑁) → if(𝑎 = 𝐹, 𝐻, 𝐼) ∈ 𝐾)
75	21, 74	ifcld 4527	. . . . . . . . . . 11 ⊢ ((𝜓 ∧ 𝑎 ∈ 𝑁 ∧ 𝑏 ∈ 𝑁) → if(𝑎 = 𝐸, 𝐺, if(𝑎 = 𝐹, 𝐻, 𝐼)) ∈ 𝐾)
76	1, 3, 2, 51, 23, 75	matbas2d 22483	. . . . . . . . . 10 ⊢ (𝜓 → (𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐺, if(𝑎 = 𝐹, 𝐻, 𝐼))) ∈ 𝐵)
77	50, 76	ffvelcdmd 7066	. . . . . . . . 9 ⊢ (𝜓 → (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐺, if(𝑎 = 𝐹, 𝐻, 𝐼)))) ∈ 𝐾)
78	73, 77	eqeltrrd 2863	. . . . . . . 8 ⊢ (𝜓 → (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, 𝐻, if(𝑎 = 𝐸, 𝐺, 𝐼)))) ∈ 𝐾)
79	3, 6, 4	grprid 19010	. . . . . . . 8 ⊢ ((𝑅 ∈ Grp ∧ (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, 𝐻, if(𝑎 = 𝐸, 𝐺, 𝐼)))) ∈ 𝐾) → ((𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, 𝐻, if(𝑎 = 𝐸, 𝐺, 𝐼)))) + 0 ) = (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, 𝐻, if(𝑎 = 𝐸, 𝐺, 𝐼)))))
80	23, 78, 79	syl2anc 593	. . . . . . 7 ⊢ (𝜓 → ((𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, 𝐻, if(𝑎 = 𝐸, 𝐺, 𝐼)))) + 0 ) = (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, 𝐻, if(𝑎 = 𝐸, 𝐺, 𝐼)))))
81	67, 69, 80	3eqtrd 2801	. . . . . 6 ⊢ (𝜓 → (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, (𝐻 + 𝐺), if(𝑎 = 𝐸, 𝐺, 𝐼)))) = (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, 𝐻, if(𝑎 = 𝐸, 𝐺, 𝐼)))))
82		ifcomnan 4537	. . . . . . . . 9 ⊢ (¬ (𝑎 = 𝐸 ∧ 𝑎 = 𝐹) → if(𝑎 = 𝐸, 𝐺, if(𝑎 = 𝐹, (𝐻 + 𝐺), 𝐼)) = if(𝑎 = 𝐹, (𝐻 + 𝐺), if(𝑎 = 𝐸, 𝐺, 𝐼)))
83	45, 82	syl 17	. . . . . . . 8 ⊢ ((𝜓 ∧ 𝑎 ∈ 𝑁 ∧ 𝑏 ∈ 𝑁) → if(𝑎 = 𝐸, 𝐺, if(𝑎 = 𝐹, (𝐻 + 𝐺), 𝐼)) = if(𝑎 = 𝐹, (𝐻 + 𝐺), if(𝑎 = 𝐸, 𝐺, 𝐼)))
84	83	mpoeq3dva 7473	. . . . . . 7 ⊢ (𝜓 → (𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐺, if(𝑎 = 𝐹, (𝐻 + 𝐺), 𝐼))) = (𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, (𝐻 + 𝐺), if(𝑎 = 𝐸, 𝐺, 𝐼))))
85	84	fveq2d 6871	. . . . . 6 ⊢ (𝜓 → (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐺, if(𝑎 = 𝐹, (𝐻 + 𝐺), 𝐼)))) = (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐹, (𝐻 + 𝐺), if(𝑎 = 𝐸, 𝐺, 𝐼)))))
86	81, 85, 73	3eqtr4d 2807	. . . . 5 ⊢ (𝜓 → (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐺, if(𝑎 = 𝐹, (𝐻 + 𝐺), 𝐼)))) = (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐺, if(𝑎 = 𝐹, 𝐻, 𝐼)))))
87	64, 86	oveq12d 7414	. . . 4 ⊢ (𝜓 → ((𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐻, if(𝑎 = 𝐹, (𝐻 + 𝐺), 𝐼)))) + (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐺, if(𝑎 = 𝐹, (𝐻 + 𝐺), 𝐼))))) = ((𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐻, if(𝑎 = 𝐹, 𝐺, 𝐼)))) + (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐺, if(𝑎 = 𝐹, 𝐻, 𝐼))))))
88	31, 32, 87	3eqtr3rd 2806	. . 3 ⊢ (𝜓 → ((𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐻, if(𝑎 = 𝐹, 𝐺, 𝐼)))) + (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐺, if(𝑎 = 𝐹, 𝐻, 𝐼))))) = 0 )
89		eqid 2762	. . . . 5 ⊢ (inv_g‘𝑅) = (inv_g‘𝑅)
90	3, 6, 4, 89	grpinvid1 19033	. . . 4 ⊢ ((𝑅 ∈ Grp ∧ (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐻, if(𝑎 = 𝐹, 𝐺, 𝐼)))) ∈ 𝐾 ∧ (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐺, if(𝑎 = 𝐹, 𝐻, 𝐼)))) ∈ 𝐾) → (((inv_g‘𝑅)‘(𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐻, if(𝑎 = 𝐹, 𝐺, 𝐼))))) = (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐺, if(𝑎 = 𝐹, 𝐻, 𝐼)))) ↔ ((𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐻, if(𝑎 = 𝐹, 𝐺, 𝐼)))) + (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐺, if(𝑎 = 𝐹, 𝐻, 𝐼))))) = 0 ))
91	23, 55, 77, 90	syl3anc 1390	. . 3 ⊢ (𝜓 → (((inv_g‘𝑅)‘(𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐻, if(𝑎 = 𝐹, 𝐺, 𝐼))))) = (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐺, if(𝑎 = 𝐹, 𝐻, 𝐼)))) ↔ ((𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐻, if(𝑎 = 𝐹, 𝐺, 𝐼)))) + (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐺, if(𝑎 = 𝐹, 𝐻, 𝐼))))) = 0 ))
92	88, 91	mpbird 259	. 2 ⊢ (𝜓 → ((inv_g‘𝑅)‘(𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐻, if(𝑎 = 𝐹, 𝐺, 𝐼))))) = (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐺, if(𝑎 = 𝐹, 𝐻, 𝐼)))))
93	92	eqcomd 2768	1 ⊢ (𝜓 → (𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐺, if(𝑎 = 𝐹, 𝐻, 𝐼)))) = ((inv_g‘𝑅)‘(𝐷‘(𝑎 ∈ 𝑁, 𝑏 ∈ 𝑁 ↦ if(𝑎 = 𝐸, 𝐻, if(𝑎 = 𝐹, 𝐺, 𝐼))))))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 399 ∧ w3a 1098 = wceq 1560 ∈ wcel 2142 ≠ wne 2957 ∀wral 3076 ∖ cdif 3901 ifcif 4480 {csn 4582 × cxp 5645 ↾ cres 5649 ⟶wf 6517 ‘cfv 6521 (class class class)co 7396 ∈ cmpo 7398 ∘_f cof 7658 Fincfn 8927 Basecbs 17245 +_gcplusg 17286 ._rcmulr 17287 0_gc0g 17468 Grpcgrp 18975 inv_gcminusg 18976 1_rcur 20231 Ringcrg 20283 Mat cmat 22467

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5227 ax-sep 5246 ax-nul 5256 ax-pow 5322 ax-pr 5390 ax-un 7718 ax-cnex 11129 ax-resscn 11130 ax-1cn 11131 ax-icn 11132 ax-addcl 11133 ax-addrcl 11134 ax-mulcl 11135 ax-mulrcl 11136 ax-mulcom 11137 ax-addass 11138 ax-mulass 11139 ax-distr 11140 ax-i2m1 11141 ax-1ne0 11142 ax-1rid 11143 ax-rnegex 11144 ax-rrecex 11145 ax-cnre 11146 ax-pre-lttri 11147 ax-pre-lttrn 11148 ax-pre-ltadd 11149 ax-pre-mulgt0 11150

This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1099 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3456 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-tp 4587 df-op 4589 df-ot 4591 df-uni 4866 df-iun 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6288 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-riota 7353 df-ov 7399 df-oprab 7400 df-mpo 7401 df-of 7660 df-om 7847 df-1st 7970 df-2nd 7971 df-supp 8141 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8381 df-1o 8437 df-er 8678 df-map 8810 df-ixp 8880 df-en 8928 df-dom 8929 df-sdom 8930 df-fin 8931 df-fsupp 9308 df-sup 9388 df-pnf 11218 df-mnf 11219 df-xr 11220 df-ltxr 11221 df-le 11222 df-sub 11416 df-neg 11417 df-nn 12211 df-2 12280 df-3 12281 df-4 12282 df-5 12283 df-6 12284 df-7 12285 df-8 12286 df-9 12287 df-n0 12482 df-z 12569 df-dec 12689 df-uz 12840 df-fz 13513 df-struct 17183 df-sets 17200 df-slot 17218 df-ndx 17230 df-base 17246 df-ress 17267 df-plusg 17299 df-mulr 17300 df-sca 17302 df-vsca 17303 df-ip 17304 df-tset 17305 df-ple 17306 df-ds 17308 df-hom 17310 df-cco 17311 df-0g 17470 df-prds 17476 df-pws 17478 df-mgm 18674 df-sgrp 18753 df-mnd 18769 df-grp 18978 df-minusg 18979 df-ring 20285 df-sra 21240 df-rgmod 21241 df-dsmm 21784 df-frlm 21799 df-mat 22468

This theorem is referenced by: mdetunilem7 22678

W3C validator