scmatf1 - Metamath Proof Explorer

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

Theorem scmatf1 22024

Description: There is a 1-1 function from a ring to any ring of scalar matrices with positive dimension over this ring. (Contributed by AV, 25-Dec-2019.)

**Hypotheses**
Ref	Expression
scmatrhmval.k	⊢ 𝐾 = (Base‘𝑅)
scmatrhmval.a	⊢ 𝐴 = (𝑁 Mat 𝑅)
scmatrhmval.o	⊢ 1 = (1_r‘𝐴)
scmatrhmval.t	⊢ ∗ = ( ·_𝑠 ‘𝐴)
scmatrhmval.f	⊢ 𝐹 = (𝑥 ∈ 𝐾 ↦ (𝑥 ∗ 1 ))
scmatrhmval.c	⊢ 𝐶 = (𝑁 ScMat 𝑅)

**Assertion**
Ref	Expression
scmatf1	⊢ ((𝑁 ∈ Fin ∧ 𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) → 𝐹:𝐾–1-1→𝐶)

Distinct variable groups: 𝑥,𝐾 𝑥,𝑅 𝑥, 1 𝑥, ∗ 𝑥,𝐶 𝑥,𝑁 Allowed substitution hints: 𝐴(𝑥) 𝐹(𝑥)

Proof of Theorem scmatf1 Dummy variables 𝑦 𝑧 𝑖 𝑗 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		scmatrhmval.k	. . . 4 ⊢ 𝐾 = (Base‘𝑅)
2		scmatrhmval.a	. . . 4 ⊢ 𝐴 = (𝑁 Mat 𝑅)
3		scmatrhmval.o	. . . 4 ⊢ 1 = (1_r‘𝐴)
4		scmatrhmval.t	. . . 4 ⊢ ∗ = ( ·_𝑠 ‘𝐴)
5		scmatrhmval.f	. . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝐾 ↦ (𝑥 ∗ 1 ))
6		scmatrhmval.c	. . . 4 ⊢ 𝐶 = (𝑁 ScMat 𝑅)
7	1, 2, 3, 4, 5, 6	scmatf 22022	. . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝐹:𝐾⟶𝐶)
8	7	3adant2 1131	. 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) → 𝐹:𝐾⟶𝐶)
9		simpr 485	. . . . . . 7 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝑅 ∈ Ring)
10		simpl 483	. . . . . . 7 ⊢ ((𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾) → 𝑦 ∈ 𝐾)
11	1, 2, 3, 4, 5	scmatrhmval 22020	. . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ 𝑦 ∈ 𝐾) → (𝐹‘𝑦) = (𝑦 ∗ 1 ))
12	9, 10, 11	syl2an 596	. . . . . 6 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾)) → (𝐹‘𝑦) = (𝑦 ∗ 1 ))
13		simpr 485	. . . . . . 7 ⊢ ((𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾) → 𝑧 ∈ 𝐾)
14	1, 2, 3, 4, 5	scmatrhmval 22020	. . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ 𝑧 ∈ 𝐾) → (𝐹‘𝑧) = (𝑧 ∗ 1 ))
15	9, 13, 14	syl2an 596	. . . . . 6 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾)) → (𝐹‘𝑧) = (𝑧 ∗ 1 ))
16	12, 15	eqeq12d 2748	. . . . 5 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾)) → ((𝐹‘𝑦) = (𝐹‘𝑧) ↔ (𝑦 ∗ 1 ) = (𝑧 ∗ 1 )))
17	16	3adantl2 1167	. . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) ∧ (𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾)) → ((𝐹‘𝑦) = (𝐹‘𝑧) ↔ (𝑦 ∗ 1 ) = (𝑧 ∗ 1 )))
18	2	matring 21936	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 𝐴 ∈ Ring)
19		eqid 2732	. . . . . . . . . . . 12 ⊢ (Base‘𝐴) = (Base‘𝐴)
20	19, 3	ringidcl 20076	. . . . . . . . . . 11 ⊢ (𝐴 ∈ Ring → 1 ∈ (Base‘𝐴))
21	18, 20	syl 17	. . . . . . . . . 10 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) → 1 ∈ (Base‘𝐴))
22	21, 10	anim12ci 614	. . . . . . . . 9 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾)) → (𝑦 ∈ 𝐾 ∧ 1 ∈ (Base‘𝐴)))
23	1, 2, 19, 4	matvscl 21924	. . . . . . . . 9 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑦 ∈ 𝐾 ∧ 1 ∈ (Base‘𝐴))) → (𝑦 ∗ 1 ) ∈ (Base‘𝐴))
24	22, 23	syldan 591	. . . . . . . 8 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾)) → (𝑦 ∗ 1 ) ∈ (Base‘𝐴))
25	21, 13	anim12ci 614	. . . . . . . . 9 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾)) → (𝑧 ∈ 𝐾 ∧ 1 ∈ (Base‘𝐴)))
26	1, 2, 19, 4	matvscl 21924	. . . . . . . . 9 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑧 ∈ 𝐾 ∧ 1 ∈ (Base‘𝐴))) → (𝑧 ∗ 1 ) ∈ (Base‘𝐴))
27	25, 26	syldan 591	. . . . . . . 8 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾)) → (𝑧 ∗ 1 ) ∈ (Base‘𝐴))
28	24, 27	jca 512	. . . . . . 7 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾)) → ((𝑦 ∗ 1 ) ∈ (Base‘𝐴) ∧ (𝑧 ∗ 1 ) ∈ (Base‘𝐴)))
29	28	3adantl2 1167	. . . . . 6 ⊢ (((𝑁 ∈ Fin ∧ 𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) ∧ (𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾)) → ((𝑦 ∗ 1 ) ∈ (Base‘𝐴) ∧ (𝑧 ∗ 1 ) ∈ (Base‘𝐴)))
30	2, 19	eqmat 21917	. . . . . 6 ⊢ (((𝑦 ∗ 1 ) ∈ (Base‘𝐴) ∧ (𝑧 ∗ 1 ) ∈ (Base‘𝐴)) → ((𝑦 ∗ 1 ) = (𝑧 ∗ 1 ) ↔ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖(𝑦 ∗ 1 )𝑗) = (𝑖(𝑧 ∗ 1 )𝑗)))
31	29, 30	syl 17	. . . . 5 ⊢ (((𝑁 ∈ Fin ∧ 𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) ∧ (𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾)) → ((𝑦 ∗ 1 ) = (𝑧 ∗ 1 ) ↔ ∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖(𝑦 ∗ 1 )𝑗) = (𝑖(𝑧 ∗ 1 )𝑗)))
32		difsnid 4812	. . . . . . . . . . . 12 ⊢ (𝑖 ∈ 𝑁 → ((𝑁 ∖ {𝑖}) ∪ {𝑖}) = 𝑁)
33	32	eqcomd 2738	. . . . . . . . . . 11 ⊢ (𝑖 ∈ 𝑁 → 𝑁 = ((𝑁 ∖ {𝑖}) ∪ {𝑖}))
34	33	adantl 482	. . . . . . . . . 10 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾)) ∧ 𝑖 ∈ 𝑁) → 𝑁 = ((𝑁 ∖ {𝑖}) ∪ {𝑖}))
35	34	raleqdv 3325	. . . . . . . . 9 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾)) ∧ 𝑖 ∈ 𝑁) → (∀𝑗 ∈ 𝑁 (𝑖(𝑦 ∗ 1 )𝑗) = (𝑖(𝑧 ∗ 1 )𝑗) ↔ ∀𝑗 ∈ ((𝑁 ∖ {𝑖}) ∪ {𝑖})(𝑖(𝑦 ∗ 1 )𝑗) = (𝑖(𝑧 ∗ 1 )𝑗)))
36		oveq2 7413	. . . . . . . . . . . 12 ⊢ (𝑗 = 𝑖 → (𝑖(𝑦 ∗ 1 )𝑗) = (𝑖(𝑦 ∗ 1 )𝑖))
37		oveq2 7413	. . . . . . . . . . . 12 ⊢ (𝑗 = 𝑖 → (𝑖(𝑧 ∗ 1 )𝑗) = (𝑖(𝑧 ∗ 1 )𝑖))
38	36, 37	eqeq12d 2748	. . . . . . . . . . 11 ⊢ (𝑗 = 𝑖 → ((𝑖(𝑦 ∗ 1 )𝑗) = (𝑖(𝑧 ∗ 1 )𝑗) ↔ (𝑖(𝑦 ∗ 1 )𝑖) = (𝑖(𝑧 ∗ 1 )𝑖)))
39	38	ralunsn 4893	. . . . . . . . . 10 ⊢ (𝑖 ∈ 𝑁 → (∀𝑗 ∈ ((𝑁 ∖ {𝑖}) ∪ {𝑖})(𝑖(𝑦 ∗ 1 )𝑗) = (𝑖(𝑧 ∗ 1 )𝑗) ↔ (∀𝑗 ∈ (𝑁 ∖ {𝑖})(𝑖(𝑦 ∗ 1 )𝑗) = (𝑖(𝑧 ∗ 1 )𝑗) ∧ (𝑖(𝑦 ∗ 1 )𝑖) = (𝑖(𝑧 ∗ 1 )𝑖))))
40	39	adantl 482	. . . . . . . . 9 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾)) ∧ 𝑖 ∈ 𝑁) → (∀𝑗 ∈ ((𝑁 ∖ {𝑖}) ∪ {𝑖})(𝑖(𝑦 ∗ 1 )𝑗) = (𝑖(𝑧 ∗ 1 )𝑗) ↔ (∀𝑗 ∈ (𝑁 ∖ {𝑖})(𝑖(𝑦 ∗ 1 )𝑗) = (𝑖(𝑧 ∗ 1 )𝑗) ∧ (𝑖(𝑦 ∗ 1 )𝑖) = (𝑖(𝑧 ∗ 1 )𝑖))))
41	10	anim2i 617	. . . . . . . . . . . . . 14 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾)) → ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑦 ∈ 𝐾))
42		df-3an 1089	. . . . . . . . . . . . . 14 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑦 ∈ 𝐾) ↔ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑦 ∈ 𝐾))
43	41, 42	sylibr 233	. . . . . . . . . . . . 13 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾)) → (𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑦 ∈ 𝐾))
44		id 22	. . . . . . . . . . . . . 14 ⊢ (𝑖 ∈ 𝑁 → 𝑖 ∈ 𝑁)
45	44, 44	jca 512	. . . . . . . . . . . . 13 ⊢ (𝑖 ∈ 𝑁 → (𝑖 ∈ 𝑁 ∧ 𝑖 ∈ 𝑁))
46		eqid 2732	. . . . . . . . . . . . . 14 ⊢ (0_g‘𝑅) = (0_g‘𝑅)
47	2, 1, 46, 3, 4	scmatscmide 22000	. . . . . . . . . . . . 13 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑦 ∈ 𝐾) ∧ (𝑖 ∈ 𝑁 ∧ 𝑖 ∈ 𝑁)) → (𝑖(𝑦 ∗ 1 )𝑖) = if(𝑖 = 𝑖, 𝑦, (0_g‘𝑅)))
48	43, 45, 47	syl2an 596	. . . . . . . . . . . 12 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾)) ∧ 𝑖 ∈ 𝑁) → (𝑖(𝑦 ∗ 1 )𝑖) = if(𝑖 = 𝑖, 𝑦, (0_g‘𝑅)))
49		eqid 2732	. . . . . . . . . . . . 13 ⊢ 𝑖 = 𝑖
50	49	iftruei 4534	. . . . . . . . . . . 12 ⊢ if(𝑖 = 𝑖, 𝑦, (0_g‘𝑅)) = 𝑦
51	48, 50	eqtrdi 2788	. . . . . . . . . . 11 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾)) ∧ 𝑖 ∈ 𝑁) → (𝑖(𝑦 ∗ 1 )𝑖) = 𝑦)
52	13	anim2i 617	. . . . . . . . . . . . . 14 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾)) → ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑧 ∈ 𝐾))
53		df-3an 1089	. . . . . . . . . . . . . 14 ⊢ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑧 ∈ 𝐾) ↔ ((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ 𝑧 ∈ 𝐾))
54	52, 53	sylibr 233	. . . . . . . . . . . . 13 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾)) → (𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑧 ∈ 𝐾))
55	2, 1, 46, 3, 4	scmatscmide 22000	. . . . . . . . . . . . 13 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring ∧ 𝑧 ∈ 𝐾) ∧ (𝑖 ∈ 𝑁 ∧ 𝑖 ∈ 𝑁)) → (𝑖(𝑧 ∗ 1 )𝑖) = if(𝑖 = 𝑖, 𝑧, (0_g‘𝑅)))
56	54, 45, 55	syl2an 596	. . . . . . . . . . . 12 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾)) ∧ 𝑖 ∈ 𝑁) → (𝑖(𝑧 ∗ 1 )𝑖) = if(𝑖 = 𝑖, 𝑧, (0_g‘𝑅)))
57	49	iftruei 4534	. . . . . . . . . . . 12 ⊢ if(𝑖 = 𝑖, 𝑧, (0_g‘𝑅)) = 𝑧
58	56, 57	eqtrdi 2788	. . . . . . . . . . 11 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾)) ∧ 𝑖 ∈ 𝑁) → (𝑖(𝑧 ∗ 1 )𝑖) = 𝑧)
59	51, 58	eqeq12d 2748	. . . . . . . . . 10 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾)) ∧ 𝑖 ∈ 𝑁) → ((𝑖(𝑦 ∗ 1 )𝑖) = (𝑖(𝑧 ∗ 1 )𝑖) ↔ 𝑦 = 𝑧))
60	59	anbi2d 629	. . . . . . . . 9 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾)) ∧ 𝑖 ∈ 𝑁) → ((∀𝑗 ∈ (𝑁 ∖ {𝑖})(𝑖(𝑦 ∗ 1 )𝑗) = (𝑖(𝑧 ∗ 1 )𝑗) ∧ (𝑖(𝑦 ∗ 1 )𝑖) = (𝑖(𝑧 ∗ 1 )𝑖)) ↔ (∀𝑗 ∈ (𝑁 ∖ {𝑖})(𝑖(𝑦 ∗ 1 )𝑗) = (𝑖(𝑧 ∗ 1 )𝑗) ∧ 𝑦 = 𝑧)))
61	35, 40, 60	3bitrd 304	. . . . . . . 8 ⊢ ((((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾)) ∧ 𝑖 ∈ 𝑁) → (∀𝑗 ∈ 𝑁 (𝑖(𝑦 ∗ 1 )𝑗) = (𝑖(𝑧 ∗ 1 )𝑗) ↔ (∀𝑗 ∈ (𝑁 ∖ {𝑖})(𝑖(𝑦 ∗ 1 )𝑗) = (𝑖(𝑧 ∗ 1 )𝑗) ∧ 𝑦 = 𝑧)))
62	61	ralbidva 3175	. . . . . . 7 ⊢ (((𝑁 ∈ Fin ∧ 𝑅 ∈ Ring) ∧ (𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾)) → (∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖(𝑦 ∗ 1 )𝑗) = (𝑖(𝑧 ∗ 1 )𝑗) ↔ ∀𝑖 ∈ 𝑁 (∀𝑗 ∈ (𝑁 ∖ {𝑖})(𝑖(𝑦 ∗ 1 )𝑗) = (𝑖(𝑧 ∗ 1 )𝑗) ∧ 𝑦 = 𝑧)))
63	62	3adantl2 1167	. . . . . 6 ⊢ (((𝑁 ∈ Fin ∧ 𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) ∧ (𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾)) → (∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖(𝑦 ∗ 1 )𝑗) = (𝑖(𝑧 ∗ 1 )𝑗) ↔ ∀𝑖 ∈ 𝑁 (∀𝑗 ∈ (𝑁 ∖ {𝑖})(𝑖(𝑦 ∗ 1 )𝑗) = (𝑖(𝑧 ∗ 1 )𝑗) ∧ 𝑦 = 𝑧)))
64		r19.26 3111	. . . . . . . 8 ⊢ (∀𝑖 ∈ 𝑁 (∀𝑗 ∈ (𝑁 ∖ {𝑖})(𝑖(𝑦 ∗ 1 )𝑗) = (𝑖(𝑧 ∗ 1 )𝑗) ∧ 𝑦 = 𝑧) ↔ (∀𝑖 ∈ 𝑁 ∀𝑗 ∈ (𝑁 ∖ {𝑖})(𝑖(𝑦 ∗ 1 )𝑗) = (𝑖(𝑧 ∗ 1 )𝑗) ∧ ∀𝑖 ∈ 𝑁 𝑦 = 𝑧))
65		rspn0 4351	. . . . . . . . . . 11 ⊢ (𝑁 ≠ ∅ → (∀𝑖 ∈ 𝑁 𝑦 = 𝑧 → 𝑦 = 𝑧))
66	65	3ad2ant2 1134	. . . . . . . . . 10 ⊢ ((𝑁 ∈ Fin ∧ 𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) → (∀𝑖 ∈ 𝑁 𝑦 = 𝑧 → 𝑦 = 𝑧))
67	66	adantr 481	. . . . . . . . 9 ⊢ (((𝑁 ∈ Fin ∧ 𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) ∧ (𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾)) → (∀𝑖 ∈ 𝑁 𝑦 = 𝑧 → 𝑦 = 𝑧))
68	67	com12 32	. . . . . . . 8 ⊢ (∀𝑖 ∈ 𝑁 𝑦 = 𝑧 → (((𝑁 ∈ Fin ∧ 𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) ∧ (𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾)) → 𝑦 = 𝑧))
69	64, 68	simplbiim 505	. . . . . . 7 ⊢ (∀𝑖 ∈ 𝑁 (∀𝑗 ∈ (𝑁 ∖ {𝑖})(𝑖(𝑦 ∗ 1 )𝑗) = (𝑖(𝑧 ∗ 1 )𝑗) ∧ 𝑦 = 𝑧) → (((𝑁 ∈ Fin ∧ 𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) ∧ (𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾)) → 𝑦 = 𝑧))
70	69	com12 32	. . . . . 6 ⊢ (((𝑁 ∈ Fin ∧ 𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) ∧ (𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾)) → (∀𝑖 ∈ 𝑁 (∀𝑗 ∈ (𝑁 ∖ {𝑖})(𝑖(𝑦 ∗ 1 )𝑗) = (𝑖(𝑧 ∗ 1 )𝑗) ∧ 𝑦 = 𝑧) → 𝑦 = 𝑧))
71	63, 70	sylbid 239	. . . . 5 ⊢ (((𝑁 ∈ Fin ∧ 𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) ∧ (𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾)) → (∀𝑖 ∈ 𝑁 ∀𝑗 ∈ 𝑁 (𝑖(𝑦 ∗ 1 )𝑗) = (𝑖(𝑧 ∗ 1 )𝑗) → 𝑦 = 𝑧))
72	31, 71	sylbid 239	. . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) ∧ (𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾)) → ((𝑦 ∗ 1 ) = (𝑧 ∗ 1 ) → 𝑦 = 𝑧))
73	17, 72	sylbid 239	. . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) ∧ (𝑦 ∈ 𝐾 ∧ 𝑧 ∈ 𝐾)) → ((𝐹‘𝑦) = (𝐹‘𝑧) → 𝑦 = 𝑧))
74	73	ralrimivva 3200	. 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) → ∀𝑦 ∈ 𝐾 ∀𝑧 ∈ 𝐾 ((𝐹‘𝑦) = (𝐹‘𝑧) → 𝑦 = 𝑧))
75		dff13 7250	. 2 ⊢ (𝐹:𝐾–1-1→𝐶 ↔ (𝐹:𝐾⟶𝐶 ∧ ∀𝑦 ∈ 𝐾 ∀𝑧 ∈ 𝐾 ((𝐹‘𝑦) = (𝐹‘𝑧) → 𝑦 = 𝑧)))
76	8, 74, 75	sylanbrc 583	1 ⊢ ((𝑁 ∈ Fin ∧ 𝑁 ≠ ∅ ∧ 𝑅 ∈ Ring) → 𝐹:𝐾–1-1→𝐶)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ≠ wne 2940 ∀wral 3061 ∖ cdif 3944 ∪ cun 3945 ∅c0 4321 ifcif 4527 {csn 4627 ↦ cmpt 5230 ⟶wf 6536 –1-1→wf1 6537 ‘cfv 6540 (class class class)co 7405 Fincfn 8935 Basecbs 17140 ·_𝑠 cvsca 17197 0_gc0g 17381 1_rcur 19998 Ringcrg 20049 Mat cmat 21898 ScMat cscmat 21982

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 2703 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-tp 4632 df-op 4634 df-ot 4636 df-uni 4908 df-int 4950 df-iun 4998 df-iin 4999 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-se 5631 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6297 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-isom 6549 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-of 7666 df-om 7852 df-1st 7971 df-2nd 7972 df-supp 8143 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-1o 8462 df-er 8699 df-map 8818 df-ixp 8888 df-en 8936 df-dom 8937 df-sdom 8938 df-fin 8939 df-fsupp 9358 df-sup 9433 df-oi 9501 df-card 9930 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11442 df-neg 11443 df-nn 12209 df-2 12271 df-3 12272 df-4 12273 df-5 12274 df-6 12275 df-7 12276 df-8 12277 df-9 12278 df-n0 12469 df-z 12555 df-dec 12674 df-uz 12819 df-fz 13481 df-fzo 13624 df-seq 13963 df-hash 14287 df-struct 17076 df-sets 17093 df-slot 17111 df-ndx 17123 df-base 17141 df-ress 17170 df-plusg 17206 df-mulr 17207 df-sca 17209 df-vsca 17210 df-ip 17211 df-tset 17212 df-ple 17213 df-ds 17215 df-hom 17217 df-cco 17218 df-0g 17383 df-gsum 17384 df-prds 17389 df-pws 17391 df-mre 17526 df-mrc 17527 df-acs 17529 df-mgm 18557 df-sgrp 18606 df-mnd 18622 df-mhm 18667 df-submnd 18668 df-grp 18818 df-minusg 18819 df-sbg 18820 df-mulg 18945 df-subg 18997 df-ghm 19084 df-cntz 19175 df-cmn 19644 df-abl 19645 df-mgp 19982 df-ur 19999 df-ring 20051 df-subrg 20353 df-lmod 20465 df-lss 20535 df-sra 20777 df-rgmod 20778 df-dsmm 21278 df-frlm 21293 df-mamu 21877 df-mat 21899 df-scmat 21984

This theorem is referenced by: scmatf1o 22025

W3C validator