prjspner1 - Mathbox for Steven Nguyen

	Mathbox for Steven Nguyen		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > prjspner1		Structured version Visualization version GIF version

Theorem prjspner1 42115

Description: Two vectors whose zeroth coordinate is nonzero are equivalent if and only if they have the same representative in the (n-1)-dimensional affine subspace { x₀ = 1 } . For example, vectors in 3D space whose 𝑥 coordinate is nonzero are equivalent iff they intersect at the plane 𝑥 = 1 at the same point (also see section header). (Contributed by SN, 13-Aug-2023.)

**Hypotheses**
Ref	Expression
prjspner01.e	⊢ ∼ = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ∃𝑙 ∈ 𝑆 𝑥 = (𝑙 · 𝑦))}
prjspner01.f	⊢ 𝐹 = (𝑏 ∈ 𝐵 ↦ if((𝑏‘0) = 0 , 𝑏, ((𝐼‘(𝑏‘0)) · 𝑏)))
prjspner01.b	⊢ 𝐵 = ((Base‘𝑊) ∖ {(0_g‘𝑊)})
prjspner01.w	⊢ 𝑊 = (𝐾 freeLMod (0...𝑁))
prjspner01.t	⊢ · = ( ·_𝑠 ‘𝑊)
prjspner01.s	⊢ 𝑆 = (Base‘𝐾)
prjspner01.0	⊢ 0 = (0_g‘𝐾)
prjspner01.i	⊢ 𝐼 = (inv_r‘𝐾)
prjspner01.k	⊢ (𝜑 → 𝐾 ∈ DivRing)
prjspner01.n	⊢ (𝜑 → 𝑁 ∈ ℕ₀)
prjspner01.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
prjspner1.y	⊢ (𝜑 → 𝑌 ∈ 𝐵)
prjspner1.1	⊢ (𝜑 → (𝑋‘0) ≠ 0 )
prjspner1.2	⊢ (𝜑 → (𝑌‘0) ≠ 0 )

**Assertion**
Ref	Expression
prjspner1	⊢ (𝜑 → (𝑋 ∼ 𝑌 ↔ (𝐹‘𝑋) = (𝐹‘𝑌)))

Distinct variable groups: 𝑥,𝐵,𝑦 𝑋,𝑙,𝑥,𝑦 𝑊,𝑙,𝑥,𝑦 · ,𝑙,𝑥,𝑦 𝑆,𝑙 𝐼,𝑙,𝑥,𝑦 𝑥,𝐾,𝑦 𝑥, 0 ,𝑦 𝐵,𝑏 𝑋,𝑏 0 ,𝑏 · ,𝑏 𝐼,𝑏 𝜑,𝑏 𝑌,𝑙,𝑥,𝑦 𝑌,𝑏 𝑥,𝑆,𝑦 Allowed substitution hints: 𝜑(𝑥,𝑦,𝑙) 𝐵(𝑙) ∼ (𝑥,𝑦,𝑏,𝑙) 𝑆(𝑏) 𝐹(𝑥,𝑦,𝑏,𝑙) 𝐾(𝑏,𝑙) 𝑁(𝑥,𝑦,𝑏,𝑙) 𝑊(𝑏) 0 (𝑙)

