maducoeval2 - Metamath Proof Explorer

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

Theorem maducoeval2 21989

Description: An entry of the adjunct (cofactor) matrix. (Contributed by SO, 17-Jul-2018.)

**Hypotheses**
Ref	Expression
madufval.a	⊢ 𝐴 = (𝑁 Mat 𝑅)
madufval.d	⊢ 𝐷 = (𝑁 maDet 𝑅)
madufval.j	⊢ 𝐽 = (𝑁 maAdju 𝑅)
madufval.b	⊢ 𝐵 = (Base‘𝐴)
madufval.o	⊢ 1 = (1_r‘𝑅)
madufval.z	⊢ 0 = (0_g‘𝑅)

**Assertion**
Ref	Expression
maducoeval2	⊢ (((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝐼(𝐽‘𝑀)𝐻) = (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if((𝑘 = 𝐻 ∨ 𝑙 = 𝐼), if((𝑙 = 𝐼 ∧ 𝑘 = 𝐻), 1 , 0 ), (𝑘𝑀𝑙)))))

Distinct variable groups: 𝑘,𝑁,𝑙 𝑅,𝑘,𝑙 𝑘,𝑀,𝑙 𝑘,𝐼,𝑙 𝑘,𝐻,𝑙 𝐵,𝑘,𝑙 0 ,𝑘 1 ,𝑘 Allowed substitution hints: 𝐴(𝑘,𝑙) 𝐷(𝑘,𝑙) 1 (𝑙) 𝐽(𝑘,𝑙) 0 (𝑙)

