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 41364

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 41342	. . 3 ⊢ (𝑋 ∼ 𝑌 ↔ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ∃𝑚 ∈ 𝑆 𝑋 = (𝑚 · 𝑌)))
3		prjspner1.1	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑋‘0) ≠ 0 )
4		fveq1 6887	. . . . . . . . . . . . . . 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 20315	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝐾 ∈ Ring)
9		ovexd 7440	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (0...𝑁) ∈ V)
10		prjspner01.n	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝑁 ∈ ℕ₀)
11		0elfz 13594	. . . . . . . . . . . . . . . . 17 ⊢ (𝑁 ∈ ℕ₀ → 0 ∈ (0...𝑁))
12	10, 11	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 0 ∈ (0...𝑁))
13	5, 6, 8, 9, 12	frlm0vald 41106	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ((0_g‘𝑊)‘0) = 0 )
14	4, 13	sylan9eqr 2794	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑋 = (0_g‘𝑊)) → (𝑋‘0) = 0 )
15	3, 14	mteqand 3033	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑋 ≠ (0_g‘𝑊))
16	5	frlmsca 21299	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐾 ∈ DivRing ∧ (0...𝑁) ∈ V) → 𝐾 = (Scalar‘𝑊))
17	7, 9, 16	syl2anc 584	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝐾 = (Scalar‘𝑊))
18	17	fveq2d 6892	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (0_g‘𝐾) = (0_g‘(Scalar‘𝑊)))
19	6, 18	eqtrid 2784	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 0 = (0_g‘(Scalar‘𝑊)))
20	19	oveq1d 7420	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ( 0 · 𝑌) = ((0_g‘(Scalar‘𝑊)) · 𝑌))
21	5	frlmlvec 21307	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐾 ∈ DivRing ∧ (0...𝑁) ∈ V) → 𝑊 ∈ LVec)
22	7, 9, 21	syl2anc 584	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝑊 ∈ LVec)
23	22	lveclmodd 20710	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑊 ∈ LMod)
24		prjspner1.y	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
25		prjspner01.b	. . . . . . . . . . . . . . . . 17 ⊢ 𝐵 = ((Base‘𝑊) ∖ {(0_g‘𝑊)})
26	24, 25	eleqtrdi 2843	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝑌 ∈ ((Base‘𝑊) ∖ {(0_g‘𝑊)}))
27	26	eldifad 3959	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑌 ∈ (Base‘𝑊))
28		eqid 2732	. . . . . . . . . . . . . . . 16 ⊢ (Base‘𝑊) = (Base‘𝑊)
29		eqid 2732	. . . . . . . . . . . . . . . 16 ⊢ (Scalar‘𝑊) = (Scalar‘𝑊)
30		prjspner01.t	. . . . . . . . . . . . . . . 16 ⊢ · = ( ·_𝑠 ‘𝑊)
31		eqid 2732	. . . . . . . . . . . . . . . 16 ⊢ (0_g‘(Scalar‘𝑊)) = (0_g‘(Scalar‘𝑊))
32		eqid 2732	. . . . . . . . . . . . . . . 16 ⊢ (0_g‘𝑊) = (0_g‘𝑊)
33	28, 29, 30, 31, 32	lmod0vs 20497	. . . . . . . . . . . . . . 15 ⊢ ((𝑊 ∈ LMod ∧ 𝑌 ∈ (Base‘𝑊)) → ((0_g‘(Scalar‘𝑊)) · 𝑌) = (0_g‘𝑊))
34	23, 27, 33	syl2anc 584	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ((0_g‘(Scalar‘𝑊)) · 𝑌) = (0_g‘𝑊))
35	20, 34	eqtrd 2772	. . . . . . . . . . . . 13 ⊢ (𝜑 → ( 0 · 𝑌) = (0_g‘𝑊))
36	15, 35	neeqtrrd 3015	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑋 ≠ ( 0 · 𝑌))
37	36	ad2antrr 724	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) → 𝑋 ≠ ( 0 · 𝑌))
38		oveq1 7412	. . . . . . . . . . . 12 ⊢ (𝑚 = 0 → (𝑚 · 𝑌) = ( 0 · 𝑌))
39	38	neeq2d 3001	. . . . . . . . . . 11 ⊢ (𝑚 = 0 → (𝑋 ≠ (𝑚 · 𝑌) ↔ 𝑋 ≠ ( 0 · 𝑌)))
40	37, 39	syl5ibrcom 246	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) → (𝑚 = 0 → 𝑋 ≠ (𝑚 · 𝑌)))
41	40	necon2d 2963	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) → (𝑋 = (𝑚 · 𝑌) → 𝑚 ≠ 0 ))
42	41	ancrd 552	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) → (𝑋 = (𝑚 · 𝑌) → (𝑚 ≠ 0 ∧ 𝑋 = (𝑚 · 𝑌))))
43		prjspner01.s	. . . . . . . . . . . . . . 15 ⊢ 𝑆 = (Base‘𝐾)
44		ovexd 7440	. . . . . . . . . . . . . . 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 2732	. . . . . . . . . . . . . . 15 ⊢ (._r‘𝐾) = (._r‘𝐾)
49	5, 28, 43, 44, 45, 46, 47, 30, 48	frlmvscaval 21314	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → ((𝑚 · 𝑌)‘0) = (𝑚(._r‘𝐾)(𝑌‘0)))
50	49	fveq2d 6892	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → (𝐼‘((𝑚 · 𝑌)‘0)) = (𝐼‘(𝑚(._r‘𝐾)(𝑌‘0))))
51		prjspner01.i	. . . . . . . . . . . . . 14 ⊢ 𝐼 = (inv_r‘𝐾)
52	7	ad3antrrr 728	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → 𝐾 ∈ DivRing)
53	5, 43, 28	frlmbasf 21306	. . . . . . . . . . . . . . . . 17 ⊢ (((0...𝑁) ∈ V ∧ 𝑌 ∈ (Base‘𝑊)) → 𝑌:(0...𝑁)⟶𝑆)
54	9, 27, 53	syl2anc 584	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝑌:(0...𝑁)⟶𝑆)
55	54, 12	ffvelcdmd 7084	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝑌‘0) ∈ 𝑆)
56	55	ad3antrrr 728	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → (𝑌‘0) ∈ 𝑆)
57		simpr 485	. . . . . . . . . . . . . 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 41098	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → (𝐼‘(𝑚(._r‘𝐾)(𝑌‘0))) = ((𝐼‘(𝑌‘0))(._r‘𝐾)(𝐼‘𝑚)))
61	50, 60	eqtrd 2772	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → (𝐼‘((𝑚 · 𝑌)‘0)) = ((𝐼‘(𝑌‘0))(._r‘𝐾)(𝐼‘𝑚)))
62	61	oveq1d 7420	. . . . . . . . . . 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 20331	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → (𝐼‘(𝑌‘0)) ∈ 𝑆)
66	43, 6, 51, 52, 45, 57	drnginvrcld 20331	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → (𝐼‘𝑚) ∈ 𝑆)
67	43, 48, 64, 65, 66	ringcld 20073	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → ((𝐼‘(𝑌‘0))(._r‘𝐾)(𝐼‘𝑚)) ∈ 𝑆)
68	17	fveq2d 6892	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (Base‘𝐾) = (Base‘(Scalar‘𝑊)))
69	43, 68	eqtrid 2784	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑆 = (Base‘(Scalar‘𝑊)))
70	69	ad3antrrr 728	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → 𝑆 = (Base‘(Scalar‘𝑊)))
71	67, 70	eleqtrd 2835	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → ((𝐼‘(𝑌‘0))(._r‘𝐾)(𝐼‘𝑚)) ∈ (Base‘(Scalar‘𝑊)))
72	45, 70	eleqtrd 2835	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → 𝑚 ∈ (Base‘(Scalar‘𝑊)))
73		eqid 2732	. . . . . . . . . . . . 13 ⊢ (Base‘(Scalar‘𝑊)) = (Base‘(Scalar‘𝑊))
74		eqid 2732	. . . . . . . . . . . . 13 ⊢ (._r‘(Scalar‘𝑊)) = (._r‘(Scalar‘𝑊))
75	28, 29, 30, 73, 74	lmodvsass 20489	. . . . . . . . . . . 12 ⊢ ((𝑊 ∈ LMod ∧ (((𝐼‘(𝑌‘0))(._r‘𝐾)(𝐼‘𝑚)) ∈ (Base‘(Scalar‘𝑊)) ∧ 𝑚 ∈ (Base‘(Scalar‘𝑊)) ∧ 𝑌 ∈ (Base‘𝑊))) → ((((𝐼‘(𝑌‘0))(._r‘𝐾)(𝐼‘𝑚))(._r‘(Scalar‘𝑊))𝑚) · 𝑌) = (((𝐼‘(𝑌‘0))(._r‘𝐾)(𝐼‘𝑚)) · (𝑚 · 𝑌)))
76	63, 71, 72, 46, 75	syl13anc 1372	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → ((((𝐼‘(𝑌‘0))(._r‘𝐾)(𝐼‘𝑚))(._r‘(Scalar‘𝑊))𝑚) · 𝑌) = (((𝐼‘(𝑌‘0))(._r‘𝐾)(𝐼‘𝑚)) · (𝑚 · 𝑌)))
77	43, 48, 64, 65, 66, 45	ringassd 20072	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → (((𝐼‘(𝑌‘0))(._r‘𝐾)(𝐼‘𝑚))(._r‘𝐾)𝑚) = ((𝐼‘(𝑌‘0))(._r‘𝐾)((𝐼‘𝑚)(._r‘𝐾)𝑚)))
78	52, 44, 16	syl2anc 584	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → 𝐾 = (Scalar‘𝑊))
79	78	fveq2d 6892	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → (._r‘𝐾) = (._r‘(Scalar‘𝑊)))
80	79	oveqd 7422	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → (((𝐼‘(𝑌‘0))(._r‘𝐾)(𝐼‘𝑚))(._r‘𝐾)𝑚) = (((𝐼‘(𝑌‘0))(._r‘𝐾)(𝐼‘𝑚))(._r‘(Scalar‘𝑊))𝑚))
81		eqid 2732	. . . . . . . . . . . . . . . 16 ⊢ (1_r‘𝐾) = (1_r‘𝐾)
82	43, 6, 48, 81, 51, 52, 45, 57	drnginvrld 20334	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → ((𝐼‘𝑚)(._r‘𝐾)𝑚) = (1_r‘𝐾))
83	82	oveq2d 7421	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → ((𝐼‘(𝑌‘0))(._r‘𝐾)((𝐼‘𝑚)(._r‘𝐾)𝑚)) = ((𝐼‘(𝑌‘0))(._r‘𝐾)(1_r‘𝐾)))
84	43, 48, 81, 64, 65	ringridmd 20083	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → ((𝐼‘(𝑌‘0))(._r‘𝐾)(1_r‘𝐾)) = (𝐼‘(𝑌‘0)))
85	83, 84	eqtrd 2772	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → ((𝐼‘(𝑌‘0))(._r‘𝐾)((𝐼‘𝑚)(._r‘𝐾)𝑚)) = (𝐼‘(𝑌‘0)))
86	77, 80, 85	3eqtr3d 2780	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → (((𝐼‘(𝑌‘0))(._r‘𝐾)(𝐼‘𝑚))(._r‘(Scalar‘𝑊))𝑚) = (𝐼‘(𝑌‘0)))
87	86	oveq1d 7420	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → ((((𝐼‘(𝑌‘0))(._r‘𝐾)(𝐼‘𝑚))(._r‘(Scalar‘𝑊))𝑚) · 𝑌) = ((𝐼‘(𝑌‘0)) · 𝑌))
88	62, 76, 87	3eqtr2d 2778	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → ((𝐼‘((𝑚 · 𝑌)‘0)) · (𝑚 · 𝑌)) = ((𝐼‘(𝑌‘0)) · 𝑌))
89		fveq1 6887	. . . . . . . . . . . . 13 ⊢ (𝑋 = (𝑚 · 𝑌) → (𝑋‘0) = ((𝑚 · 𝑌)‘0))
90	89	fveq2d 6892	. . . . . . . . . . . 12 ⊢ (𝑋 = (𝑚 · 𝑌) → (𝐼‘(𝑋‘0)) = (𝐼‘((𝑚 · 𝑌)‘0)))
91		id 22	. . . . . . . . . . . 12 ⊢ (𝑋 = (𝑚 · 𝑌) → 𝑋 = (𝑚 · 𝑌))
92	90, 91	oveq12d 7423	. . . . . . . . . . 11 ⊢ (𝑋 = (𝑚 · 𝑌) → ((𝐼‘(𝑋‘0)) · 𝑋) = ((𝐼‘((𝑚 · 𝑌)‘0)) · (𝑚 · 𝑌)))
93	92	eqeq1d 2734	. . . . . . . . . 10 ⊢ (𝑋 = (𝑚 · 𝑌) → (((𝐼‘(𝑋‘0)) · 𝑋) = ((𝐼‘(𝑌‘0)) · 𝑌) ↔ ((𝐼‘((𝑚 · 𝑌)‘0)) · (𝑚 · 𝑌)) = ((𝐼‘(𝑌‘0)) · 𝑌)))
94	88, 93	syl5ibrcom 246	. . . . . . . . 9 ⊢ ((((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) ∧ 𝑚 ≠ 0 ) → (𝑋 = (𝑚 · 𝑌) → ((𝐼‘(𝑋‘0)) · 𝑋) = ((𝐼‘(𝑌‘0)) · 𝑌)))
95	94	expimpd 454	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) → ((𝑚 ≠ 0 ∧ 𝑋 = (𝑚 · 𝑌)) → ((𝐼‘(𝑋‘0)) · 𝑋) = ((𝐼‘(𝑌‘0)) · 𝑌)))
96	42, 95	syld 47	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ 𝑚 ∈ 𝑆) → (𝑋 = (𝑚 · 𝑌) → ((𝐼‘(𝑋‘0)) · 𝑋) = ((𝐼‘(𝑌‘0)) · 𝑌)))
97	96	rexlimdva 3155	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (∃𝑚 ∈ 𝑆 𝑋 = (𝑚 · 𝑌) → ((𝐼‘(𝑋‘0)) · 𝑋) = ((𝐼‘(𝑌‘0)) · 𝑌)))
98	97	impr 455	. . . . 5 ⊢ ((𝜑 ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ∃𝑚 ∈ 𝑆 𝑋 = (𝑚 · 𝑌))) → ((𝐼‘(𝑋‘0)) · 𝑋) = ((𝐼‘(𝑌‘0)) · 𝑌))
99	3	neneqd 2945	. . . . . . 7 ⊢ (𝜑 → ¬ (𝑋‘0) = 0 )
100	99	iffalsed 4538	. . . . . 6 ⊢ (𝜑 → if((𝑋‘0) = 0 , 𝑋, ((𝐼‘(𝑋‘0)) · 𝑋)) = ((𝐼‘(𝑋‘0)) · 𝑋))
101	100	adantr 481	. . . . 5 ⊢ ((𝜑 ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ∃𝑚 ∈ 𝑆 𝑋 = (𝑚 · 𝑌))) → if((𝑋‘0) = 0 , 𝑋, ((𝐼‘(𝑋‘0)) · 𝑋)) = ((𝐼‘(𝑋‘0)) · 𝑋))
102	58	neneqd 2945	. . . . . . 7 ⊢ (𝜑 → ¬ (𝑌‘0) = 0 )
103	102	iffalsed 4538	. . . . . 6 ⊢ (𝜑 → if((𝑌‘0) = 0 , 𝑌, ((𝐼‘(𝑌‘0)) · 𝑌)) = ((𝐼‘(𝑌‘0)) · 𝑌))
104	103	adantr 481	. . . . 5 ⊢ ((𝜑 ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ∃𝑚 ∈ 𝑆 𝑋 = (𝑚 · 𝑌))) → if((𝑌‘0) = 0 , 𝑌, ((𝐼‘(𝑌‘0)) · 𝑌)) = ((𝐼‘(𝑌‘0)) · 𝑌))
105	98, 101, 104	3eqtr4d 2782	. . . 4 ⊢ ((𝜑 ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ∃𝑚 ∈ 𝑆 𝑋 = (𝑚 · 𝑌))) → if((𝑋‘0) = 0 , 𝑋, ((𝐼‘(𝑋‘0)) · 𝑋)) = if((𝑌‘0) = 0 , 𝑌, ((𝐼‘(𝑌‘0)) · 𝑌)))
106		prjspner01.f	. . . . 5 ⊢ 𝐹 = (𝑏 ∈ 𝐵 ↦ if((𝑏‘0) = 0 , 𝑏, ((𝐼‘(𝑏‘0)) · 𝑏)))
107		fveq1 6887	. . . . . . 7 ⊢ (𝑏 = 𝑋 → (𝑏‘0) = (𝑋‘0))
108	107	eqeq1d 2734	. . . . . 6 ⊢ (𝑏 = 𝑋 → ((𝑏‘0) = 0 ↔ (𝑋‘0) = 0 ))
109		id 22	. . . . . 6 ⊢ (𝑏 = 𝑋 → 𝑏 = 𝑋)
110	107	fveq2d 6892	. . . . . . 7 ⊢ (𝑏 = 𝑋 → (𝐼‘(𝑏‘0)) = (𝐼‘(𝑋‘0)))
111	110, 109	oveq12d 7423	. . . . . 6 ⊢ (𝑏 = 𝑋 → ((𝐼‘(𝑏‘0)) · 𝑏) = ((𝐼‘(𝑋‘0)) · 𝑋))
112	108, 109, 111	ifbieq12d 4555	. . . . 5 ⊢ (𝑏 = 𝑋 → if((𝑏‘0) = 0 , 𝑏, ((𝐼‘(𝑏‘0)) · 𝑏)) = if((𝑋‘0) = 0 , 𝑋, ((𝐼‘(𝑋‘0)) · 𝑋)))
113		simprll 777	. . . . 5 ⊢ ((𝜑 ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ∃𝑚 ∈ 𝑆 𝑋 = (𝑚 · 𝑌))) → 𝑋 ∈ 𝐵)
114		ovexd 7440	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ∃𝑚 ∈ 𝑆 𝑋 = (𝑚 · 𝑌))) → ((𝐼‘(𝑋‘0)) · 𝑋) ∈ V)
115	113, 114	ifexd 4575	. . . . 5 ⊢ ((𝜑 ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ∃𝑚 ∈ 𝑆 𝑋 = (𝑚 · 𝑌))) → if((𝑋‘0) = 0 , 𝑋, ((𝐼‘(𝑋‘0)) · 𝑋)) ∈ V)
116	106, 112, 113, 115	fvmptd3 7018	. . . 4 ⊢ ((𝜑 ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ∃𝑚 ∈ 𝑆 𝑋 = (𝑚 · 𝑌))) → (𝐹‘𝑋) = if((𝑋‘0) = 0 , 𝑋, ((𝐼‘(𝑋‘0)) · 𝑋)))
117		fveq1 6887	. . . . . . 7 ⊢ (𝑏 = 𝑌 → (𝑏‘0) = (𝑌‘0))
118	117	eqeq1d 2734	. . . . . 6 ⊢ (𝑏 = 𝑌 → ((𝑏‘0) = 0 ↔ (𝑌‘0) = 0 ))
119		id 22	. . . . . 6 ⊢ (𝑏 = 𝑌 → 𝑏 = 𝑌)
120	117	fveq2d 6892	. . . . . . 7 ⊢ (𝑏 = 𝑌 → (𝐼‘(𝑏‘0)) = (𝐼‘(𝑌‘0)))
121	120, 119	oveq12d 7423	. . . . . 6 ⊢ (𝑏 = 𝑌 → ((𝐼‘(𝑏‘0)) · 𝑏) = ((𝐼‘(𝑌‘0)) · 𝑌))
122	118, 119, 121	ifbieq12d 4555	. . . . 5 ⊢ (𝑏 = 𝑌 → if((𝑏‘0) = 0 , 𝑏, ((𝐼‘(𝑏‘0)) · 𝑏)) = if((𝑌‘0) = 0 , 𝑌, ((𝐼‘(𝑌‘0)) · 𝑌)))
123		simprlr 778	. . . . 5 ⊢ ((𝜑 ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ∃𝑚 ∈ 𝑆 𝑋 = (𝑚 · 𝑌))) → 𝑌 ∈ 𝐵)
124		ovexd 7440	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ∃𝑚 ∈ 𝑆 𝑋 = (𝑚 · 𝑌))) → ((𝐼‘(𝑌‘0)) · 𝑌) ∈ V)
125	123, 124	ifexd 4575	. . . . 5 ⊢ ((𝜑 ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ∃𝑚 ∈ 𝑆 𝑋 = (𝑚 · 𝑌))) → if((𝑌‘0) = 0 , 𝑌, ((𝐼‘(𝑌‘0)) · 𝑌)) ∈ V)
126	106, 122, 123, 125	fvmptd3 7018	. . . 4 ⊢ ((𝜑 ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ∃𝑚 ∈ 𝑆 𝑋 = (𝑚 · 𝑌))) → (𝐹‘𝑌) = if((𝑌‘0) = 0 , 𝑌, ((𝐼‘(𝑌‘0)) · 𝑌)))
127	105, 116, 126	3eqtr4d 2782	. . 3 ⊢ ((𝜑 ∧ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ∃𝑚 ∈ 𝑆 𝑋 = (𝑚 · 𝑌))) → (𝐹‘𝑋) = (𝐹‘𝑌))
128	2, 127	sylan2b 594	. 2 ⊢ ((𝜑 ∧ 𝑋 ∼ 𝑌) → (𝐹‘𝑋) = (𝐹‘𝑌))
129	1, 5, 25, 43, 30, 7	prjspner 41357	. . . 4 ⊢ (𝜑 → ∼ Er 𝐵)
130	129	adantr 481	. . 3 ⊢ ((𝜑 ∧ (𝐹‘𝑋) = (𝐹‘𝑌)) → ∼ Er 𝐵)
131		prjspner01.x	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
132	1, 106, 25, 5, 30, 43, 6, 51, 7, 10, 131	prjspner01 41363	. . . 4 ⊢ (𝜑 → 𝑋 ∼ (𝐹‘𝑋))
133	132	adantr 481	. . 3 ⊢ ((𝜑 ∧ (𝐹‘𝑋) = (𝐹‘𝑌)) → 𝑋 ∼ (𝐹‘𝑋))
134	129, 132	ercl2 8712	. . . . . . 7 ⊢ (𝜑 → (𝐹‘𝑋) ∈ 𝐵)
135	134	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ (𝐹‘𝑋) = (𝐹‘𝑌)) → (𝐹‘𝑋) ∈ 𝐵)
136	130, 135	erref 8719	. . . . 5 ⊢ ((𝜑 ∧ (𝐹‘𝑋) = (𝐹‘𝑌)) → (𝐹‘𝑋) ∼ (𝐹‘𝑋))
137		breq2 5151	. . . . . 6 ⊢ ((𝐹‘𝑋) = (𝐹‘𝑌) → ((𝐹‘𝑋) ∼ (𝐹‘𝑋) ↔ (𝐹‘𝑋) ∼ (𝐹‘𝑌)))
138	137	adantl 482	. . . . 5 ⊢ ((𝜑 ∧ (𝐹‘𝑋) = (𝐹‘𝑌)) → ((𝐹‘𝑋) ∼ (𝐹‘𝑋) ↔ (𝐹‘𝑋) ∼ (𝐹‘𝑌)))
139	136, 138	mpbid 231	. . . 4 ⊢ ((𝜑 ∧ (𝐹‘𝑋) = (𝐹‘𝑌)) → (𝐹‘𝑋) ∼ (𝐹‘𝑌))
140	1, 106, 25, 5, 30, 43, 6, 51, 7, 10, 24	prjspner01 41363	. . . . 5 ⊢ (𝜑 → 𝑌 ∼ (𝐹‘𝑌))
141	140	adantr 481	. . . 4 ⊢ ((𝜑 ∧ (𝐹‘𝑋) = (𝐹‘𝑌)) → 𝑌 ∼ (𝐹‘𝑌))
142	130, 139, 141	ertr4d 8718	. . 3 ⊢ ((𝜑 ∧ (𝐹‘𝑋) = (𝐹‘𝑌)) → (𝐹‘𝑋) ∼ 𝑌)
143	130, 133, 142	ertrd 8715	. 2 ⊢ ((𝜑 ∧ (𝐹‘𝑋) = (𝐹‘𝑌)) → 𝑋 ∼ 𝑌)
144	128, 143	impbida 799	1 ⊢ (𝜑 → (𝑋 ∼ 𝑌 ↔ (𝐹‘𝑋) = (𝐹‘𝑌)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ≠ wne 2940 ∃wrex 3070 Vcvv 3474 ∖ cdif 3944 ifcif 4527 {csn 4627 class class class wbr 5147 {copab 5209 ↦ cmpt 5230 ⟶wf 6536 ‘cfv 6540 (class class class)co 7405 Er wer 8696 0cc0 11106 ℕ₀cn0 12468 ...cfz 13480 Basecbs 17140 ._rcmulr 17194 Scalarcsca 17196 ·_𝑠 cvsca 17197 0_gc0g 17381 1_rcur 19998 Ringcrg 20049 inv_rcinvr 20193 DivRingcdr 20307 LModclmod 20463 LVecclvec 20705 freeLMod cfrlm 21292

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-ifp 1062 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-uni 4908 df-iun 4998 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-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-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-tpos 8207 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-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-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-prds 17389 df-pws 17391 df-mgm 18557 df-sgrp 18606 df-mnd 18622 df-grp 18818 df-minusg 18819 df-sbg 18820 df-subg 18997 df-mgp 19982 df-ur 19999 df-ring 20051 df-oppr 20142 df-dvdsr 20163 df-unit 20164 df-invr 20194 df-drng 20309 df-subrg 20353 df-lmod 20465 df-lss 20535 df-lvec 20706 df-sra 20777 df-rgmod 20778 df-dsmm 21278 df-frlm 21293

This theorem is referenced by: (None)

W3C validator