Proof of Theorem prjspner1 Dummy variable 𝑚 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		prjspner01.e	. . . 4 ⊢ ∼ = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ∃𝑙 ∈ 𝑆 𝑥 = (𝑙 · 𝑦))}
2	1	prjsprel 42093	. . 3 ⊢ (𝑋 ∼ 𝑌 ↔ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ∃𝑚 ∈ 𝑆 𝑋 = (𝑚 · 𝑌)))
3		prjspner1.1	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑋‘0) ≠ 0 )
4		fveq1 6891	. . . . . . . . . . . . . . 15 ⊢ (𝑋 = (0_g‘𝑊) → (𝑋‘0) = ((0_g‘𝑊)‘0))
5		prjspner01.w	. . . . . . . . . . . . . . . 16 ⊢ 𝑊 = (𝐾 freeLMod (0...𝑁))
6		prjspner01.0	. . . . . . . . . . . . . . . 16 ⊢ 0 = (0_g‘𝐾)
7		prjspner01.k	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝐾 ∈ DivRing)
8	7	drngringd 20636	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝐾 ∈ Ring)
9		ovexd 7451	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (0...𝑁) ∈ V)
10		prjspner01.n	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝑁 ∈ ℕ₀)
11		0elfz 13630	. . . . . . . . . . . . . . . . 17 ⊢ (𝑁 ∈ ℕ₀ → 0 ∈ (0...𝑁))
12	10, 11	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 0 ∈ (0...𝑁))
13	5, 6, 8, 9, 12	frlm0vald 41825	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ((0_g‘𝑊)‘0) = 0 )
14	4, 13	sylan9eqr 2787	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑋 = (0_g‘𝑊)) → (𝑋‘0) = 0 )
15	3, 14	mteqand 3023	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑋 ≠ (0_g‘𝑊))
16	5	frlmsca 21691	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐾 ∈ DivRing ∧ (0...𝑁) ∈ V) → 𝐾 = (Scalar‘𝑊))
17	7, 9, 16	syl2anc 582	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝐾 = (Scalar‘𝑊))
18	17	fveq2d 6896	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (0_g‘𝐾) = (0_g‘(Scalar‘𝑊)))
19	6, 18	eqtrid 2777	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 0 = (0_g‘(Scalar‘𝑊)))
20	19	oveq1d 7431	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ( 0 · 𝑌) = ((0_g‘(Scalar‘𝑊)) · 𝑌))
21	5	frlmlvec 21699	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐾 ∈ DivRing ∧ (0...𝑁) ∈ V) → 𝑊 ∈ LVec)
22	7, 9, 21	syl2anc 582	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝑊 ∈ LVec)
23	22	lveclmodd 20996	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑊 ∈ LMod)
24		prjspner1.y	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
25		prjspner01.b	. . . . . . . . . . . . . . . . 17 ⊢ 𝐵 = ((Base‘𝑊) ∖ {(0_g‘𝑊)})
26	24, 25	eleqtrdi 2835	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝑌 ∈ ((Base‘𝑊) ∖ {(0_g‘𝑊)}))
27	26	eldifad 3951	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑌 ∈ (Base‘𝑊))
28		eqid 2725	. . . . . . . . . . . . . . . 16 ⊢ (Base‘𝑊) = (Base‘𝑊)
29		eqid 2725	. . . . . . . . . . . . . . . 16 ⊢ (Scalar‘𝑊) = (Scalar‘𝑊)
30		prjspner01.t	. . . . . . . . . . . . . . . 16 ⊢ · = ( ·_𝑠 ‘𝑊)
31		eqid 2725	. . . . . . . . . . . . . . . 16 ⊢ (0_g‘(Scalar‘𝑊)) = (0_g‘(Scalar‘𝑊))
32		eqid 2725	. . . . . . . . . . . . . . . 16 ⊢ (0_g‘𝑊) = (0_g‘𝑊)
33	28, 29, 30, 31, 32	lmod0vs 20782	. . . . . . . . . . . . . . 15 ⊢ ((𝑊 ∈ LMod ∧ 𝑌 ∈ (Base‘𝑊)) → ((0_g‘(Scalar‘𝑊)) · 𝑌) = (0_g‘𝑊))
34	23, 27, 33	syl2anc 582	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ((0_g‘(Scalar‘𝑊)) · 𝑌) = (0_g‘𝑊))
35	20, 34	eqtrd 2765	. . . . . . . . . . . . 13 ⊢ (𝜑 → ( 0 · 𝑌) = (0_g‘𝑊))
36	15, 35	neeqtrrd 3005	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑋 ≠ ( 0 · 𝑌))
37	36	ad2antrr 724	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) → 𝑋 ≠ ( 0 · 𝑌))
38		oveq1 7423	. . . . . . . . . . . 12 ⊢ (𝑚 = 0 → (𝑚 · 𝑌) = ( 0 · 𝑌))
39	38	neeq2d 2991	. . . . . . . . . . 11 ⊢ (𝑚 = 0 → (𝑋 ≠ (𝑚 · 𝑌) ↔ 𝑋 ≠ ( 0 · 𝑌)))
40	37, 39	syl5ibrcom 246	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) → (𝑚 = 0 → 𝑋 ≠ (𝑚 · 𝑌)))
41	40	necon2d 2953	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) → (𝑋 = (𝑚 · 𝑌) → 𝑚 ≠ 0 ))
42	41	ancrd 550	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) → (𝑋 = (𝑚 · 𝑌) → (𝑚 ≠ 0 ∧ 𝑋 = (𝑚 · 𝑌))))
43		prjspner01.s	. . . . . . . . . . . . . . 15 ⊢ 𝑆 = (Base‘𝐾)
44		ovexd 7451	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → (0...𝑁) ∈ V)
45		simplr 767	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → 𝑚 ∈ 𝑆)
46	27	ad3antrrr 728	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → 𝑌 ∈ (Base‘𝑊))
47	12	ad3antrrr 728	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → 0 ∈ (0...𝑁))
48		eqid 2725	. . . . . . . . . . . . . . 15 ⊢ (._r‘𝐾) = (._r‘𝐾)
49	5, 28, 43, 44, 45, 46, 47, 30, 48	frlmvscaval 21706	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → ((𝑚 · 𝑌)‘0) = (𝑚(._r‘𝐾)(𝑌‘0)))
50	49	fveq2d 6896	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → (𝐼‘((𝑚 · 𝑌)‘0)) = (𝐼‘(𝑚(._r‘𝐾)(𝑌‘0))))
51		prjspner01.i	. . . . . . . . . . . . . 14 ⊢ 𝐼 = (inv_r‘𝐾)
52	7	ad3antrrr 728	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → 𝐾 ∈ DivRing)
53	5, 43, 28	frlmbasf 21698	. . . . . . . . . . . . . . . . 17 ⊢ (((0...𝑁) ∈ V ∧ 𝑌 ∈ (Base‘𝑊)) → 𝑌:(0...𝑁)⟶𝑆)
54	9, 27, 53	syl2anc 582	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝑌:(0...𝑁)⟶𝑆)
55	54, 12	ffvelcdmd 7090	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝑌‘0) ∈ 𝑆)
56	55	ad3antrrr 728	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → (𝑌‘0) ∈ 𝑆)
57		simpr 483	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → 𝑚 ≠ 0 )
58		prjspner1.2	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝑌‘0) ≠ 0 )
59	58	ad3antrrr 728	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → (𝑌‘0) ≠ 0 )
60	43, 6, 48, 51, 52, 45, 56, 57, 59	drnginvmuld 41819	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → (𝐼‘(𝑚(._r‘𝐾)(𝑌‘0))) = ((𝐼‘(𝑌‘0))(._r‘𝐾)(𝐼‘𝑚)))
61	50, 60	eqtrd 2765	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → (𝐼‘((𝑚 · 𝑌)‘0)) = ((𝐼‘(𝑌‘0))(._r‘𝐾)(𝐼‘𝑚)))
62	61	oveq1d 7431	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → ((𝐼‘((𝑚 · 𝑌)‘0)) · (𝑚 · 𝑌)) = (((𝐼‘(𝑌‘0))(._r‘𝐾)(𝐼‘𝑚)) · (𝑚 · 𝑌)))
63	23	ad3antrrr 728	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → 𝑊 ∈ LMod)
64	8	ad3antrrr 728	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → 𝐾 ∈ Ring)
65	43, 6, 51, 52, 56, 59	drnginvrcld 20652	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → (𝐼‘(𝑌‘0)) ∈ 𝑆)
66	43, 6, 51, 52, 45, 57	drnginvrcld 20652	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → (𝐼‘𝑚) ∈ 𝑆)
67	43, 48, 64, 65, 66	ringcld 20203	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → ((𝐼‘(𝑌‘0))(._r‘𝐾)(𝐼‘𝑚)) ∈ 𝑆)
68	17	fveq2d 6896	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (Base‘𝐾) = (Base‘(Scalar‘𝑊)))
69	43, 68	eqtrid 2777	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑆 = (Base‘(Scalar‘𝑊)))
70	69	ad3antrrr 728	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → 𝑆 = (Base‘(Scalar‘𝑊)))
71	67, 70	eleqtrd 2827	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → ((𝐼‘(𝑌‘0))(._r‘𝐾)(𝐼‘𝑚)) ∈ (Base‘(Scalar‘𝑊)))
72	45, 70	eleqtrd 2827	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → 𝑚 ∈ (Base‘(Scalar‘𝑊)))
73		eqid 2725	. . . . . . . . . . . . 13 ⊢ (Base‘(Scalar‘𝑊)) = (Base‘(Scalar‘𝑊))
74		eqid 2725	. . . . . . . . . . . . 13 ⊢ (._r‘(Scalar‘𝑊)) = (._r‘(Scalar‘𝑊))
75	28, 29, 30, 73, 74	lmodvsass 20774	. . . . . . . . . . . 12 ⊢ ((𝑊 ∈ LMod ∧ (((𝐼‘(𝑌‘0))(._r‘𝐾)(𝐼‘𝑚)) ∈ (Base‘(Scalar‘𝑊)) ∧ 𝑚 ∈ (Base‘(Scalar‘𝑊)) ∧ 𝑌 ∈ (Base‘𝑊))) → ((((𝐼‘(𝑌‘0))(._r‘𝐾)(𝐼‘𝑚))(._r‘(Scalar‘𝑊))𝑚) · 𝑌) = (((𝐼‘(𝑌‘0))(._r‘𝐾)(𝐼‘𝑚)) · (𝑚 · 𝑌)))
76	63, 71, 72, 46, 75	syl13anc 1369	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → ((((𝐼‘(𝑌‘0))(._r‘𝐾)(𝐼‘𝑚))(._r‘(Scalar‘𝑊))𝑚) · 𝑌) = (((𝐼‘(𝑌‘0))(._r‘𝐾)(𝐼‘𝑚)) · (𝑚 · 𝑌)))
77	43, 48, 64, 65, 66, 45	ringassd 20201	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → (((𝐼‘(𝑌‘0))(._r‘𝐾)(𝐼‘𝑚))(._r‘𝐾)𝑚) = ((𝐼‘(𝑌‘0))(._r‘𝐾)((𝐼‘𝑚)(._r‘𝐾)𝑚)))
78	52, 44, 16	syl2anc 582	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → 𝐾 = (Scalar‘𝑊))
79	78	fveq2d 6896	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → (._r‘𝐾) = (._r‘(Scalar‘𝑊)))
80	79	oveqd 7433	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → (((𝐼‘(𝑌‘0))(._r‘𝐾)(𝐼‘𝑚))(._r‘𝐾)𝑚) = (((𝐼‘(𝑌‘0))(._r‘𝐾)(𝐼‘𝑚))(._r‘(Scalar‘𝑊))𝑚))
81		eqid 2725	. . . . . . . . . . . . . . . 16 ⊢ (1_r‘𝐾) = (1_r‘𝐾)
82	43, 6, 48, 81, 51, 52, 45, 57	drnginvrld 20655	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → ((𝐼‘𝑚)(._r‘𝐾)𝑚) = (1_r‘𝐾))
83	82	oveq2d 7432	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → ((𝐼‘(𝑌‘0))(._r‘𝐾)((𝐼‘𝑚)(._r‘𝐾)𝑚)) = ((𝐼‘(𝑌‘0))(._r‘𝐾)(1_r‘𝐾)))
84	43, 48, 81, 64, 65	ringridmd 20213	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → ((𝐼‘(𝑌‘0))(._r‘𝐾)(1_r‘𝐾)) = (𝐼‘(𝑌‘0)))
85	83, 84	eqtrd 2765	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → ((𝐼‘(𝑌‘0))(._r‘𝐾)((𝐼‘𝑚)(._r‘𝐾)𝑚)) = (𝐼‘(𝑌‘0)))
86	77, 80, 85	3eqtr3d 2773	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → (((𝐼‘(𝑌‘0))(._r‘𝐾)(𝐼‘𝑚))(._r‘(Scalar‘𝑊))𝑚) = (𝐼‘(𝑌‘0)))
87	86	oveq1d 7431	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → ((((𝐼‘(𝑌‘0))(._r‘𝐾)(𝐼‘𝑚))(._r‘(Scalar‘𝑊))𝑚) · 𝑌) = ((𝐼‘(𝑌‘0)) · 𝑌))
88	62, 76, 87	3eqtr2d 2771	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → ((𝐼‘((𝑚 · 𝑌)‘0)) · (𝑚 · 𝑌)) = ((𝐼‘(𝑌‘0)) · 𝑌))
89		fveq1 6891	. . . . . . . . . . . . 13 ⊢ (𝑋 = (𝑚 · 𝑌) → (𝑋‘0) = ((𝑚 · 𝑌)‘0))
90	89	fveq2d 6896	. . . . . . . . . . . 12 ⊢ (𝑋 = (𝑚 · 𝑌) → (𝐼‘(𝑋‘0)) = (𝐼‘((𝑚 · 𝑌)‘0)))
91		id 22	. . . . . . . . . . . 12 ⊢ (𝑋 = (𝑚 · 𝑌) → 𝑋 = (𝑚 · 𝑌))
92	90, 91	oveq12d 7434	. . . . . . . . . . 11 ⊢ (𝑋 = (𝑚 · 𝑌) → ((𝐼‘(𝑋‘0)) · 𝑋) = ((𝐼‘((𝑚 · 𝑌)‘0)) · (𝑚 · 𝑌)))
93	92	eqeq1d 2727	. . . . . . . . . 10 ⊢ (𝑋 = (𝑚 · 𝑌) → (((𝐼‘(𝑋‘0)) · 𝑋) = ((𝐼‘(𝑌‘0)) · 𝑌) ↔ ((𝐼‘((𝑚 · 𝑌)‘0)) · (𝑚 · 𝑌)) = ((𝐼‘(𝑌‘0)) · 𝑌)))
94	88, 93	syl5ibrcom 246	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → (𝑋 = (𝑚 · 𝑌) → ((𝐼‘(𝑋‘0)) · 𝑋) = ((𝐼‘(𝑌‘0)) · 𝑌)))
95	94	expimpd 452	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) → ((𝑚 ≠ 0 ∧ 𝑋 = (𝑚 · 𝑌)) → ((𝐼‘(𝑋‘0)) · 𝑋) = ((𝐼‘(𝑌‘0)) · 𝑌)))
96	42, 95	syld 47	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) → (𝑋 = (𝑚 · 𝑌) → ((𝐼‘(𝑋‘0)) · 𝑋) = ((𝐼‘(𝑌‘0)) · 𝑌)))
97	96	rexlimdva 3145	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (∃𝑚 ∈ 𝑆 𝑋 = (𝑚 · 𝑌) → ((𝐼‘(𝑋‘0)) · 𝑋) = ((𝐼‘(𝑌‘0)) · 𝑌)))
98	97	impr 453	. . . . 5 ⊢ ((𝜑 ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ∃𝑚 ∈ 𝑆 𝑋 = (𝑚 · 𝑌))) → ((𝐼‘(𝑋‘0)) · 𝑋) = ((𝐼‘(𝑌‘0)) · 𝑌))
99	3	neneqd 2935	. . . . . . 7 ⊢ (𝜑 → ¬ (𝑋‘0) = 0 )
100	99	iffalsed 4535	. . . . . 6 ⊢ (𝜑 → if((𝑋‘0) = 0 , 𝑋, ((𝐼‘(𝑋‘0)) · 𝑋)) = ((𝐼‘(𝑋‘0)) · 𝑋))
101	100	adantr 479	. . . . 5 ⊢ ((𝜑 ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ∃𝑚 ∈ 𝑆 𝑋 = (𝑚 · 𝑌))) → if((𝑋‘0) = 0 , 𝑋, ((𝐼‘(𝑋‘0)) · 𝑋)) = ((𝐼‘(𝑋‘0)) · 𝑋))
102	58	neneqd 2935	. . . . . . 7 ⊢ (𝜑 → ¬ (𝑌‘0) = 0 )
103	102	iffalsed 4535	. . . . . 6 ⊢ (𝜑 → if((𝑌‘0) = 0 , 𝑌, ((𝐼‘(𝑌‘0)) · 𝑌)) = ((𝐼‘(𝑌‘0)) · 𝑌))
104	103	adantr 479	. . . . 5 ⊢ ((𝜑 ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ∃𝑚 ∈ 𝑆 𝑋 = (𝑚 · 𝑌))) → if((𝑌‘0) = 0 , 𝑌, ((𝐼‘(𝑌‘0)) · 𝑌)) = ((𝐼‘(𝑌‘0)) · 𝑌))
105	98, 101, 104	3eqtr4d 2775	. . . 4 ⊢ ((𝜑 ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ∃𝑚 ∈ 𝑆 𝑋 = (𝑚 · 𝑌))) → if((𝑋‘0) = 0 , 𝑋, ((𝐼‘(𝑋‘0)) · 𝑋)) = if((𝑌‘0) = 0 , 𝑌, ((𝐼‘(𝑌‘0)) · 𝑌)))
106		prjspner01.f	. . . . 5 ⊢ 𝐹 = (𝑏 ∈ 𝐵 ↦ if((𝑏‘0) = 0 , 𝑏, ((𝐼‘(𝑏‘0)) · 𝑏)))
107		fveq1 6891	. . . . . . 7 ⊢ (𝑏 = 𝑋 → (𝑏‘0) = (𝑋‘0))
108	107	eqeq1d 2727	. . . . . 6 ⊢ (𝑏 = 𝑋 → ((𝑏‘0) = 0 ↔ (𝑋‘0) = 0 ))
109		id 22	. . . . . 6 ⊢ (𝑏 = 𝑋 → 𝑏 = 𝑋)
110	107	fveq2d 6896	. . . . . . 7 ⊢ (𝑏 = 𝑋 → (𝐼‘(𝑏‘0)) = (𝐼‘(𝑋‘0)))
111	110, 109	oveq12d 7434	. . . . . 6 ⊢ (𝑏 = 𝑋 → ((𝐼‘(𝑏‘0)) · 𝑏) = ((𝐼‘(𝑋‘0)) · 𝑋))
112	108, 109, 111	ifbieq12d 4552	. . . . 5 ⊢ (𝑏 = 𝑋 → if((𝑏‘0) = 0 , 𝑏, ((𝐼‘(𝑏‘0)) · 𝑏)) = if((𝑋‘0) = 0 , 𝑋, ((𝐼‘(𝑋‘0)) · 𝑋)))
113		simprll 777	. . . . 5 ⊢ ((𝜑 ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ∃𝑚 ∈ 𝑆 𝑋 = (𝑚 · 𝑌))) → 𝑋 ∈ 𝐵)
114		ovexd 7451	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ∃𝑚 ∈ 𝑆 𝑋 = (𝑚 · 𝑌))) → ((𝐼‘(𝑋‘0)) · 𝑋) ∈ V)
115	113, 114	ifexd 4572	. . . . 5 ⊢ ((𝜑 ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ∃𝑚 ∈ 𝑆 𝑋 = (𝑚 · 𝑌))) → if((𝑋‘0) = 0 , 𝑋, ((𝐼‘(𝑋‘0)) · 𝑋)) ∈ V)
116	106, 112, 113, 115	fvmptd3 7023	. . . 4 ⊢ ((𝜑 ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ∃𝑚 ∈ 𝑆 𝑋 = (𝑚 · 𝑌))) → (𝐹‘𝑋) = if((𝑋‘0) = 0 , 𝑋, ((𝐼‘(𝑋‘0)) · 𝑋)))
117		fveq1 6891	. . . . . . 7 ⊢ (𝑏 = 𝑌 → (𝑏‘0) = (𝑌‘0))
118	117	eqeq1d 2727	. . . . . 6 ⊢ (𝑏 = 𝑌 → ((𝑏‘0) = 0 ↔ (𝑌‘0) = 0 ))
119		id 22	. . . . . 6 ⊢ (𝑏 = 𝑌 → 𝑏 = 𝑌)
120	117	fveq2d 6896	. . . . . . 7 ⊢ (𝑏 = 𝑌 → (𝐼‘(𝑏‘0)) = (𝐼‘(𝑌‘0)))
121	120, 119	oveq12d 7434	. . . . . 6 ⊢ (𝑏 = 𝑌 → ((𝐼‘(𝑏‘0)) · 𝑏) = ((𝐼‘(𝑌‘0)) · 𝑌))
122	118, 119, 121	ifbieq12d 4552	. . . . 5 ⊢ (𝑏 = 𝑌 → if((𝑏‘0) = 0 , 𝑏, ((𝐼‘(𝑏‘0)) · 𝑏)) = if((𝑌‘0) = 0 , 𝑌, ((𝐼‘(𝑌‘0)) · 𝑌)))
123		simprlr 778	. . . . 5 ⊢ ((𝜑 ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ∃𝑚 ∈ 𝑆 𝑋 = (𝑚 · 𝑌))) → 𝑌 ∈ 𝐵)
124		ovexd 7451	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ∃𝑚 ∈ 𝑆 𝑋 = (𝑚 · 𝑌))) → ((𝐼‘(𝑌‘0)) · 𝑌) ∈ V)
125	123, 124	ifexd 4572	. . . . 5 ⊢ ((𝜑 ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ∃𝑚 ∈ 𝑆 𝑋 = (𝑚 · 𝑌))) → if((𝑌‘0) = 0 , 𝑌, ((𝐼‘(𝑌‘0)) · 𝑌)) ∈ V)
126	106, 122, 123, 125	fvmptd3 7023	. . . 4 ⊢ ((𝜑 ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ∃𝑚 ∈ 𝑆 𝑋 = (𝑚 · 𝑌))) → (𝐹‘𝑌) = if((𝑌‘0) = 0 , 𝑌, ((𝐼‘(𝑌‘0)) · 𝑌)))
127	105, 116, 126	3eqtr4d 2775	. . 3 ⊢ ((𝜑 ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ∃𝑚 ∈ 𝑆 𝑋 = (𝑚 · 𝑌))) → (𝐹‘𝑋) = (𝐹‘𝑌))
128	2, 127	sylan2b 592	. 2 ⊢ ((𝜑 ∧ 𝑋 ∼ 𝑌) → (𝐹‘𝑋) = (𝐹‘𝑌))
129	1, 5, 25, 43, 30, 7	prjspner 42108	. . . 4 ⊢ (𝜑 → ∼ Er 𝐵)
130	129	adantr 479	. . 3 ⊢ ((𝜑 ∧ (𝐹‘𝑋) = (𝐹‘𝑌)) → ∼ Er 𝐵)
131		prjspner01.x	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
132	1, 106, 25, 5, 30, 43, 6, 51, 7, 10, 131	prjspner01 42114	. . . 4 ⊢ (𝜑 → 𝑋 ∼ (𝐹‘𝑋))
133	132	adantr 479	. . 3 ⊢ ((𝜑 ∧ (𝐹‘𝑋) = (𝐹‘𝑌)) → 𝑋 ∼ (𝐹‘𝑋))
134	129, 132	ercl2 8736	. . . . . . 7 ⊢ (𝜑 → (𝐹‘𝑋) ∈ 𝐵)
135	134	adantr 479	. . . . . 6 ⊢ ((𝜑 ∧ (𝐹‘𝑋) = (𝐹‘𝑌)) → (𝐹‘𝑋) ∈ 𝐵)
136	130, 135	erref 8743	. . . . 5 ⊢ ((𝜑 ∧ (𝐹‘𝑋) = (𝐹‘𝑌)) → (𝐹‘𝑋) ∼ (𝐹‘𝑋))
137		breq2 5147	. . . . . 6 ⊢ ((𝐹‘𝑋) = (𝐹‘𝑌) → ((𝐹‘𝑋) ∼ (𝐹‘𝑋) ↔ (𝐹‘𝑋) ∼ (𝐹‘𝑌)))
138	137	adantl 480	. . . . 5 ⊢ ((𝜑 ∧ (𝐹‘𝑋) = (𝐹‘𝑌)) → ((𝐹‘𝑋) ∼ (𝐹‘𝑋) ↔ (𝐹‘𝑋) ∼ (𝐹‘𝑌)))
139	136, 138	mpbid 231	. . . 4 ⊢ ((𝜑 ∧ (𝐹‘𝑋) = (𝐹‘𝑌)) → (𝐹‘𝑋) ∼ (𝐹‘𝑌))
140	1, 106, 25, 5, 30, 43, 6, 51, 7, 10, 24	prjspner01 42114	. . . . 5 ⊢ (𝜑 → 𝑌 ∼ (𝐹‘𝑌))
141	140	adantr 479	. . . 4 ⊢ ((𝜑 ∧ (𝐹‘𝑋) = (𝐹‘𝑌)) → 𝑌 ∼ (𝐹‘𝑌))
142	130, 139, 141	ertr4d 8742	. . 3 ⊢ ((𝜑 ∧ (𝐹‘𝑋) = (𝐹‘𝑌)) → (𝐹‘𝑋) ∼ 𝑌)
143	130, 133, 142	ertrd 8739	. 2 ⊢ ((𝜑 ∧ (𝐹‘𝑋) = (𝐹‘𝑌)) → 𝑋 ∼ 𝑌)
144	128, 143	impbida 799	1 ⊢ (𝜑 → (𝑋 ∼ 𝑌 ↔ (𝐹‘𝑋) = (𝐹‘𝑌)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 = wceq 1533 ∈ wcel 2098 ≠ wne 2930 ∃wrex 3060 Vcvv 3463 ∖ cdif 3936 ifcif 4524 {csn 4624 class class class wbr 5143 {copab 5205 ↦ cmpt 5226 ⟶wf 6539 ‘cfv 6543 (class class class)co 7416 Er wer 8720 0cc0 11138 ℕ₀cn0 12502 ...cfz 13516 Basecbs 17179 ._rcmulr 17233 Scalarcsca 17235 ·_𝑠 cvsca 17236 0_gc0g 17420 1_rcur 20125 Ringcrg 20177 inv_rcinvr 20330 DivRingcdr 20628 LModclmod 20747 LVecclvec 20991 freeLMod cfrlm 21684

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-rep 5280 ax-sep 5294 ax-nul 5301 ax-pow 5359 ax-pr 5423 ax-un 7738 ax-cnex 11194 ax-resscn 11195 ax-1cn 11196 ax-icn 11197 ax-addcl 11198 ax-addrcl 11199 ax-mulcl 11200 ax-mulrcl 11201 ax-mulcom 11202 ax-addass 11203 ax-mulass 11204 ax-distr 11205 ax-i2m1 11206 ax-1ne0 11207 ax-1rid 11208 ax-rnegex 11209 ax-rrecex 11210 ax-cnre 11211 ax-pre-lttri 11212 ax-pre-lttrn 11213 ax-pre-ltadd 11214 ax-pre-mulgt0 11215

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-ifp 1061 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2931 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3364 df-reu 3365 df-rab 3420 df-v 3465 df-sbc 3769 df-csb 3885 df-dif 3942 df-un 3944 df-in 3946 df-ss 3956 df-pss 3959 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-tp 4629 df-op 4631 df-uni 4904 df-iun 4993 df-br 5144 df-opab 5206 df-mpt 5227 df-tr 5261 df-id 5570 df-eprel 5576 df-po 5584 df-so 5585 df-fr 5627 df-we 5629 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7372 df-ov 7419 df-oprab 7420 df-mpo 7421 df-of 7682 df-om 7869 df-1st 7991 df-2nd 7992 df-supp 8164 df-tpos 8230 df-frecs 8285 df-wrecs 8316 df-recs 8390 df-rdg 8429 df-1o 8485 df-er 8723 df-map 8845 df-ixp 8915 df-en 8963 df-dom 8964 df-sdom 8965 df-fin 8966 df-fsupp 9386 df-sup 9465 df-pnf 11280 df-mnf 11281 df-xr 11282 df-ltxr 11283 df-le 11284 df-sub 11476 df-neg 11477 df-nn 12243 df-2 12305 df-3 12306 df-4 12307 df-5 12308 df-6 12309 df-7 12310 df-8 12311 df-9 12312 df-n0 12503 df-z 12589 df-dec 12708 df-uz 12853 df-fz 13517 df-struct 17115 df-sets 17132 df-slot 17150 df-ndx 17162 df-base 17180 df-ress 17209 df-plusg 17245 df-mulr 17246 df-sca 17248 df-vsca 17249 df-ip 17250 df-tset 17251 df-ple 17252 df-ds 17254 df-hom 17256 df-cco 17257 df-0g 17422 df-prds 17428 df-pws 17430 df-mgm 18599 df-sgrp 18678 df-mnd 18694 df-grp 18897 df-minusg 18898 df-sbg 18899 df-subg 19082 df-cmn 19741 df-abl 19742 df-mgp 20079 df-rng 20097 df-ur 20126 df-ring 20179 df-oppr 20277 df-dvdsr 20300 df-unit 20301 df-invr 20331 df-subrg 20512 df-drng 20630 df-lmod 20749 df-lss 20820 df-lvec 20992 df-sra 21062 df-rgmod 21063 df-dsmm 21670 df-frlm 21685

This theorem is referenced by: (None)

W3C validator