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 31145

Description: Lemma for nmlno0i 31146. (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 31013	. . . . . . . . . . . . . . 15 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ 𝑋) → (𝐾‘𝑥) ∈ ℝ)
5	1, 4	mpan 702	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ 𝑋 → (𝐾‘𝑥) ∈ ℝ)
6	5	recnd 11232	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ 𝑋 → (𝐾‘𝑥) ∈ ℂ)
7	6	adantr 485	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝐾‘𝑥) ∈ ℂ)
8		nmlno0lem.p	. . . . . . . . . . . . . . . . 17 ⊢ 𝑃 = (0_vec‘𝑈)
9	2, 8, 3	nvz 31021	. . . . . . . . . . . . . . . 16 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ 𝑋) → ((𝐾‘𝑥) = 0 ↔ 𝑥 = 𝑃))
10	1, 9	mpan 702	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ 𝑋 → ((𝐾‘𝑥) = 0 ↔ 𝑥 = 𝑃))
11		fveq2 6881	. . . . . . . . . . . . . . . 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 31108	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → (𝑇‘𝑃) = 𝑄)
18	1, 12, 13, 17	mp3an 1490	. . . . . . . . . . . . . . . 16 ⊢ (𝑇‘𝑃) = 𝑄
19	11, 18	eqtrdi 2814	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑃 → (𝑇‘𝑥) = 𝑄)
20	10, 19	biimtrdi 256	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ 𝑋 → ((𝐾‘𝑥) = 0 → (𝑇‘𝑥) = 𝑄))
21	20	necon3d 2979	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ 𝑋 → ((𝑇‘𝑥) ≠ 𝑄 → (𝐾‘𝑥) ≠ 0))
22	21	imp 411	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝐾‘𝑥) ≠ 0)
23	7, 22	recne0d 11980	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (1 / (𝐾‘𝑥)) ≠ 0)
24		simpr 489	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑇‘𝑥) ≠ 𝑄)
25	7, 22	reccld 11979	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (1 / (𝐾‘𝑥)) ∈ ℂ)
26	2, 14, 16	lnof 31107	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → 𝑇:𝑋⟶𝑌)
27	1, 12, 13, 26	mp3an 1490	. . . . . . . . . . . . . . . 16 ⊢ 𝑇:𝑋⟶𝑌
28	27	ffvelcdmi 7078	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ 𝑋 → (𝑇‘𝑥) ∈ 𝑌)
29	28	adantr 485	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑇‘𝑥) ∈ 𝑌)
30		nmlno0lem.s	. . . . . . . . . . . . . . . 16 ⊢ 𝑆 = ( ·_𝑠OLD ‘𝑊)
31	14, 30, 15	nvmul0or 31002	. . . . . . . . . . . . . . 15 ⊢ ((𝑊 ∈ NrmCVec ∧ (1 / (𝐾‘𝑥)) ∈ ℂ ∧ (𝑇‘𝑥) ∈ 𝑌) → (((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) = 𝑄 ↔ ((1 / (𝐾‘𝑥)) = 0 ∨ (𝑇‘𝑥) = 𝑄)))
32	12, 31	mp3an1 1477	. . . . . . . . . . . . . 14 ⊢ (((1 / (𝐾‘𝑥)) ∈ ℂ ∧ (𝑇‘𝑥) ∈ 𝑌) → (((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) = 𝑄 ↔ ((1 / (𝐾‘𝑥)) = 0 ∨ (𝑇‘𝑥) = 𝑄)))
33	25, 29, 32	syl2anc 595	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) = 𝑄 ↔ ((1 / (𝐾‘𝑥)) = 0 ∨ (𝑇‘𝑥) = 𝑄)))
34	33	necon3abid 2994	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ≠ 𝑄 ↔ ¬ ((1 / (𝐾‘𝑥)) = 0 ∨ (𝑇‘𝑥) = 𝑄)))
35		neanior 3051	. . . . . . . . . . . 12 ⊢ (((1 / (𝐾‘𝑥)) ≠ 0 ∧ (𝑇‘𝑥) ≠ 𝑄) ↔ ¬ ((1 / (𝐾‘𝑥)) = 0 ∨ (𝑇‘𝑥) = 𝑄))
36	34, 35	bitr4di 292	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ≠ 𝑄 ↔ ((1 / (𝐾‘𝑥)) ≠ 0 ∧ (𝑇‘𝑥) ≠ 𝑄)))
37	23, 24, 36	mpbir2and 725	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ≠ 𝑄)
38	14, 30	nvscl 30978	. . . . . . . . . . . . 13 ⊢ ((𝑊 ∈ NrmCVec ∧ (1 / (𝐾‘𝑥)) ∈ ℂ ∧ (𝑇‘𝑥) ∈ 𝑌) → ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ∈ 𝑌)
39	12, 38	mp3an1 1477	. . . . . . . . . . . 12 ⊢ (((1 / (𝐾‘𝑥)) ∈ ℂ ∧ (𝑇‘𝑥) ∈ 𝑌) → ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ∈ 𝑌)
40	25, 29, 39	syl2anc 595	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ∈ 𝑌)
41		nmlno0lem.m	. . . . . . . . . . . 12 ⊢ 𝑀 = (norm_CV‘𝑊)
42	14, 15, 41	nvgt0 31026	. . . . . . . . . . 11 ⊢ ((𝑊 ∈ NrmCVec ∧ ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ∈ 𝑌) → (((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ≠ 𝑄 ↔ 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))))
43	12, 40, 42	sylancr 598	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ≠ 𝑄 ↔ 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))))
44	37, 43	mpbid 235	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))))
45	44	ex 417	. . . . . . . 8 ⊢ (𝑥 ∈ 𝑋 → ((𝑇‘𝑥) ≠ 𝑄 → 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))))
46	45	adantl 486	. . . . . . 7 ⊢ (((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) → ((𝑇‘𝑥) ≠ 𝑄 → 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))))
47	14, 41	nmosetre 31116	. . . . . . . . . . . . . 14 ⊢ ((𝑊 ∈ NrmCVec ∧ 𝑇:𝑋⟶𝑌) → {𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))} ⊆ ℝ)
48	12, 27, 47	mp2an 704	. . . . . . . . . . . . 13 ⊢ {𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))} ⊆ ℝ
49		ressxr 11248	. . . . . . . . . . . . 13 ⊢ ℝ ⊆ ℝ^*
50	48, 49	sstri 3946	. . . . . . . . . . . 12 ⊢ {𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))} ⊆ ℝ^*
51		simpl 487	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → 𝑥 ∈ 𝑋)
52		nmlno0lem.r	. . . . . . . . . . . . . . . . 17 ⊢ 𝑅 = ( ·_𝑠OLD ‘𝑈)
53	2, 52	nvscl 30978	. . . . . . . . . . . . . . . 16 ⊢ ((𝑈 ∈ NrmCVec ∧ (1 / (𝐾‘𝑥)) ∈ ℂ ∧ 𝑥 ∈ 𝑋) → ((1 / (𝐾‘𝑥))𝑅𝑥) ∈ 𝑋)
54	1, 53	mp3an1 1477	. . . . . . . . . . . . . . 15 ⊢ (((1 / (𝐾‘𝑥)) ∈ ℂ ∧ 𝑥 ∈ 𝑋) → ((1 / (𝐾‘𝑥))𝑅𝑥) ∈ 𝑋)
55	25, 51, 54	syl2anc 595	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → ((1 / (𝐾‘𝑥))𝑅𝑥) ∈ 𝑋)
56	19	necon3i 2990	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑇‘𝑥) ≠ 𝑄 → 𝑥 ≠ 𝑃)
57	2, 52, 8, 3	nv1 31027	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ 𝑋 ∧ 𝑥 ≠ 𝑃) → (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) = 1)
58	1, 57	mp3an1 1477	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ∈ 𝑋 ∧ 𝑥 ≠ 𝑃) → (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) = 1)
59	56, 58	sylan2 604	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) = 1)
60		1re 11203	. . . . . . . . . . . . . . . 16 ⊢ 1 ∈ ℝ
61	59, 60	eqeltrdi 2871	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) ∈ ℝ)
62		eqle 11307	. . . . . . . . . . . . . . 15 ⊢ (((𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) ∈ ℝ ∧ (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) = 1) → (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) ≤ 1)
63	61, 59, 62	syl2anc 595	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) ≤ 1)
64	1, 12, 13	3pm3.2i 1358	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿)
65	2, 52, 30, 16	lnomul 31112	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ ((1 / (𝐾‘𝑥)) ∈ ℂ ∧ 𝑥 ∈ 𝑋)) → (𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥)) = ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))
66	64, 65	mpan 702	. . . . . . . . . . . . . . . . 17 ⊢ (((1 / (𝐾‘𝑥)) ∈ ℂ ∧ 𝑥 ∈ 𝑋) → (𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥)) = ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))
67	25, 51, 66	syl2anc 595	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥)) = ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))
68	67	eqcomd 2769	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) = (𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥)))
69	68	fveq2d 6885	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥))))
70		fveq2 6881	. . . . . . . . . . . . . . . . 17 ⊢ (𝑧 = ((1 / (𝐾‘𝑥))𝑅𝑥) → (𝐾‘𝑧) = (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)))
71	70	breq1d 5119	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 = ((1 / (𝐾‘𝑥))𝑅𝑥) → ((𝐾‘𝑧) ≤ 1 ↔ (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) ≤ 1))
72		2fveq3 6886	. . . . . . . . . . . . . . . . 17 ⊢ (𝑧 = ((1 / (𝐾‘𝑥))𝑅𝑥) → (𝑀‘(𝑇‘𝑧)) = (𝑀‘(𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥))))
73	72	eqeq2d 2774	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 = ((1 / (𝐾‘𝑥))𝑅𝑥) → ((𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘𝑧)) ↔ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥)))))
74	71, 73	anbi12d 643	. . . . . . . . . . . . . . 15 ⊢ (𝑧 = ((1 / (𝐾‘𝑥))𝑅𝑥) → (((𝐾‘𝑧) ≤ 1 ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘𝑧))) ↔ ((𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) ≤ 1 ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥))))))
75	74	rspcev 3581	. . . . . . . . . . . . . 14 ⊢ ((((1 / (𝐾‘𝑥))𝑅𝑥) ∈ 𝑋 ∧ ((𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) ≤ 1 ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥))))) → ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘𝑧))))
76	55, 63, 69, 75	syl12anc 849	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘𝑧))))
77		fvex 6894	. . . . . . . . . . . . . 14 ⊢ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ∈ V
78		eqeq1 2767	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) → (𝑦 = (𝑀‘(𝑇‘𝑧)) ↔ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘𝑧))))
79	78	anbi2d 641	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) → (((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧))) ↔ ((𝐾‘𝑧) ≤ 1 ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘𝑧)))))
80	79	rexbidv 3189	. . . . . . . . . . . . . 14 ⊢ (𝑦 = (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) → (∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧))) ↔ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘𝑧)))))
81	77, 80	elab 3638	. . . . . . . . . . . . 13 ⊢ ((𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ∈ {𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))} ↔ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘𝑧))))
82	76, 81	sylibr 237	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ∈ {𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))})
83		supxrub 13345	. . . . . . . . . . . 12 ⊢ (({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))} ⊆ ℝ^* ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ∈ {𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}) → (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ≤ sup({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}, ℝ^*, < ))
84	50, 82, 83	sylancr 598	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ≤ sup({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}, ℝ^*, < ))
85	84	adantll 726	. . . . . . . . . 10 ⊢ ((((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ≤ sup({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}, ℝ^*, < ))
86		nmlno0.3	. . . . . . . . . . . . . . 15 ⊢ 𝑁 = (𝑈 normOp_OLD 𝑊)
87	2, 14, 3, 41, 86	nmooval 31115	. . . . . . . . . . . . . 14 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:𝑋⟶𝑌) → (𝑁‘𝑇) = sup({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}, ℝ^*, < ))
88	1, 12, 27, 87	mp3an 1490	. . . . . . . . . . . . 13 ⊢ (𝑁‘𝑇) = sup({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}, ℝ^*, < )
89	88	eqeq1i 2768	. . . . . . . . . . . 12 ⊢ ((𝑁‘𝑇) = 0 ↔ sup({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}, ℝ^*, < ) = 0)
90	89	biimpi 219	. . . . . . . . . . 11 ⊢ ((𝑁‘𝑇) = 0 → sup({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}, ℝ^*, < ) = 0)
91	90	ad2antrr 738	. . . . . . . . . 10 ⊢ ((((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) ∧ (𝑇‘𝑥) ≠ 𝑄) → sup({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}, ℝ^*, < ) = 0)
92	85, 91	breqtrd 5137	. . . . . . . . 9 ⊢ ((((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ≤ 0)
93	14, 41	nvcl 31013	. . . . . . . . . . . 12 ⊢ ((𝑊 ∈ NrmCVec ∧ ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ∈ 𝑌) → (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ∈ ℝ)
94	12, 40, 93	sylancr 598	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ∈ ℝ)
95		0re 11205	. . . . . . . . . . 11 ⊢ 0 ∈ ℝ
96		lenlt 11283	. . . . . . . . . . 11 ⊢ (((𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ∈ ℝ ∧ 0 ∈ ℝ) → ((𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ≤ 0 ↔ ¬ 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))))
97	94, 95, 96	sylancl 597	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → ((𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ≤ 0 ↔ ¬ 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))))
98	97	adantll 726	. . . . . . . . 9 ⊢ ((((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) ∧ (𝑇‘𝑥) ≠ 𝑄) → ((𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ≤ 0 ↔ ¬ 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))))
99	92, 98	mpbid 235	. . . . . . . 8 ⊢ ((((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) ∧ (𝑇‘𝑥) ≠ 𝑄) → ¬ 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))))
100	99	ex 417	. . . . . . 7 ⊢ (((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) → ((𝑇‘𝑥) ≠ 𝑄 → ¬ 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))))
101	46, 100	pm2.65d 199	. . . . . 6 ⊢ (((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) → ¬ (𝑇‘𝑥) ≠ 𝑄)
102		nne 2962	. . . . . 6 ⊢ (¬ (𝑇‘𝑥) ≠ 𝑄 ↔ (𝑇‘𝑥) = 𝑄)
103	101, 102	sylib 221	. . . . 5 ⊢ (((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) → (𝑇‘𝑥) = 𝑄)
104		nmlno0.0	. . . . . . . 8 ⊢ 𝑍 = (𝑈 0_op 𝑊)
105	2, 15, 104	0oval 31140	. . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑥 ∈ 𝑋) → (𝑍‘𝑥) = 𝑄)
106	1, 12, 105	mp3an12 1480	. . . . . 6 ⊢ (𝑥 ∈ 𝑋 → (𝑍‘𝑥) = 𝑄)
107	106	adantl 486	. . . . 5 ⊢ (((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) → (𝑍‘𝑥) = 𝑄)
108	103, 107	eqtr4d 2801	. . . 4 ⊢ (((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) → (𝑇‘𝑥) = (𝑍‘𝑥))
109	108	ralrimiva 3157	. . 3 ⊢ ((𝑁‘𝑇) = 0 → ∀𝑥 ∈ 𝑋 (𝑇‘𝑥) = (𝑍‘𝑥))
110		ffn 6705	. . . . 5 ⊢ (𝑇:𝑋⟶𝑌 → 𝑇 Fn 𝑋)
111	27, 110	ax-mp 5	. . . 4 ⊢ 𝑇 Fn 𝑋
112	2, 14, 104	0oo 31141	. . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → 𝑍:𝑋⟶𝑌)
113	1, 12, 112	mp2an 704	. . . . 5 ⊢ 𝑍:𝑋⟶𝑌
114		ffn 6705	. . . . 5 ⊢ (𝑍:𝑋⟶𝑌 → 𝑍 Fn 𝑋)
115	113, 114	ax-mp 5	. . . 4 ⊢ 𝑍 Fn 𝑋
116		eqfnfv 7025	. . . 4 ⊢ ((𝑇 Fn 𝑋 ∧ 𝑍 Fn 𝑋) → (𝑇 = 𝑍 ↔ ∀𝑥 ∈ 𝑋 (𝑇‘𝑥) = (𝑍‘𝑥)))
117	111, 115, 116	mp2an 704	. . 3 ⊢ (𝑇 = 𝑍 ↔ ∀𝑥 ∈ 𝑋 (𝑇‘𝑥) = (𝑍‘𝑥))
118	109, 117	sylibr 237	. 2 ⊢ ((𝑁‘𝑇) = 0 → 𝑇 = 𝑍)
119		fveq2 6881	. . 3 ⊢ (𝑇 = 𝑍 → (𝑁‘𝑇) = (𝑁‘𝑍))
120	86, 104	nmoo0 31143	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → (𝑁‘𝑍) = 0)
121	1, 12, 120	mp2an 704	. . 3 ⊢ (𝑁‘𝑍) = 0
122	119, 121	eqtrdi 2814	. 2 ⊢ (𝑇 = 𝑍 → (𝑁‘𝑇) = 0)
123	118, 122	impbii 212	1 ⊢ ((𝑁‘𝑇) = 0 ↔ 𝑇 = 𝑍)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∨ wo 860 ∧ w3a 1103 = wceq 1570 ∈ wcel 2143 {cab 2741 ≠ wne 2958 ∀wral 3079 ∃wrex 3089 ⊆ wss 3905 class class class wbr 5109 Fn wfn 6531 ⟶wf 6532 ‘cfv 6536 (class class class)co 7410 supcsup 9396 ℂcc 11093 ℝcr 11094 0cc0 11095 1c1 11096 ℝ^*cxr 11237 < clt 11238 ≤ cle 11239 / cdiv 11866 NrmCVeccnv 30936 BaseSetcba 30938 ·_𝑠OLD cns 30939 0_veccn0v 30940 norm_CVcnmcv 30942 LnOp clno 31092 normOp_OLD cnmoo 31093 0_op c0o 31095

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11151 ax-resscn 11152 ax-1cn 11153 ax-icn 11154 ax-addcl 11155 ax-addrcl 11156 ax-mulcl 11157 ax-mulrcl 11158 ax-mulcom 11159 ax-addass 11160 ax-mulass 11161 ax-distr 11162 ax-i2m1 11163 ax-1ne0 11164 ax-1rid 11165 ax-rnegex 11166 ax-rrecex 11167 ax-cnre 11168 ax-pre-lttri 11169 ax-pre-lttrn 11170 ax-pre-ltadd 11171 ax-pre-mulgt0 11172 ax-pre-sup 11173

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7859 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-er 8690 df-map 8822 df-en 8940 df-dom 8941 df-sdom 8942 df-sup 9398 df-pnf 11240 df-mnf 11241 df-xr 11242 df-ltxr 11243 df-le 11244 df-sub 11438 df-neg 11439 df-div 11867 df-nn 12229 df-2 12298 df-3 12299 df-n0 12500 df-z 12587 df-uz 12858 df-rp 13012 df-seq 14034 df-exp 14094 df-cj 15146 df-re 15147 df-im 15148 df-sqrt 15282 df-abs 15283 df-grpo 30845 df-gid 30846 df-ginv 30847 df-ablo 30897 df-vc 30911 df-nv 30944 df-va 30947 df-ba 30948 df-sm 30949 df-0v 30950 df-nmcv 30952 df-lno 31096 df-nmoo 31097 df-0o 31099

This theorem is referenced by: nmlno0i 31146

W3C validator