nmlno0lem - Metamath Proof Explorer

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

Theorem nmlno0lem 30821

Description: Lemma for nmlno0i 30822. (Contributed by NM, 28-Nov-2007.) (New usage is discouraged.)

**Hypotheses**
Ref	Expression
nmlno0.3	⊢ 𝑁 = (𝑈 normOp_OLD 𝑊)
nmlno0.0	⊢ 𝑍 = (𝑈 0_op 𝑊)
nmlno0.7	⊢ 𝐿 = (𝑈 LnOp 𝑊)
nmlno0lem.u	⊢ 𝑈 ∈ NrmCVec
nmlno0lem.w	⊢ 𝑊 ∈ NrmCVec
nmlno0lem.l	⊢ 𝑇 ∈ 𝐿
nmlno0lem.1	⊢ 𝑋 = (BaseSet‘𝑈)
nmlno0lem.2	⊢ 𝑌 = (BaseSet‘𝑊)
nmlno0lem.r	⊢ 𝑅 = ( ·_𝑠OLD ‘𝑈)
nmlno0lem.s	⊢ 𝑆 = ( ·_𝑠OLD ‘𝑊)
nmlno0lem.p	⊢ 𝑃 = (0_vec‘𝑈)
nmlno0lem.q	⊢ 𝑄 = (0_vec‘𝑊)
nmlno0lem.k	⊢ 𝐾 = (norm_CV‘𝑈)
nmlno0lem.m	⊢ 𝑀 = (norm_CV‘𝑊)

**Assertion**
Ref	Expression
nmlno0lem	⊢ ((𝑁‘𝑇) = 0 ↔ 𝑇 = 𝑍)