Proof of Theorem maducoeval2 Dummy variables 𝑛 𝑟 𝑚 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eleq2 2826	. . . . . . . 8 ⊢ (𝑚 = ∅ → (𝑘 ∈ 𝑚 ↔ 𝑘 ∈ ∅))
2	1	ifbid 4509	. . . . . . 7 ⊢ (𝑚 = ∅ → if(𝑘 ∈ 𝑚, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)) = if(𝑘 ∈ ∅, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))
3	2	ifeq2d 4506	. . . . . 6 ⊢ (𝑚 = ∅ → if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑚, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))) = if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ ∅, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))
4	3	mpoeq3dv 7436	. . . . 5 ⊢ (𝑚 = ∅ → (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑚, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))) = (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ ∅, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))))
5	4	fveq2d 6846	. . . 4 ⊢ (𝑚 = ∅ → (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑚, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))) = (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ ∅, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))))
6	5	eqeq2d 2747	. . 3 ⊢ (𝑚 = ∅ → ((𝐼(𝐽‘𝑀)𝐻) = (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑚, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))) ↔ (𝐼(𝐽‘𝑀)𝐻) = (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ ∅, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))))))
7		eleq2 2826	. . . . . . . 8 ⊢ (𝑚 = 𝑛 → (𝑘 ∈ 𝑚 ↔ 𝑘 ∈ 𝑛))
8	7	ifbid 4509	. . . . . . 7 ⊢ (𝑚 = 𝑛 → if(𝑘 ∈ 𝑚, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)) = if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))
9	8	ifeq2d 4506	. . . . . 6 ⊢ (𝑚 = 𝑛 → if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑚, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))) = if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))
10	9	mpoeq3dv 7436	. . . . 5 ⊢ (𝑚 = 𝑛 → (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑚, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))) = (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))))
11	10	fveq2d 6846	. . . 4 ⊢ (𝑚 = 𝑛 → (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑚, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))) = (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))))
12	11	eqeq2d 2747	. . 3 ⊢ (𝑚 = 𝑛 → ((𝐼(𝐽‘𝑀)𝐻) = (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑚, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))) ↔ (𝐼(𝐽‘𝑀)𝐻) = (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))))))
13		eleq2 2826	. . . . . . . 8 ⊢ (𝑚 = (𝑛 ∪ {𝑟}) → (𝑘 ∈ 𝑚 ↔ 𝑘 ∈ (𝑛 ∪ {𝑟})))
14	13	ifbid 4509	. . . . . . 7 ⊢ (𝑚 = (𝑛 ∪ {𝑟}) → if(𝑘 ∈ 𝑚, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)) = if(𝑘 ∈ (𝑛 ∪ {𝑟}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))
15	14	ifeq2d 4506	. . . . . 6 ⊢ (𝑚 = (𝑛 ∪ {𝑟}) → if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑚, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))) = if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ (𝑛 ∪ {𝑟}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))
16	15	mpoeq3dv 7436	. . . . 5 ⊢ (𝑚 = (𝑛 ∪ {𝑟}) → (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑚, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))) = (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ (𝑛 ∪ {𝑟}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))))
17	16	fveq2d 6846	. . . 4 ⊢ (𝑚 = (𝑛 ∪ {𝑟}) → (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑚, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))) = (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ (𝑛 ∪ {𝑟}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))))
18	17	eqeq2d 2747	. . 3 ⊢ (𝑚 = (𝑛 ∪ {𝑟}) → ((𝐼(𝐽‘𝑀)𝐻) = (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑚, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))) ↔ (𝐼(𝐽‘𝑀)𝐻) = (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ (𝑛 ∪ {𝑟}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))))))
19		eleq2 2826	. . . . . . . 8 ⊢ (𝑚 = (𝑁 ∖ {𝐻}) → (𝑘 ∈ 𝑚 ↔ 𝑘 ∈ (𝑁 ∖ {𝐻})))
20	19	ifbid 4509	. . . . . . 7 ⊢ (𝑚 = (𝑁 ∖ {𝐻}) → if(𝑘 ∈ 𝑚, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)) = if(𝑘 ∈ (𝑁 ∖ {𝐻}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))
21	20	ifeq2d 4506	. . . . . 6 ⊢ (𝑚 = (𝑁 ∖ {𝐻}) → if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑚, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))) = if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ (𝑁 ∖ {𝐻}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))
22	21	mpoeq3dv 7436	. . . . 5 ⊢ (𝑚 = (𝑁 ∖ {𝐻}) → (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑚, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))) = (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ (𝑁 ∖ {𝐻}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))))
23	22	fveq2d 6846	. . . 4 ⊢ (𝑚 = (𝑁 ∖ {𝐻}) → (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑚, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))) = (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ (𝑁 ∖ {𝐻}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))))
24	23	eqeq2d 2747	. . 3 ⊢ (𝑚 = (𝑁 ∖ {𝐻}) → ((𝐼(𝐽‘𝑀)𝐻) = (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑚, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))) ↔ (𝐼(𝐽‘𝑀)𝐻) = (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ (𝑁 ∖ {𝐻}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))))))
25		madufval.a	. . . . . 6 ⊢ 𝐴 = (𝑁 Mat 𝑅)
26		madufval.d	. . . . . 6 ⊢ 𝐷 = (𝑁 maDet 𝑅)
27		madufval.j	. . . . . 6 ⊢ 𝐽 = (𝑁 maAdju 𝑅)
28		madufval.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐴)
29		madufval.o	. . . . . 6 ⊢ 1 = (1_r‘𝑅)
30		madufval.z	. . . . . 6 ⊢ 0 = (0_g‘𝑅)
31	25, 26, 27, 28, 29, 30	maducoeval 21988	. . . . 5 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝐼(𝐽‘𝑀)𝐻) = (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), (𝑘𝑀𝑙)))))
32	31	3adant1l 1176	. . . 4 ⊢ (((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝐼(𝐽‘𝑀)𝐻) = (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), (𝑘𝑀𝑙)))))
33		noel 4290	. . . . . . . 8 ⊢ ¬ 𝑘 ∈ ∅
34		iffalse 4495	. . . . . . . 8 ⊢ (¬ 𝑘 ∈ ∅ → if(𝑘 ∈ ∅, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)) = (𝑘𝑀𝑙))
35	33, 34	mp1i 13	. . . . . . 7 ⊢ ((𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) → if(𝑘 ∈ ∅, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)) = (𝑘𝑀𝑙))
36	35	ifeq2d 4506	. . . . . 6 ⊢ ((𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) → if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ ∅, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))) = if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), (𝑘𝑀𝑙)))
37	36	mpoeq3ia 7435	. . . . 5 ⊢ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ ∅, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))) = (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), (𝑘𝑀𝑙)))
38	37	fveq2i 6845	. . . 4 ⊢ (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ ∅, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))) = (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), (𝑘𝑀𝑙))))
39	32, 38	eqtr4di 2794	. . 3 ⊢ (((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝐼(𝐽‘𝑀)𝐻) = (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ ∅, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))))
40		eqid 2736	. . . . . . 7 ⊢ (Base‘𝑅) = (Base‘𝑅)
41		eqid 2736	. . . . . . 7 ⊢ (+_g‘𝑅) = (+_g‘𝑅)
42		eqid 2736	. . . . . . 7 ⊢ (._r‘𝑅) = (._r‘𝑅)
43		simpl1l 1224	. . . . . . 7 ⊢ ((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) → 𝑅 ∈ CRing)
44		simp1r 1198	. . . . . . . . 9 ⊢ (((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → 𝑀 ∈ 𝐵)
45	25, 28	matrcl 21759	. . . . . . . . . 10 ⊢ (𝑀 ∈ 𝐵 → (𝑁 ∈ Fin ∧ 𝑅 ∈ V))
46	45	simpld 495	. . . . . . . . 9 ⊢ (𝑀 ∈ 𝐵 → 𝑁 ∈ Fin)
47	44, 46	syl 17	. . . . . . . 8 ⊢ (((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → 𝑁 ∈ Fin)
48	47	adantr 481	. . . . . . 7 ⊢ ((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) → 𝑁 ∈ Fin)
49		simp1l 1197	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → 𝑅 ∈ CRing)
50	49	ad2antrr 724	. . . . . . . . . 10 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑙 ∈ 𝑁) → 𝑅 ∈ CRing)
51		crngring 19976	. . . . . . . . . 10 ⊢ (𝑅 ∈ CRing → 𝑅 ∈ Ring)
52	50, 51	syl 17	. . . . . . . . 9 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑙 ∈ 𝑁) → 𝑅 ∈ Ring)
53	40, 30	ring0cl 19990	. . . . . . . . 9 ⊢ (𝑅 ∈ Ring → 0 ∈ (Base‘𝑅))
54	52, 53	syl 17	. . . . . . . 8 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑙 ∈ 𝑁) → 0 ∈ (Base‘𝑅))
55		simpl1r 1225	. . . . . . . . . . 11 ⊢ ((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) → 𝑀 ∈ 𝐵)
56	25, 40, 28	matbas2i 21771	. . . . . . . . . . 11 ⊢ (𝑀 ∈ 𝐵 → 𝑀 ∈ ((Base‘𝑅) ↑_m (𝑁 × 𝑁)))
57		elmapi 8787	. . . . . . . . . . 11 ⊢ (𝑀 ∈ ((Base‘𝑅) ↑_m (𝑁 × 𝑁)) → 𝑀:(𝑁 × 𝑁)⟶(Base‘𝑅))
58	55, 56, 57	3syl 18	. . . . . . . . . 10 ⊢ ((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) → 𝑀:(𝑁 × 𝑁)⟶(Base‘𝑅))
59	58	adantr 481	. . . . . . . . 9 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑙 ∈ 𝑁) → 𝑀:(𝑁 × 𝑁)⟶(Base‘𝑅))
60		eldifi 4086	. . . . . . . . . . . 12 ⊢ (𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛) → 𝑟 ∈ (𝑁 ∖ {𝐻}))
61	60	ad2antll 727	. . . . . . . . . . 11 ⊢ ((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) → 𝑟 ∈ (𝑁 ∖ {𝐻}))
62	61	eldifad 3922	. . . . . . . . . 10 ⊢ ((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) → 𝑟 ∈ 𝑁)
63	62	adantr 481	. . . . . . . . 9 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑙 ∈ 𝑁) → 𝑟 ∈ 𝑁)
64		simpr 485	. . . . . . . . 9 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑙 ∈ 𝑁) → 𝑙 ∈ 𝑁)
65	59, 63, 64	fovcdmd 7526	. . . . . . . 8 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑙 ∈ 𝑁) → (𝑟𝑀𝑙) ∈ (Base‘𝑅))
66	54, 65	ifcld 4532	. . . . . . 7 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑙 ∈ 𝑁) → if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙)) ∈ (Base‘𝑅))
67	40, 29	ringidcl 19989	. . . . . . . . 9 ⊢ (𝑅 ∈ Ring → 1 ∈ (Base‘𝑅))
68	52, 67	syl 17	. . . . . . . 8 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑙 ∈ 𝑁) → 1 ∈ (Base‘𝑅))
69	68, 54	ifcld 4532	. . . . . . 7 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑙 ∈ 𝑁) → if(𝑙 = 𝐼, 1 , 0 ) ∈ (Base‘𝑅))
70	54	3adant2 1131	. . . . . . . . 9 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) → 0 ∈ (Base‘𝑅))
71	58	fovcdmda 7525	. . . . . . . . . 10 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ (𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁)) → (𝑘𝑀𝑙) ∈ (Base‘𝑅))
72	71	3impb 1115	. . . . . . . . 9 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) → (𝑘𝑀𝑙) ∈ (Base‘𝑅))
73	70, 72	ifcld 4532	. . . . . . . 8 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) → if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)) ∈ (Base‘𝑅))
74	73, 72	ifcld 4532	. . . . . . 7 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) → if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)) ∈ (Base‘𝑅))
75		simpl2 1192	. . . . . . . 8 ⊢ ((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) → 𝐼 ∈ 𝑁)
76	58, 62, 75	fovcdmd 7526	. . . . . . 7 ⊢ ((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) → (𝑟𝑀𝐼) ∈ (Base‘𝑅))
77		simpl3 1193	. . . . . . 7 ⊢ ((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) → 𝐻 ∈ 𝑁)
78		eldifsni 4750	. . . . . . . 8 ⊢ (𝑟 ∈ (𝑁 ∖ {𝐻}) → 𝑟 ≠ 𝐻)
79	61, 78	syl 17	. . . . . . 7 ⊢ ((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) → 𝑟 ≠ 𝐻)
80	26, 40, 41, 42, 43, 48, 66, 69, 74, 76, 62, 77, 79	mdetero 21959	. . . . . 6 ⊢ ((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) → (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑟, (if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙))(+_g‘𝑅)((𝑟𝑀𝐼)(._r‘𝑅)if(𝑙 = 𝐼, 1 , 0 ))), if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))))) = (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑟, if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙)), if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))))))
81		ifnot 4538	. . . . . . . . . . . . . . . . 17 ⊢ if(¬ 𝑙 = 𝐼, (𝑟𝑀𝑙), 0 ) = if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙))
82	81	eqcomi 2745	. . . . . . . . . . . . . . . 16 ⊢ if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙)) = if(¬ 𝑙 = 𝐼, (𝑟𝑀𝑙), 0 )
83	82	a1i 11	. . . . . . . . . . . . . . 15 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑙 ∈ 𝑁) → if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙)) = if(¬ 𝑙 = 𝐼, (𝑟𝑀𝑙), 0 ))
84		ovif2 7455	. . . . . . . . . . . . . . . 16 ⊢ ((𝑟𝑀𝐼)(._r‘𝑅)if(𝑙 = 𝐼, 1 , 0 )) = if(𝑙 = 𝐼, ((𝑟𝑀𝐼)(._r‘𝑅) 1 ), ((𝑟𝑀𝐼)(._r‘𝑅) 0 ))
85	76	adantr 481	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑙 ∈ 𝑁) → (𝑟𝑀𝐼) ∈ (Base‘𝑅))
86	40, 42, 29	ringridm 19993	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑅 ∈ Ring ∧ (𝑟𝑀𝐼) ∈ (Base‘𝑅)) → ((𝑟𝑀𝐼)(._r‘𝑅) 1 ) = (𝑟𝑀𝐼))
87	52, 85, 86	syl2anc 584	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑙 ∈ 𝑁) → ((𝑟𝑀𝐼)(._r‘𝑅) 1 ) = (𝑟𝑀𝐼))
88	87	adantr 481	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑙 ∈ 𝑁) ∧ 𝑙 = 𝐼) → ((𝑟𝑀𝐼)(._r‘𝑅) 1 ) = (𝑟𝑀𝐼))
89		oveq2 7365	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑙 = 𝐼 → (𝑟𝑀𝑙) = (𝑟𝑀𝐼))
90	89	adantl 482	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑙 ∈ 𝑁) ∧ 𝑙 = 𝐼) → (𝑟𝑀𝑙) = (𝑟𝑀𝐼))
91	88, 90	eqtr4d 2779	. . . . . . . . . . . . . . . . . 18 ⊢ ((((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑙 ∈ 𝑁) ∧ 𝑙 = 𝐼) → ((𝑟𝑀𝐼)(._r‘𝑅) 1 ) = (𝑟𝑀𝑙))
92	91	ifeq1da 4517	. . . . . . . . . . . . . . . . 17 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑙 ∈ 𝑁) → if(𝑙 = 𝐼, ((𝑟𝑀𝐼)(._r‘𝑅) 1 ), ((𝑟𝑀𝐼)(._r‘𝑅) 0 )) = if(𝑙 = 𝐼, (𝑟𝑀𝑙), ((𝑟𝑀𝐼)(._r‘𝑅) 0 )))
93	40, 42, 30	ringrz 20012	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑅 ∈ Ring ∧ (𝑟𝑀𝐼) ∈ (Base‘𝑅)) → ((𝑟𝑀𝐼)(._r‘𝑅) 0 ) = 0 )
94	52, 85, 93	syl2anc 584	. . . . . . . . . . . . . . . . . 18 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑙 ∈ 𝑁) → ((𝑟𝑀𝐼)(._r‘𝑅) 0 ) = 0 )
95	94	ifeq2d 4506	. . . . . . . . . . . . . . . . 17 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑙 ∈ 𝑁) → if(𝑙 = 𝐼, (𝑟𝑀𝑙), ((𝑟𝑀𝐼)(._r‘𝑅) 0 )) = if(𝑙 = 𝐼, (𝑟𝑀𝑙), 0 ))
96	92, 95	eqtrd 2776	. . . . . . . . . . . . . . . 16 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑙 ∈ 𝑁) → if(𝑙 = 𝐼, ((𝑟𝑀𝐼)(._r‘𝑅) 1 ), ((𝑟𝑀𝐼)(._r‘𝑅) 0 )) = if(𝑙 = 𝐼, (𝑟𝑀𝑙), 0 ))
97	84, 96	eqtrid 2788	. . . . . . . . . . . . . . 15 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑙 ∈ 𝑁) → ((𝑟𝑀𝐼)(._r‘𝑅)if(𝑙 = 𝐼, 1 , 0 )) = if(𝑙 = 𝐼, (𝑟𝑀𝑙), 0 ))
98	83, 97	oveq12d 7375	. . . . . . . . . . . . . 14 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑙 ∈ 𝑁) → (if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙))(+_g‘𝑅)((𝑟𝑀𝐼)(._r‘𝑅)if(𝑙 = 𝐼, 1 , 0 ))) = (if(¬ 𝑙 = 𝐼, (𝑟𝑀𝑙), 0 )(+_g‘𝑅)if(𝑙 = 𝐼, (𝑟𝑀𝑙), 0 )))
99		ringmnd 19974	. . . . . . . . . . . . . . . 16 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Mnd)
100	52, 99	syl 17	. . . . . . . . . . . . . . 15 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑙 ∈ 𝑁) → 𝑅 ∈ Mnd)
101		id 22	. . . . . . . . . . . . . . . . 17 ⊢ (¬ 𝑙 = 𝐼 → ¬ 𝑙 = 𝐼)
102		imnan 400	. . . . . . . . . . . . . . . . 17 ⊢ ((¬ 𝑙 = 𝐼 → ¬ 𝑙 = 𝐼) ↔ ¬ (¬ 𝑙 = 𝐼 ∧ 𝑙 = 𝐼))
103	101, 102	mpbi 229	. . . . . . . . . . . . . . . 16 ⊢ ¬ (¬ 𝑙 = 𝐼 ∧ 𝑙 = 𝐼)
104	103	a1i 11	. . . . . . . . . . . . . . 15 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑙 ∈ 𝑁) → ¬ (¬ 𝑙 = 𝐼 ∧ 𝑙 = 𝐼))
105	40, 30, 41	mndifsplit 21985	. . . . . . . . . . . . . . 15 ⊢ ((𝑅 ∈ Mnd ∧ (𝑟𝑀𝑙) ∈ (Base‘𝑅) ∧ ¬ (¬ 𝑙 = 𝐼 ∧ 𝑙 = 𝐼)) → if((¬ 𝑙 = 𝐼 ∨ 𝑙 = 𝐼), (𝑟𝑀𝑙), 0 ) = (if(¬ 𝑙 = 𝐼, (𝑟𝑀𝑙), 0 )(+_g‘𝑅)if(𝑙 = 𝐼, (𝑟𝑀𝑙), 0 )))
106	100, 65, 104, 105	syl3anc 1371	. . . . . . . . . . . . . 14 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑙 ∈ 𝑁) → if((¬ 𝑙 = 𝐼 ∨ 𝑙 = 𝐼), (𝑟𝑀𝑙), 0 ) = (if(¬ 𝑙 = 𝐼, (𝑟𝑀𝑙), 0 )(+_g‘𝑅)if(𝑙 = 𝐼, (𝑟𝑀𝑙), 0 )))
107		pm2.1 895	. . . . . . . . . . . . . . 15 ⊢ (¬ 𝑙 = 𝐼 ∨ 𝑙 = 𝐼)
108		iftrue 4492	. . . . . . . . . . . . . . 15 ⊢ ((¬ 𝑙 = 𝐼 ∨ 𝑙 = 𝐼) → if((¬ 𝑙 = 𝐼 ∨ 𝑙 = 𝐼), (𝑟𝑀𝑙), 0 ) = (𝑟𝑀𝑙))
109	107, 108	mp1i 13	. . . . . . . . . . . . . 14 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑙 ∈ 𝑁) → if((¬ 𝑙 = 𝐼 ∨ 𝑙 = 𝐼), (𝑟𝑀𝑙), 0 ) = (𝑟𝑀𝑙))
110	98, 106, 109	3eqtr2d 2782	. . . . . . . . . . . . 13 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑙 ∈ 𝑁) → (if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙))(+_g‘𝑅)((𝑟𝑀𝐼)(._r‘𝑅)if(𝑙 = 𝐼, 1 , 0 ))) = (𝑟𝑀𝑙))
111	110	3adant2 1131	. . . . . . . . . . . 12 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) → (if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙))(+_g‘𝑅)((𝑟𝑀𝐼)(._r‘𝑅)if(𝑙 = 𝐼, 1 , 0 ))) = (𝑟𝑀𝑙))
112		oveq1 7364	. . . . . . . . . . . . 13 ⊢ (𝑘 = 𝑟 → (𝑘𝑀𝑙) = (𝑟𝑀𝑙))
113	112	eqeq2d 2747	. . . . . . . . . . . 12 ⊢ (𝑘 = 𝑟 → ((if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙))(+_g‘𝑅)((𝑟𝑀𝐼)(._r‘𝑅)if(𝑙 = 𝐼, 1 , 0 ))) = (𝑘𝑀𝑙) ↔ (if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙))(+_g‘𝑅)((𝑟𝑀𝐼)(._r‘𝑅)if(𝑙 = 𝐼, 1 , 0 ))) = (𝑟𝑀𝑙)))
114	111, 113	syl5ibrcom 246	. . . . . . . . . . 11 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) → (𝑘 = 𝑟 → (if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙))(+_g‘𝑅)((𝑟𝑀𝐼)(._r‘𝑅)if(𝑙 = 𝐼, 1 , 0 ))) = (𝑘𝑀𝑙)))
115	114	imp 407	. . . . . . . . . 10 ⊢ ((((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) ∧ 𝑘 = 𝑟) → (if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙))(+_g‘𝑅)((𝑟𝑀𝐼)(._r‘𝑅)if(𝑙 = 𝐼, 1 , 0 ))) = (𝑘𝑀𝑙))
116		iftrue 4492	. . . . . . . . . . 11 ⊢ (𝑘 = 𝑟 → if(𝑘 = 𝑟, (if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙))(+_g‘𝑅)((𝑟𝑀𝐼)(._r‘𝑅)if(𝑙 = 𝐼, 1 , 0 ))), if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))) = (if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙))(+_g‘𝑅)((𝑟𝑀𝐼)(._r‘𝑅)if(𝑙 = 𝐼, 1 , 0 ))))
117	116	adantl 482	. . . . . . . . . 10 ⊢ ((((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) ∧ 𝑘 = 𝑟) → if(𝑘 = 𝑟, (if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙))(+_g‘𝑅)((𝑟𝑀𝐼)(._r‘𝑅)if(𝑙 = 𝐼, 1 , 0 ))), if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))) = (if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙))(+_g‘𝑅)((𝑟𝑀𝐼)(._r‘𝑅)if(𝑙 = 𝐼, 1 , 0 ))))
118	79	neneqd 2948	. . . . . . . . . . . . . . 15 ⊢ ((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) → ¬ 𝑟 = 𝐻)
119	118	3ad2ant1 1133	. . . . . . . . . . . . . 14 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) → ¬ 𝑟 = 𝐻)
120		eqeq1 2740	. . . . . . . . . . . . . . 15 ⊢ (𝑘 = 𝑟 → (𝑘 = 𝐻 ↔ 𝑟 = 𝐻))
121	120	notbid 317	. . . . . . . . . . . . . 14 ⊢ (𝑘 = 𝑟 → (¬ 𝑘 = 𝐻 ↔ ¬ 𝑟 = 𝐻))
122	119, 121	syl5ibrcom 246	. . . . . . . . . . . . 13 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) → (𝑘 = 𝑟 → ¬ 𝑘 = 𝐻))
123	122	imp 407	. . . . . . . . . . . 12 ⊢ ((((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) ∧ 𝑘 = 𝑟) → ¬ 𝑘 = 𝐻)
124	123	iffalsed 4497	. . . . . . . . . . 11 ⊢ ((((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) ∧ 𝑘 = 𝑟) → if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))) = if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))
125		eldifn 4087	. . . . . . . . . . . . . . . 16 ⊢ (𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛) → ¬ 𝑟 ∈ 𝑛)
126	125	ad2antll 727	. . . . . . . . . . . . . . 15 ⊢ ((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) → ¬ 𝑟 ∈ 𝑛)
127	126	3ad2ant1 1133	. . . . . . . . . . . . . 14 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) → ¬ 𝑟 ∈ 𝑛)
128		eleq1w 2820	. . . . . . . . . . . . . . 15 ⊢ (𝑘 = 𝑟 → (𝑘 ∈ 𝑛 ↔ 𝑟 ∈ 𝑛))
129	128	notbid 317	. . . . . . . . . . . . . 14 ⊢ (𝑘 = 𝑟 → (¬ 𝑘 ∈ 𝑛 ↔ ¬ 𝑟 ∈ 𝑛))
130	127, 129	syl5ibrcom 246	. . . . . . . . . . . . 13 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) → (𝑘 = 𝑟 → ¬ 𝑘 ∈ 𝑛))
131	130	imp 407	. . . . . . . . . . . 12 ⊢ ((((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) ∧ 𝑘 = 𝑟) → ¬ 𝑘 ∈ 𝑛)
132	131	iffalsed 4497	. . . . . . . . . . 11 ⊢ ((((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) ∧ 𝑘 = 𝑟) → if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)) = (𝑘𝑀𝑙))
133	124, 132	eqtrd 2776	. . . . . . . . . 10 ⊢ ((((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) ∧ 𝑘 = 𝑟) → if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))) = (𝑘𝑀𝑙))
134	115, 117, 133	3eqtr4d 2786	. . . . . . . . 9 ⊢ ((((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) ∧ 𝑘 = 𝑟) → if(𝑘 = 𝑟, (if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙))(+_g‘𝑅)((𝑟𝑀𝐼)(._r‘𝑅)if(𝑙 = 𝐼, 1 , 0 ))), if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))) = if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))
135		iffalse 4495	. . . . . . . . . 10 ⊢ (¬ 𝑘 = 𝑟 → if(𝑘 = 𝑟, (if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙))(+_g‘𝑅)((𝑟𝑀𝐼)(._r‘𝑅)if(𝑙 = 𝐼, 1 , 0 ))), if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))) = if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))
136	135	adantl 482	. . . . . . . . 9 ⊢ ((((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) ∧ ¬ 𝑘 = 𝑟) → if(𝑘 = 𝑟, (if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙))(+_g‘𝑅)((𝑟𝑀𝐼)(._r‘𝑅)if(𝑙 = 𝐼, 1 , 0 ))), if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))) = if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))
137	134, 136	pm2.61dan 811	. . . . . . . 8 ⊢ (((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) ∧ 𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) → if(𝑘 = 𝑟, (if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙))(+_g‘𝑅)((𝑟𝑀𝐼)(._r‘𝑅)if(𝑙 = 𝐼, 1 , 0 ))), if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))) = if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))
138	137	mpoeq3dva 7434	. . . . . . 7 ⊢ ((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) → (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑟, (if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙))(+_g‘𝑅)((𝑟𝑀𝐼)(._r‘𝑅)if(𝑙 = 𝐼, 1 , 0 ))), if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))) = (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))))
139	138	fveq2d 6846	. . . . . 6 ⊢ ((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) → (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑟, (if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙))(+_g‘𝑅)((𝑟𝑀𝐼)(._r‘𝑅)if(𝑙 = 𝐼, 1 , 0 ))), if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))))) = (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))))
140		neeq2 3007	. . . . . . . . . . . . . . 15 ⊢ (𝑘 = 𝐻 → (𝑟 ≠ 𝑘 ↔ 𝑟 ≠ 𝐻))
141	140	biimparc 480	. . . . . . . . . . . . . 14 ⊢ ((𝑟 ≠ 𝐻 ∧ 𝑘 = 𝐻) → 𝑟 ≠ 𝑘)
142	141	necomd 2999	. . . . . . . . . . . . 13 ⊢ ((𝑟 ≠ 𝐻 ∧ 𝑘 = 𝐻) → 𝑘 ≠ 𝑟)
143	142	neneqd 2948	. . . . . . . . . . . 12 ⊢ ((𝑟 ≠ 𝐻 ∧ 𝑘 = 𝐻) → ¬ 𝑘 = 𝑟)
144	143	iffalsed 4497	. . . . . . . . . . 11 ⊢ ((𝑟 ≠ 𝐻 ∧ 𝑘 = 𝐻) → if(𝑘 = 𝑟, if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙)), if(𝑙 = 𝐼, 1 , 0 )) = if(𝑙 = 𝐼, 1 , 0 ))
145		iftrue 4492	. . . . . . . . . . . . 13 ⊢ (𝑘 = 𝐻 → if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))) = if(𝑙 = 𝐼, 1 , 0 ))
146	145	adantl 482	. . . . . . . . . . . 12 ⊢ ((𝑟 ≠ 𝐻 ∧ 𝑘 = 𝐻) → if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))) = if(𝑙 = 𝐼, 1 , 0 ))
147	146	ifeq2d 4506	. . . . . . . . . . 11 ⊢ ((𝑟 ≠ 𝐻 ∧ 𝑘 = 𝐻) → if(𝑘 = 𝑟, if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙)), if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))) = if(𝑘 = 𝑟, if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙)), if(𝑙 = 𝐼, 1 , 0 )))
148		iftrue 4492	. . . . . . . . . . . 12 ⊢ (𝑘 = 𝐻 → if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ (𝑛 ∪ {𝑟}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))) = if(𝑙 = 𝐼, 1 , 0 ))
149	148	adantl 482	. . . . . . . . . . 11 ⊢ ((𝑟 ≠ 𝐻 ∧ 𝑘 = 𝐻) → if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ (𝑛 ∪ {𝑟}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))) = if(𝑙 = 𝐼, 1 , 0 ))
150	144, 147, 149	3eqtr4d 2786	. . . . . . . . . 10 ⊢ ((𝑟 ≠ 𝐻 ∧ 𝑘 = 𝐻) → if(𝑘 = 𝑟, if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙)), if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))) = if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ (𝑛 ∪ {𝑟}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))
151	112	ifeq2d 4506	. . . . . . . . . . . . . 14 ⊢ (𝑘 = 𝑟 → if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)) = if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙)))
152		vsnid 4623	. . . . . . . . . . . . . . . . 17 ⊢ 𝑟 ∈ {𝑟}
153		elun2 4137	. . . . . . . . . . . . . . . . 17 ⊢ (𝑟 ∈ {𝑟} → 𝑟 ∈ (𝑛 ∪ {𝑟}))
154	152, 153	ax-mp 5	. . . . . . . . . . . . . . . 16 ⊢ 𝑟 ∈ (𝑛 ∪ {𝑟})
155		eleq1w 2820	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 = 𝑟 → (𝑘 ∈ (𝑛 ∪ {𝑟}) ↔ 𝑟 ∈ (𝑛 ∪ {𝑟})))
156	154, 155	mpbiri 257	. . . . . . . . . . . . . . 15 ⊢ (𝑘 = 𝑟 → 𝑘 ∈ (𝑛 ∪ {𝑟}))
157	156	iftrued 4494	. . . . . . . . . . . . . 14 ⊢ (𝑘 = 𝑟 → if(𝑘 ∈ (𝑛 ∪ {𝑟}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)) = if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)))
158		iftrue 4492	. . . . . . . . . . . . . 14 ⊢ (𝑘 = 𝑟 → if(𝑘 = 𝑟, if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙)), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))) = if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙)))
159	151, 157, 158	3eqtr4rd 2787	. . . . . . . . . . . . 13 ⊢ (𝑘 = 𝑟 → if(𝑘 = 𝑟, if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙)), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))) = if(𝑘 ∈ (𝑛 ∪ {𝑟}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))
160	159	adantl 482	. . . . . . . . . . . 12 ⊢ (((𝑟 ≠ 𝐻 ∧ ¬ 𝑘 = 𝐻) ∧ 𝑘 = 𝑟) → if(𝑘 = 𝑟, if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙)), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))) = if(𝑘 ∈ (𝑛 ∪ {𝑟}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))
161		iffalse 4495	. . . . . . . . . . . . . 14 ⊢ (¬ 𝑘 = 𝑟 → if(𝑘 = 𝑟, if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙)), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))) = if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))
162		orc 865	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ 𝑛 → (𝑘 ∈ 𝑛 ∨ 𝑘 = 𝑟))
163		orel2 889	. . . . . . . . . . . . . . . . 17 ⊢ (¬ 𝑘 = 𝑟 → ((𝑘 ∈ 𝑛 ∨ 𝑘 = 𝑟) → 𝑘 ∈ 𝑛))
164	162, 163	impbid2 225	. . . . . . . . . . . . . . . 16 ⊢ (¬ 𝑘 = 𝑟 → (𝑘 ∈ 𝑛 ↔ (𝑘 ∈ 𝑛 ∨ 𝑘 = 𝑟)))
165		elun 4108	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ (𝑛 ∪ {𝑟}) ↔ (𝑘 ∈ 𝑛 ∨ 𝑘 ∈ {𝑟}))
166		velsn 4602	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 ∈ {𝑟} ↔ 𝑘 = 𝑟)
167	166	orbi2i 911	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑘 ∈ 𝑛 ∨ 𝑘 ∈ {𝑟}) ↔ (𝑘 ∈ 𝑛 ∨ 𝑘 = 𝑟))
168	165, 167	bitr2i 275	. . . . . . . . . . . . . . . 16 ⊢ ((𝑘 ∈ 𝑛 ∨ 𝑘 = 𝑟) ↔ 𝑘 ∈ (𝑛 ∪ {𝑟}))
169	164, 168	bitrdi 286	. . . . . . . . . . . . . . 15 ⊢ (¬ 𝑘 = 𝑟 → (𝑘 ∈ 𝑛 ↔ 𝑘 ∈ (𝑛 ∪ {𝑟})))
170	169	ifbid 4509	. . . . . . . . . . . . . 14 ⊢ (¬ 𝑘 = 𝑟 → if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)) = if(𝑘 ∈ (𝑛 ∪ {𝑟}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))
171	161, 170	eqtrd 2776	. . . . . . . . . . . . 13 ⊢ (¬ 𝑘 = 𝑟 → if(𝑘 = 𝑟, if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙)), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))) = if(𝑘 ∈ (𝑛 ∪ {𝑟}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))
172	171	adantl 482	. . . . . . . . . . . 12 ⊢ (((𝑟 ≠ 𝐻 ∧ ¬ 𝑘 = 𝐻) ∧ ¬ 𝑘 = 𝑟) → if(𝑘 = 𝑟, if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙)), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))) = if(𝑘 ∈ (𝑛 ∪ {𝑟}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))
173	160, 172	pm2.61dan 811	. . . . . . . . . . 11 ⊢ ((𝑟 ≠ 𝐻 ∧ ¬ 𝑘 = 𝐻) → if(𝑘 = 𝑟, if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙)), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))) = if(𝑘 ∈ (𝑛 ∪ {𝑟}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))
174		iffalse 4495	. . . . . . . . . . . . 13 ⊢ (¬ 𝑘 = 𝐻 → if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))) = if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))
175	174	ifeq2d 4506	. . . . . . . . . . . 12 ⊢ (¬ 𝑘 = 𝐻 → if(𝑘 = 𝑟, if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙)), if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))) = if(𝑘 = 𝑟, if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙)), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))
176	175	adantl 482	. . . . . . . . . . 11 ⊢ ((𝑟 ≠ 𝐻 ∧ ¬ 𝑘 = 𝐻) → if(𝑘 = 𝑟, if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙)), if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))) = if(𝑘 = 𝑟, if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙)), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))
177		iffalse 4495	. . . . . . . . . . . 12 ⊢ (¬ 𝑘 = 𝐻 → if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ (𝑛 ∪ {𝑟}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))) = if(𝑘 ∈ (𝑛 ∪ {𝑟}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))
178	177	adantl 482	. . . . . . . . . . 11 ⊢ ((𝑟 ≠ 𝐻 ∧ ¬ 𝑘 = 𝐻) → if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ (𝑛 ∪ {𝑟}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))) = if(𝑘 ∈ (𝑛 ∪ {𝑟}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))
179	173, 176, 178	3eqtr4d 2786	. . . . . . . . . 10 ⊢ ((𝑟 ≠ 𝐻 ∧ ¬ 𝑘 = 𝐻) → if(𝑘 = 𝑟, if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙)), if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))) = if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ (𝑛 ∪ {𝑟}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))
180	150, 179	pm2.61dan 811	. . . . . . . . 9 ⊢ (𝑟 ≠ 𝐻 → if(𝑘 = 𝑟, if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙)), if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))) = if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ (𝑛 ∪ {𝑟}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))
181	180	mpoeq3dv 7436	. . . . . . . 8 ⊢ (𝑟 ≠ 𝐻 → (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑟, if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙)), if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))) = (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ (𝑛 ∪ {𝑟}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))))
182	181	fveq2d 6846	. . . . . . 7 ⊢ (𝑟 ≠ 𝐻 → (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑟, if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙)), if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))))) = (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ (𝑛 ∪ {𝑟}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))))
183	79, 182	syl 17	. . . . . 6 ⊢ ((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) → (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝑟, if(𝑙 = 𝐼, 0 , (𝑟𝑀𝑙)), if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))))) = (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ (𝑛 ∪ {𝑟}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))))
184	80, 139, 183	3eqtr3d 2784	. . . . 5 ⊢ ((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) → (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))) = (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ (𝑛 ∪ {𝑟}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))))
185	184	eqeq2d 2747	. . . 4 ⊢ ((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) → ((𝐼(𝐽‘𝑀)𝐻) = (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))) ↔ (𝐼(𝐽‘𝑀)𝐻) = (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ (𝑛 ∪ {𝑟}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))))))
186	185	biimpd 228	. . 3 ⊢ ((((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) ∧ (𝑛 ⊆ (𝑁 ∖ {𝐻}) ∧ 𝑟 ∈ ((𝑁 ∖ {𝐻}) ∖ 𝑛))) → ((𝐼(𝐽‘𝑀)𝐻) = (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ 𝑛, if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))) → (𝐼(𝐽‘𝑀)𝐻) = (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ (𝑛 ∪ {𝑟}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))))))
187		difss 4091	. . . 4 ⊢ (𝑁 ∖ {𝐻}) ⊆ 𝑁
188		ssfi 9117	. . . 4 ⊢ ((𝑁 ∈ Fin ∧ (𝑁 ∖ {𝐻}) ⊆ 𝑁) → (𝑁 ∖ {𝐻}) ∈ Fin)
189	47, 187, 188	sylancl 586	. . 3 ⊢ (((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝑁 ∖ {𝐻}) ∈ Fin)
190	6, 12, 18, 24, 39, 186, 189	findcard2d 9110	. 2 ⊢ (((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝐼(𝐽‘𝑀)𝐻) = (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ (𝑁 ∖ {𝐻}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))))
191		iba 528	. . . . . . . 8 ⊢ (𝑘 = 𝐻 → (𝑙 = 𝐼 ↔ (𝑙 = 𝐼 ∧ 𝑘 = 𝐻)))
192	191	ifbid 4509	. . . . . . 7 ⊢ (𝑘 = 𝐻 → if(𝑙 = 𝐼, 1 , 0 ) = if((𝑙 = 𝐼 ∧ 𝑘 = 𝐻), 1 , 0 ))
193		iftrue 4492	. . . . . . 7 ⊢ (𝑘 = 𝐻 → if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ (𝑁 ∖ {𝐻}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))) = if(𝑙 = 𝐼, 1 , 0 ))
194		iftrue 4492	. . . . . . . 8 ⊢ ((𝑘 = 𝐻 ∨ 𝑙 = 𝐼) → if((𝑘 = 𝐻 ∨ 𝑙 = 𝐼), if((𝑙 = 𝐼 ∧ 𝑘 = 𝐻), 1 , 0 ), (𝑘𝑀𝑙)) = if((𝑙 = 𝐼 ∧ 𝑘 = 𝐻), 1 , 0 ))
195	194	orcs 873	. . . . . . 7 ⊢ (𝑘 = 𝐻 → if((𝑘 = 𝐻 ∨ 𝑙 = 𝐼), if((𝑙 = 𝐼 ∧ 𝑘 = 𝐻), 1 , 0 ), (𝑘𝑀𝑙)) = if((𝑙 = 𝐼 ∧ 𝑘 = 𝐻), 1 , 0 ))
196	192, 193, 195	3eqtr4d 2786	. . . . . 6 ⊢ (𝑘 = 𝐻 → if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ (𝑁 ∖ {𝐻}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))) = if((𝑘 = 𝐻 ∨ 𝑙 = 𝐼), if((𝑙 = 𝐼 ∧ 𝑘 = 𝐻), 1 , 0 ), (𝑘𝑀𝑙)))
197	196	adantl 482	. . . . 5 ⊢ (((𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) ∧ 𝑘 = 𝐻) → if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ (𝑁 ∖ {𝐻}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))) = if((𝑘 = 𝐻 ∨ 𝑙 = 𝐼), if((𝑙 = 𝐼 ∧ 𝑘 = 𝐻), 1 , 0 ), (𝑘𝑀𝑙)))
198		iffalse 4495	. . . . . . 7 ⊢ (¬ 𝑘 = 𝐻 → if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ (𝑁 ∖ {𝐻}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))) = if(𝑘 ∈ (𝑁 ∖ {𝐻}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))
199	198	adantl 482	. . . . . 6 ⊢ (((𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) ∧ ¬ 𝑘 = 𝐻) → if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ (𝑁 ∖ {𝐻}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))) = if(𝑘 ∈ (𝑁 ∖ {𝐻}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))
200		neqne 2951	. . . . . . . . . 10 ⊢ (¬ 𝑘 = 𝐻 → 𝑘 ≠ 𝐻)
201	200	anim2i 617	. . . . . . . . 9 ⊢ ((𝑘 ∈ 𝑁 ∧ ¬ 𝑘 = 𝐻) → (𝑘 ∈ 𝑁 ∧ 𝑘 ≠ 𝐻))
202	201	adantlr 713	. . . . . . . 8 ⊢ (((𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) ∧ ¬ 𝑘 = 𝐻) → (𝑘 ∈ 𝑁 ∧ 𝑘 ≠ 𝐻))
203		eldifsn 4747	. . . . . . . 8 ⊢ (𝑘 ∈ (𝑁 ∖ {𝐻}) ↔ (𝑘 ∈ 𝑁 ∧ 𝑘 ≠ 𝐻))
204	202, 203	sylibr 233	. . . . . . 7 ⊢ (((𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) ∧ ¬ 𝑘 = 𝐻) → 𝑘 ∈ (𝑁 ∖ {𝐻}))
205	204	iftrued 4494	. . . . . 6 ⊢ (((𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) ∧ ¬ 𝑘 = 𝐻) → if(𝑘 ∈ (𝑁 ∖ {𝐻}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)) = if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)))
206		biorf 935	. . . . . . . 8 ⊢ (¬ 𝑘 = 𝐻 → (𝑙 = 𝐼 ↔ (𝑘 = 𝐻 ∨ 𝑙 = 𝐼)))
207		id 22	. . . . . . . . . . 11 ⊢ (¬ 𝑘 = 𝐻 → ¬ 𝑘 = 𝐻)
208	207	intnand 489	. . . . . . . . . 10 ⊢ (¬ 𝑘 = 𝐻 → ¬ (𝑙 = 𝐼 ∧ 𝑘 = 𝐻))
209	208	iffalsed 4497	. . . . . . . . 9 ⊢ (¬ 𝑘 = 𝐻 → if((𝑙 = 𝐼 ∧ 𝑘 = 𝐻), 1 , 0 ) = 0 )
210	209	eqcomd 2742	. . . . . . . 8 ⊢ (¬ 𝑘 = 𝐻 → 0 = if((𝑙 = 𝐼 ∧ 𝑘 = 𝐻), 1 , 0 ))
211	206, 210	ifbieq1d 4510	. . . . . . 7 ⊢ (¬ 𝑘 = 𝐻 → if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)) = if((𝑘 = 𝐻 ∨ 𝑙 = 𝐼), if((𝑙 = 𝐼 ∧ 𝑘 = 𝐻), 1 , 0 ), (𝑘𝑀𝑙)))
212	211	adantl 482	. . . . . 6 ⊢ (((𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) ∧ ¬ 𝑘 = 𝐻) → if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)) = if((𝑘 = 𝐻 ∨ 𝑙 = 𝐼), if((𝑙 = 𝐼 ∧ 𝑘 = 𝐻), 1 , 0 ), (𝑘𝑀𝑙)))
213	199, 205, 212	3eqtrd 2780	. . . . 5 ⊢ (((𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) ∧ ¬ 𝑘 = 𝐻) → if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ (𝑁 ∖ {𝐻}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))) = if((𝑘 = 𝐻 ∨ 𝑙 = 𝐼), if((𝑙 = 𝐼 ∧ 𝑘 = 𝐻), 1 , 0 ), (𝑘𝑀𝑙)))
214	197, 213	pm2.61dan 811	. . . 4 ⊢ ((𝑘 ∈ 𝑁 ∧ 𝑙 ∈ 𝑁) → if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ (𝑁 ∖ {𝐻}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))) = if((𝑘 = 𝐻 ∨ 𝑙 = 𝐼), if((𝑙 = 𝐼 ∧ 𝑘 = 𝐻), 1 , 0 ), (𝑘𝑀𝑙)))
215	214	mpoeq3ia 7435	. . 3 ⊢ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ (𝑁 ∖ {𝐻}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙)))) = (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if((𝑘 = 𝐻 ∨ 𝑙 = 𝐼), if((𝑙 = 𝐼 ∧ 𝑘 = 𝐻), 1 , 0 ), (𝑘𝑀𝑙)))
216	215	fveq2i 6845	. 2 ⊢ (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if(𝑘 = 𝐻, if(𝑙 = 𝐼, 1 , 0 ), if(𝑘 ∈ (𝑁 ∖ {𝐻}), if(𝑙 = 𝐼, 0 , (𝑘𝑀𝑙)), (𝑘𝑀𝑙))))) = (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if((𝑘 = 𝐻 ∨ 𝑙 = 𝐼), if((𝑙 = 𝐼 ∧ 𝑘 = 𝐻), 1 , 0 ), (𝑘𝑀𝑙))))
217	190, 216	eqtrdi 2792	1 ⊢ (((𝑅 ∈ CRing ∧ 𝑀 ∈ 𝐵) ∧ 𝐼 ∈ 𝑁 ∧ 𝐻 ∈ 𝑁) → (𝐼(𝐽‘𝑀)𝐻) = (𝐷‘(𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ if((𝑘 = 𝐻 ∨ 𝑙 = 𝐼), if((𝑙 = 𝐼 ∧ 𝑘 = 𝐻), 1 , 0 ), (𝑘𝑀𝑙)))))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 ∨ wo 845 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ≠ wne 2943 Vcvv 3445 ∖ cdif 3907 ∪ cun 3908 ⊆ wss 3910 ∅c0 4282 ifcif 4486 {csn 4586 × cxp 5631 ⟶wf 6492 ‘cfv 6496 (class class class)co 7357 ∈ cmpo 7359 ↑_m cmap 8765 Fincfn 8883 Basecbs 17083 +_gcplusg 17133 ._rcmulr 17134 0_gc0g 17321 Mndcmnd 18556 1_rcur 19913 Ringcrg 19964 CRingccrg 19965 Mat cmat 21754 maDet cmdat 21933 maAdju cmadu 21981

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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-rep 5242 ax-sep 5256 ax-nul 5263 ax-pow 5320 ax-pr 5384 ax-un 7672 ax-cnex 11107 ax-resscn 11108 ax-1cn 11109 ax-icn 11110 ax-addcl 11111 ax-addrcl 11112 ax-mulcl 11113 ax-mulrcl 11114 ax-mulcom 11115 ax-addass 11116 ax-mulass 11117 ax-distr 11118 ax-i2m1 11119 ax-1ne0 11120 ax-1rid 11121 ax-rnegex 11122 ax-rrecex 11123 ax-cnre 11124 ax-pre-lttri 11125 ax-pre-lttrn 11126 ax-pre-ltadd 11127 ax-pre-mulgt0 11128 ax-addf 11130 ax-mulf 11131

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-xor 1510 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3065 df-rex 3074 df-rmo 3353 df-reu 3354 df-rab 3408 df-v 3447 df-sbc 3740 df-csb 3856 df-dif 3913 df-un 3915 df-in 3917 df-ss 3927 df-pss 3929 df-nul 4283 df-if 4487 df-pw 4562 df-sn 4587 df-pr 4589 df-tp 4591 df-op 4593 df-ot 4595 df-uni 4866 df-int 4908 df-iun 4956 df-iin 4957 df-br 5106 df-opab 5168 df-mpt 5189 df-tr 5223 df-id 5531 df-eprel 5537 df-po 5545 df-so 5546 df-fr 5588 df-se 5589 df-we 5590 df-xp 5639 df-rel 5640 df-cnv 5641 df-co 5642 df-dm 5643 df-rn 5644 df-res 5645 df-ima 5646 df-pred 6253 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-isom 6505 df-riota 7313 df-ov 7360 df-oprab 7361 df-mpo 7362 df-of 7617 df-om 7803 df-1st 7921 df-2nd 7922 df-supp 8093 df-tpos 8157 df-frecs 8212 df-wrecs 8243 df-recs 8317 df-rdg 8356 df-1o 8412 df-2o 8413 df-er 8648 df-map 8767 df-pm 8768 df-ixp 8836 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-fsupp 9306 df-sup 9378 df-oi 9446 df-card 9875 df-pnf 11191 df-mnf 11192 df-xr 11193 df-ltxr 11194 df-le 11195 df-sub 11387 df-neg 11388 df-div 11813 df-nn 12154 df-2 12216 df-3 12217 df-4 12218 df-5 12219 df-6 12220 df-7 12221 df-8 12222 df-9 12223 df-n0 12414 df-xnn0 12486 df-z 12500 df-dec 12619 df-uz 12764 df-rp 12916 df-fz 13425 df-fzo 13568 df-seq 13907 df-exp 13968 df-hash 14231 df-word 14403 df-lsw 14451 df-concat 14459 df-s1 14484 df-substr 14529 df-pfx 14559 df-splice 14638 df-reverse 14647 df-s2 14737 df-struct 17019 df-sets 17036 df-slot 17054 df-ndx 17066 df-base 17084 df-ress 17113 df-plusg 17146 df-mulr 17147 df-starv 17148 df-sca 17149 df-vsca 17150 df-ip 17151 df-tset 17152 df-ple 17153 df-ds 17155 df-unif 17156 df-hom 17157 df-cco 17158 df-0g 17323 df-gsum 17324 df-prds 17329 df-pws 17331 df-mre 17466 df-mrc 17467 df-acs 17469 df-mgm 18497 df-sgrp 18546 df-mnd 18557 df-mhm 18601 df-submnd 18602 df-efmnd 18679 df-grp 18751 df-minusg 18752 df-mulg 18873 df-subg 18925 df-ghm 19006 df-gim 19049 df-cntz 19097 df-oppg 19124 df-symg 19149 df-pmtr 19224 df-psgn 19273 df-evpm 19274 df-cmn 19564 df-abl 19565 df-mgp 19897 df-ur 19914 df-ring 19966 df-cring 19967 df-oppr 20049 df-dvdsr 20070 df-unit 20071 df-invr 20101 df-dvr 20112 df-rnghom 20146 df-drng 20187 df-subrg 20220 df-sra 20633 df-rgmod 20634 df-cnfld 20797 df-zring 20870 df-zrh 20904 df-dsmm 21138 df-frlm 21153 df-mat 21755 df-mdet 21934 df-madu 21983

This theorem is referenced by: madutpos 21991

W3C validator