Proof of Theorem nmlno0lem Dummy variables 𝑦 𝑧 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		nmlno0lem.u	. . . . . . . . . . . . . . 15 ⊢ 𝑈 ∈ NrmCVec
2		nmlno0lem.1	. . . . . . . . . . . . . . . 16 ⊢ 𝑋 = (BaseSet‘𝑈)
3		nmlno0lem.k	. . . . . . . . . . . . . . . 16 ⊢ 𝐾 = (norm_CV‘𝑈)
4	2, 3	nvcl 30689	. . . . . . . . . . . . . . 15 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ 𝑋) → (𝐾‘𝑥) ∈ ℝ)
5	1, 4	mpan 690	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ 𝑋 → (𝐾‘𝑥) ∈ ℝ)
6	5	recnd 11286	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ 𝑋 → (𝐾‘𝑥) ∈ ℂ)
7	6	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝐾‘𝑥) ∈ ℂ)
8		nmlno0lem.p	. . . . . . . . . . . . . . . . 17 ⊢ 𝑃 = (0_vec‘𝑈)
9	2, 8, 3	nvz 30697	. . . . . . . . . . . . . . . 16 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ 𝑋) → ((𝐾‘𝑥) = 0 ↔ 𝑥 = 𝑃))
10	1, 9	mpan 690	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ 𝑋 → ((𝐾‘𝑥) = 0 ↔ 𝑥 = 𝑃))
11		fveq2 6906	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑃 → (𝑇‘𝑥) = (𝑇‘𝑃))
12		nmlno0lem.w	. . . . . . . . . . . . . . . . 17 ⊢ 𝑊 ∈ NrmCVec
13		nmlno0lem.l	. . . . . . . . . . . . . . . . 17 ⊢ 𝑇 ∈ 𝐿
14		nmlno0lem.2	. . . . . . . . . . . . . . . . . 18 ⊢ 𝑌 = (BaseSet‘𝑊)
15		nmlno0lem.q	. . . . . . . . . . . . . . . . . 18 ⊢ 𝑄 = (0_vec‘𝑊)
16		nmlno0.7	. . . . . . . . . . . . . . . . . 18 ⊢ 𝐿 = (𝑈 LnOp 𝑊)
17	2, 14, 8, 15, 16	lno0 30784	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → (𝑇‘𝑃) = 𝑄)
18	1, 12, 13, 17	mp3an 1460	. . . . . . . . . . . . . . . 16 ⊢ (𝑇‘𝑃) = 𝑄
19	11, 18	eqtrdi 2790	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑃 → (𝑇‘𝑥) = 𝑄)
20	10, 19	biimtrdi 253	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ 𝑋 → ((𝐾‘𝑥) = 0 → (𝑇‘𝑥) = 𝑄))
21	20	necon3d 2958	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ 𝑋 → ((𝑇‘𝑥) ≠ 𝑄 → (𝐾‘𝑥) ≠ 0))
22	21	imp 406	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝐾‘𝑥) ≠ 0)
23	7, 22	recne0d 12034	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (1 / (𝐾‘𝑥)) ≠ 0)
24		simpr 484	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑇‘𝑥) ≠ 𝑄)
25	7, 22	reccld 12033	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (1 / (𝐾‘𝑥)) ∈ ℂ)
26	2, 14, 16	lnof 30783	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → 𝑇:𝑋⟶𝑌)
27	1, 12, 13, 26	mp3an 1460	. . . . . . . . . . . . . . . 16 ⊢ 𝑇:𝑋⟶𝑌
28	27	ffvelcdmi 7102	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ 𝑋 → (𝑇‘𝑥) ∈ 𝑌)
29	28	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑇‘𝑥) ∈ 𝑌)
30		nmlno0lem.s	. . . . . . . . . . . . . . . 16 ⊢ 𝑆 = ( ·_𝑠OLD ‘𝑊)
31	14, 30, 15	nvmul0or 30678	. . . . . . . . . . . . . . 15 ⊢ ((𝑊 ∈ NrmCVec ∧ (1 / (𝐾‘𝑥)) ∈ ℂ ∧ (𝑇‘𝑥) ∈ 𝑌) → (((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) = 𝑄 ↔ ((1 / (𝐾‘𝑥)) = 0 ∨ (𝑇‘𝑥) = 𝑄)))
32	12, 31	mp3an1 1447	. . . . . . . . . . . . . 14 ⊢ (((1 / (𝐾‘𝑥)) ∈ ℂ ∧ (𝑇‘𝑥) ∈ 𝑌) → (((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) = 𝑄 ↔ ((1 / (𝐾‘𝑥)) = 0 ∨ (𝑇‘𝑥) = 𝑄)))
33	25, 29, 32	syl2anc 584	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) = 𝑄 ↔ ((1 / (𝐾‘𝑥)) = 0 ∨ (𝑇‘𝑥) = 𝑄)))
34	33	necon3abid 2974	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ≠ 𝑄 ↔ ¬ ((1 / (𝐾‘𝑥)) = 0 ∨ (𝑇‘𝑥) = 𝑄)))
35		neanior 3032	. . . . . . . . . . . 12 ⊢ (((1 / (𝐾‘𝑥)) ≠ 0 ∧ (𝑇‘𝑥) ≠ 𝑄) ↔ ¬ ((1 / (𝐾‘𝑥)) = 0 ∨ (𝑇‘𝑥) = 𝑄))
36	34, 35	bitr4di 289	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ≠ 𝑄 ↔ ((1 / (𝐾‘𝑥)) ≠ 0 ∧ (𝑇‘𝑥) ≠ 𝑄)))
37	23, 24, 36	mpbir2and 713	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ≠ 𝑄)
38	14, 30	nvscl 30654	. . . . . . . . . . . . 13 ⊢ ((𝑊 ∈ NrmCVec ∧ (1 / (𝐾‘𝑥)) ∈ ℂ ∧ (𝑇‘𝑥) ∈ 𝑌) → ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ∈ 𝑌)
39	12, 38	mp3an1 1447	. . . . . . . . . . . 12 ⊢ (((1 / (𝐾‘𝑥)) ∈ ℂ ∧ (𝑇‘𝑥) ∈ 𝑌) → ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ∈ 𝑌)
40	25, 29, 39	syl2anc 584	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ∈ 𝑌)
41		nmlno0lem.m	. . . . . . . . . . . 12 ⊢ 𝑀 = (norm_CV‘𝑊)
42	14, 15, 41	nvgt0 30702	. . . . . . . . . . 11 ⊢ ((𝑊 ∈ NrmCVec ∧ ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ∈ 𝑌) → (((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ≠ 𝑄 ↔ 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))))
43	12, 40, 42	sylancr 587	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ≠ 𝑄 ↔ 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))))
44	37, 43	mpbid 232	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))))
45	44	ex 412	. . . . . . . 8 ⊢ (𝑥 ∈ 𝑋 → ((𝑇‘𝑥) ≠ 𝑄 → 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))))
46	45	adantl 481	. . . . . . 7 ⊢ (((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) → ((𝑇‘𝑥) ≠ 𝑄 → 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))))
47	14, 41	nmosetre 30792	. . . . . . . . . . . . . 14 ⊢ ((𝑊 ∈ NrmCVec ∧ 𝑇:𝑋⟶𝑌) → {𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))} ⊆ ℝ)
48	12, 27, 47	mp2an 692	. . . . . . . . . . . . 13 ⊢ {𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))} ⊆ ℝ
49		ressxr 11302	. . . . . . . . . . . . 13 ⊢ ℝ ⊆ ℝ^*
50	48, 49	sstri 4004	. . . . . . . . . . . 12 ⊢ {𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))} ⊆ ℝ^*
51		simpl 482	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → 𝑥 ∈ 𝑋)
52		nmlno0lem.r	. . . . . . . . . . . . . . . . 17 ⊢ 𝑅 = ( ·_𝑠OLD ‘𝑈)
53	2, 52	nvscl 30654	. . . . . . . . . . . . . . . 16 ⊢ ((𝑈 ∈ NrmCVec ∧ (1 / (𝐾‘𝑥)) ∈ ℂ ∧ 𝑥 ∈ 𝑋) → ((1 / (𝐾‘𝑥))𝑅𝑥) ∈ 𝑋)
54	1, 53	mp3an1 1447	. . . . . . . . . . . . . . 15 ⊢ (((1 / (𝐾‘𝑥)) ∈ ℂ ∧ 𝑥 ∈ 𝑋) → ((1 / (𝐾‘𝑥))𝑅𝑥) ∈ 𝑋)
55	25, 51, 54	syl2anc 584	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → ((1 / (𝐾‘𝑥))𝑅𝑥) ∈ 𝑋)
56	19	necon3i 2970	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑇‘𝑥) ≠ 𝑄 → 𝑥 ≠ 𝑃)
57	2, 52, 8, 3	nv1 30703	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ 𝑋 ∧ 𝑥 ≠ 𝑃) → (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) = 1)
58	1, 57	mp3an1 1447	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ∈ 𝑋 ∧ 𝑥 ≠ 𝑃) → (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) = 1)
59	56, 58	sylan2 593	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) = 1)
60		1re 11258	. . . . . . . . . . . . . . . 16 ⊢ 1 ∈ ℝ
61	59, 60	eqeltrdi 2846	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) ∈ ℝ)
62		eqle 11360	. . . . . . . . . . . . . . 15 ⊢ (((𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) ∈ ℝ ∧ (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) = 1) → (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) ≤ 1)
63	61, 59, 62	syl2anc 584	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) ≤ 1)
64	1, 12, 13	3pm3.2i 1338	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿)
65	2, 52, 30, 16	lnomul 30788	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ ((1 / (𝐾‘𝑥)) ∈ ℂ ∧ 𝑥 ∈ 𝑋)) → (𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥)) = ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))
66	64, 65	mpan 690	. . . . . . . . . . . . . . . . 17 ⊢ (((1 / (𝐾‘𝑥)) ∈ ℂ ∧ 𝑥 ∈ 𝑋) → (𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥)) = ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))
67	25, 51, 66	syl2anc 584	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥)) = ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))
68	67	eqcomd 2740	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) = (𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥)))
69	68	fveq2d 6910	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥))))
70		fveq2 6906	. . . . . . . . . . . . . . . . 17 ⊢ (𝑧 = ((1 / (𝐾‘𝑥))𝑅𝑥) → (𝐾‘𝑧) = (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)))
71	70	breq1d 5157	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 = ((1 / (𝐾‘𝑥))𝑅𝑥) → ((𝐾‘𝑧) ≤ 1 ↔ (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) ≤ 1))
72		2fveq3 6911	. . . . . . . . . . . . . . . . 17 ⊢ (𝑧 = ((1 / (𝐾‘𝑥))𝑅𝑥) → (𝑀‘(𝑇‘𝑧)) = (𝑀‘(𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥))))
73	72	eqeq2d 2745	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 = ((1 / (𝐾‘𝑥))𝑅𝑥) → ((𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘𝑧)) ↔ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥)))))
74	71, 73	anbi12d 632	. . . . . . . . . . . . . . 15 ⊢ (𝑧 = ((1 / (𝐾‘𝑥))𝑅𝑥) → (((𝐾‘𝑧) ≤ 1 ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘𝑧))) ↔ ((𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) ≤ 1 ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥))))))
75	74	rspcev 3621	. . . . . . . . . . . . . 14 ⊢ ((((1 / (𝐾‘𝑥))𝑅𝑥) ∈ 𝑋 ∧ ((𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) ≤ 1 ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥))))) → ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘𝑧))))
76	55, 63, 69, 75	syl12anc 837	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘𝑧))))
77		fvex 6919	. . . . . . . . . . . . . 14 ⊢ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ∈ V
78		eqeq1 2738	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) → (𝑦 = (𝑀‘(𝑇‘𝑧)) ↔ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘𝑧))))
79	78	anbi2d 630	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) → (((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧))) ↔ ((𝐾‘𝑧) ≤ 1 ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘𝑧)))))
80	79	rexbidv 3176	. . . . . . . . . . . . . 14 ⊢ (𝑦 = (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) → (∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧))) ↔ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘𝑧)))))
81	77, 80	elab 3680	. . . . . . . . . . . . 13 ⊢ ((𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ∈ {𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))} ↔ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘𝑧))))
82	76, 81	sylibr 234	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ∈ {𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))})
83		supxrub 13362	. . . . . . . . . . . 12 ⊢ (({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))} ⊆ ℝ^* ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ∈ {𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}) → (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ≤ sup({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}, ℝ^*, < ))
84	50, 82, 83	sylancr 587	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ≤ sup({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}, ℝ^*, < ))
85	84	adantll 714	. . . . . . . . . 10 ⊢ ((((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ≤ sup({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}, ℝ^*, < ))
86		nmlno0.3	. . . . . . . . . . . . . . 15 ⊢ 𝑁 = (𝑈 normOp_OLD 𝑊)
87	2, 14, 3, 41, 86	nmooval 30791	. . . . . . . . . . . . . 14 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:𝑋⟶𝑌) → (𝑁‘𝑇) = sup({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}, ℝ^*, < ))
88	1, 12, 27, 87	mp3an 1460	. . . . . . . . . . . . 13 ⊢ (𝑁‘𝑇) = sup({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}, ℝ^*, < )
89	88	eqeq1i 2739	. . . . . . . . . . . 12 ⊢ ((𝑁‘𝑇) = 0 ↔ sup({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}, ℝ^*, < ) = 0)
90	89	biimpi 216	. . . . . . . . . . 11 ⊢ ((𝑁‘𝑇) = 0 → sup({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}, ℝ^*, < ) = 0)
91	90	ad2antrr 726	. . . . . . . . . 10 ⊢ ((((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) ∧ (𝑇‘𝑥) ≠ 𝑄) → sup({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}, ℝ^*, < ) = 0)
92	85, 91	breqtrd 5173	. . . . . . . . 9 ⊢ ((((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ≤ 0)
93	14, 41	nvcl 30689	. . . . . . . . . . . 12 ⊢ ((𝑊 ∈ NrmCVec ∧ ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ∈ 𝑌) → (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ∈ ℝ)
94	12, 40, 93	sylancr 587	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ∈ ℝ)
95		0re 11260	. . . . . . . . . . 11 ⊢ 0 ∈ ℝ
96		lenlt 11336	. . . . . . . . . . 11 ⊢ (((𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ∈ ℝ ∧ 0 ∈ ℝ) → ((𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ≤ 0 ↔ ¬ 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))))
97	94, 95, 96	sylancl 586	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → ((𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ≤ 0 ↔ ¬ 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))))
98	97	adantll 714	. . . . . . . . 9 ⊢ ((((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) ∧ (𝑇‘𝑥) ≠ 𝑄) → ((𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ≤ 0 ↔ ¬ 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))))
99	92, 98	mpbid 232	. . . . . . . 8 ⊢ ((((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) ∧ (𝑇‘𝑥) ≠ 𝑄) → ¬ 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))))
100	99	ex 412	. . . . . . 7 ⊢ (((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) → ((𝑇‘𝑥) ≠ 𝑄 → ¬ 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))))
101	46, 100	pm2.65d 196	. . . . . 6 ⊢ (((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) → ¬ (𝑇‘𝑥) ≠ 𝑄)
102		nne 2941	. . . . . 6 ⊢ (¬ (𝑇‘𝑥) ≠ 𝑄 ↔ (𝑇‘𝑥) = 𝑄)
103	101, 102	sylib 218	. . . . 5 ⊢ (((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) → (𝑇‘𝑥) = 𝑄)
104		nmlno0.0	. . . . . . . 8 ⊢ 𝑍 = (𝑈 0_op 𝑊)
105	2, 15, 104	0oval 30816	. . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑥 ∈ 𝑋) → (𝑍‘𝑥) = 𝑄)
106	1, 12, 105	mp3an12 1450	. . . . . 6 ⊢ (𝑥 ∈ 𝑋 → (𝑍‘𝑥) = 𝑄)
107	106	adantl 481	. . . . 5 ⊢ (((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) → (𝑍‘𝑥) = 𝑄)
108	103, 107	eqtr4d 2777	. . . 4 ⊢ (((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) → (𝑇‘𝑥) = (𝑍‘𝑥))
109	108	ralrimiva 3143	. . 3 ⊢ ((𝑁‘𝑇) = 0 → ∀𝑥 ∈ 𝑋 (𝑇‘𝑥) = (𝑍‘𝑥))
110		ffn 6736	. . . . 5 ⊢ (𝑇:𝑋⟶𝑌 → 𝑇 Fn 𝑋)
111	27, 110	ax-mp 5	. . . 4 ⊢ 𝑇 Fn 𝑋
112	2, 14, 104	0oo 30817	. . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → 𝑍:𝑋⟶𝑌)
113	1, 12, 112	mp2an 692	. . . . 5 ⊢ 𝑍:𝑋⟶𝑌
114		ffn 6736	. . . . 5 ⊢ (𝑍:𝑋⟶𝑌 → 𝑍 Fn 𝑋)
115	113, 114	ax-mp 5	. . . 4 ⊢ 𝑍 Fn 𝑋
116		eqfnfv 7050	. . . 4 ⊢ ((𝑇 Fn 𝑋 ∧ 𝑍 Fn 𝑋) → (𝑇 = 𝑍 ↔ ∀𝑥 ∈ 𝑋 (𝑇‘𝑥) = (𝑍‘𝑥)))
117	111, 115, 116	mp2an 692	. . 3 ⊢ (𝑇 = 𝑍 ↔ ∀𝑥 ∈ 𝑋 (𝑇‘𝑥) = (𝑍‘𝑥))
118	109, 117	sylibr 234	. 2 ⊢ ((𝑁‘𝑇) = 0 → 𝑇 = 𝑍)
119		fveq2 6906	. . 3 ⊢ (𝑇 = 𝑍 → (𝑁‘𝑇) = (𝑁‘𝑍))
120	86, 104	nmoo0 30819	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → (𝑁‘𝑍) = 0)
121	1, 12, 120	mp2an 692	. . 3 ⊢ (𝑁‘𝑍) = 0
122	119, 121	eqtrdi 2790	. 2 ⊢ (𝑇 = 𝑍 → (𝑁‘𝑇) = 0)
123	118, 122	impbii 209	1 ⊢ ((𝑁‘𝑇) = 0 ↔ 𝑇 = 𝑍)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 ∧ w3a 1086 = wceq 1536 ∈ wcel 2105 {cab 2711 ≠ wne 2937 ∀wral 3058 ∃wrex 3067 ⊆ wss 3962 class class class wbr 5147 Fn wfn 6557 ⟶wf 6558 ‘cfv 6562 (class class class)co 7430 supcsup 9477 ℂcc 11150 ℝcr 11151 0cc0 11152 1c1 11153 ℝ^*cxr 11291 < clt 11292 ≤ cle 11293 / cdiv 11917 NrmCVeccnv 30612 BaseSetcba 30614 ·_𝑠OLD cns 30615 0_veccn0v 30616 norm_CVcnmcv 30618 LnOp clno 30768 normOp_OLD cnmoo 30769 0_op c0o 30771

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1791 ax-4 1805 ax-5 1907 ax-6 1964 ax-7 2004 ax-8 2107 ax-9 2115 ax-10 2138 ax-11 2154 ax-12 2174 ax-ext 2705 ax-rep 5284 ax-sep 5301 ax-nul 5311 ax-pow 5370 ax-pr 5437 ax-un 7753 ax-cnex 11208 ax-resscn 11209 ax-1cn 11210 ax-icn 11211 ax-addcl 11212 ax-addrcl 11213 ax-mulcl 11214 ax-mulrcl 11215 ax-mulcom 11216 ax-addass 11217 ax-mulass 11218 ax-distr 11219 ax-i2m1 11220 ax-1ne0 11221 ax-1rid 11222 ax-rnegex 11223 ax-rrecex 11224 ax-cnre 11225 ax-pre-lttri 11226 ax-pre-lttrn 11227 ax-pre-ltadd 11228 ax-pre-mulgt0 11229 ax-pre-sup 11230

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1539 df-fal 1549 df-ex 1776 df-nf 1780 df-sb 2062 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2726 df-clel 2813 df-nfc 2889 df-ne 2938 df-nel 3044 df-ral 3059 df-rex 3068 df-rmo 3377 df-reu 3378 df-rab 3433 df-v 3479 df-sbc 3791 df-csb 3908 df-dif 3965 df-un 3967 df-in 3969 df-ss 3979 df-pss 3982 df-nul 4339 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4912 df-iun 4997 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5582 df-eprel 5588 df-po 5596 df-so 5597 df-fr 5640 df-we 5642 df-xp 5694 df-rel 5695 df-cnv 5696 df-co 5697 df-dm 5698 df-rn 5699 df-res 5700 df-ima 5701 df-pred 6322 df-ord 6388 df-on 6389 df-lim 6390 df-suc 6391 df-iota 6515 df-fun 6564 df-fn 6565 df-f 6566 df-f1 6567 df-fo 6568 df-f1o 6569 df-fv 6570 df-riota 7387 df-ov 7433 df-oprab 7434 df-mpo 7435 df-om 7887 df-1st 8012 df-2nd 8013 df-frecs 8304 df-wrecs 8335 df-recs 8409 df-rdg 8448 df-er 8743 df-map 8866 df-en 8984 df-dom 8985 df-sdom 8986 df-sup 9479 df-pnf 11294 df-mnf 11295 df-xr 11296 df-ltxr 11297 df-le 11298 df-sub 11491 df-neg 11492 df-div 11918 df-nn 12264 df-2 12326 df-3 12327 df-n0 12524 df-z 12611 df-uz 12876 df-rp 13032 df-seq 14039 df-exp 14099 df-cj 15134 df-re 15135 df-im 15136 df-sqrt 15270 df-abs 15271 df-grpo 30521 df-gid 30522 df-ginv 30523 df-ablo 30573 df-vc 30587 df-nv 30620 df-va 30623 df-ba 30624 df-sm 30625 df-0v 30626 df-nmcv 30628 df-lno 30772 df-nmoo 30773 df-0o 30775

This theorem is referenced by: nmlno0i 30822

W3C validator