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 31216

Description: Lemma for nmlno0i 31217. (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 31084	. . . . . . . . . . . . . . 15 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ 𝑋) → (𝐾‘𝑥) ∈ ℝ)
5	1, 4	mpan 703	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ 𝑋 → (𝐾‘𝑥) ∈ ℝ)
6	5	recnd 11252	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ 𝑋 → (𝐾‘𝑥) ∈ ℂ)
7	6	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝐾‘𝑥) ∈ ℂ)
8		nmlno0lem.p	. . . . . . . . . . . . . . . . 17 ⊢ 𝑃 = (0_vec‘𝑈)
9	2, 8, 3	nvz 31092	. . . . . . . . . . . . . . . 16 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ 𝑋) → ((𝐾‘𝑥) = 0 ↔ 𝑥 = 𝑃))
10	1, 9	mpan 703	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ 𝑋 → ((𝐾‘𝑥) = 0 ↔ 𝑥 = 𝑃))
11		fveq2 6885	. . . . . . . . . . . . . . . 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 31179	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → (𝑇‘𝑃) = 𝑄)
18	1, 12, 13, 17	mp3an 1490	. . . . . . . . . . . . . . . 16 ⊢ (𝑇‘𝑃) = 𝑄
19	11, 18	eqtrdi 2816	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑃 → (𝑇‘𝑥) = 𝑄)
20	10, 19	biimtrdi 256	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ 𝑋 → ((𝐾‘𝑥) = 0 → (𝑇‘𝑥) = 𝑄))
21	20	necon3d 2981	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ 𝑋 → ((𝑇‘𝑥) ≠ 𝑄 → (𝐾‘𝑥) ≠ 0))
22	21	imp 412	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝐾‘𝑥) ≠ 0)
23	7, 22	recne0d 12000	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (1 / (𝐾‘𝑥)) ≠ 0)
24		simpr 490	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑇‘𝑥) ≠ 𝑄)
25	7, 22	reccld 11999	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (1 / (𝐾‘𝑥)) ∈ ℂ)
26	2, 14, 16	lnof 31178	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → 𝑇:𝑋⟶𝑌)
27	1, 12, 13, 26	mp3an 1490	. . . . . . . . . . . . . . . 16 ⊢ 𝑇:𝑋⟶𝑌
28	27	ffvelcdmi 7082	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ 𝑋 → (𝑇‘𝑥) ∈ 𝑌)
29	28	adantr 486	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑇‘𝑥) ∈ 𝑌)
30		nmlno0lem.s	. . . . . . . . . . . . . . . 16 ⊢ 𝑆 = ( ·_𝑠OLD ‘𝑊)
31	14, 30, 15	nvmul0or 31073	. . . . . . . . . . . . . . 15 ⊢ ((𝑊 ∈ NrmCVec ∧ (1 / (𝐾‘𝑥)) ∈ ℂ ∧ (𝑇‘𝑥) ∈ 𝑌) → (((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) = 𝑄 ↔ ((1 / (𝐾‘𝑥)) = 0 ∨ (𝑇‘𝑥) = 𝑄)))
32	12, 31	mp3an1 1477	. . . . . . . . . . . . . 14 ⊢ (((1 / (𝐾‘𝑥)) ∈ ℂ ∧ (𝑇‘𝑥) ∈ 𝑌) → (((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) = 𝑄 ↔ ((1 / (𝐾‘𝑥)) = 0 ∨ (𝑇‘𝑥) = 𝑄)))
33	25, 29, 32	syl2anc 596	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) = 𝑄 ↔ ((1 / (𝐾‘𝑥)) = 0 ∨ (𝑇‘𝑥) = 𝑄)))
34	33	necon3abid 2996	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ≠ 𝑄 ↔ ¬ ((1 / (𝐾‘𝑥)) = 0 ∨ (𝑇‘𝑥) = 𝑄)))
35		neanior 3053	. . . . . . . . . . . 12 ⊢ (((1 / (𝐾‘𝑥)) ≠ 0 ∧ (𝑇‘𝑥) ≠ 𝑄) ↔ ¬ ((1 / (𝐾‘𝑥)) = 0 ∨ (𝑇‘𝑥) = 𝑄))
36	34, 35	bitr4di 292	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ≠ 𝑄 ↔ ((1 / (𝐾‘𝑥)) ≠ 0 ∧ (𝑇‘𝑥) ≠ 𝑄)))
37	23, 24, 36	mpbir2and 726	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ≠ 𝑄)
38	14, 30	nvscl 31049	. . . . . . . . . . . . 13 ⊢ ((𝑊 ∈ NrmCVec ∧ (1 / (𝐾‘𝑥)) ∈ ℂ ∧ (𝑇‘𝑥) ∈ 𝑌) → ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ∈ 𝑌)
39	12, 38	mp3an1 1477	. . . . . . . . . . . 12 ⊢ (((1 / (𝐾‘𝑥)) ∈ ℂ ∧ (𝑇‘𝑥) ∈ 𝑌) → ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ∈ 𝑌)
40	25, 29, 39	syl2anc 596	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ∈ 𝑌)
41		nmlno0lem.m	. . . . . . . . . . . 12 ⊢ 𝑀 = (norm_CV‘𝑊)
42	14, 15, 41	nvgt0 31097	. . . . . . . . . . 11 ⊢ ((𝑊 ∈ NrmCVec ∧ ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ∈ 𝑌) → (((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ≠ 𝑄 ↔ 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))))
43	12, 40, 42	sylancr 599	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ≠ 𝑄 ↔ 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))))
44	37, 43	mpbid 235	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))))
45	44	ex 418	. . . . . . . 8 ⊢ (𝑥 ∈ 𝑋 → ((𝑇‘𝑥) ≠ 𝑄 → 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))))
46	45	adantl 487	. . . . . . 7 ⊢ (((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) → ((𝑇‘𝑥) ≠ 𝑄 → 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))))
47	14, 41	nmosetre 31187	. . . . . . . . . . . . . 14 ⊢ ((𝑊 ∈ NrmCVec ∧ 𝑇:𝑋⟶𝑌) → {𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))} ⊆ ℝ)
48	12, 27, 47	mp2an 705	. . . . . . . . . . . . 13 ⊢ {𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))} ⊆ ℝ
49		ressxr 11268	. . . . . . . . . . . . 13 ⊢ ℝ ⊆ ℝ^*
50	48, 49	sstri 3947	. . . . . . . . . . . 12 ⊢ {𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))} ⊆ ℝ^*
51		simpl 488	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → 𝑥 ∈ 𝑋)
52		nmlno0lem.r	. . . . . . . . . . . . . . . . 17 ⊢ 𝑅 = ( ·_𝑠OLD ‘𝑈)
53	2, 52	nvscl 31049	. . . . . . . . . . . . . . . 16 ⊢ ((𝑈 ∈ NrmCVec ∧ (1 / (𝐾‘𝑥)) ∈ ℂ ∧ 𝑥 ∈ 𝑋) → ((1 / (𝐾‘𝑥))𝑅𝑥) ∈ 𝑋)
54	1, 53	mp3an1 1477	. . . . . . . . . . . . . . 15 ⊢ (((1 / (𝐾‘𝑥)) ∈ ℂ ∧ 𝑥 ∈ 𝑋) → ((1 / (𝐾‘𝑥))𝑅𝑥) ∈ 𝑋)
55	25, 51, 54	syl2anc 596	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → ((1 / (𝐾‘𝑥))𝑅𝑥) ∈ 𝑋)
56	19	necon3i 2992	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑇‘𝑥) ≠ 𝑄 → 𝑥 ≠ 𝑃)
57	2, 52, 8, 3	nv1 31098	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ 𝑋 ∧ 𝑥 ≠ 𝑃) → (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) = 1)
58	1, 57	mp3an1 1477	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ∈ 𝑋 ∧ 𝑥 ≠ 𝑃) → (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) = 1)
59	56, 58	sylan2 605	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) = 1)
60		1re 11223	. . . . . . . . . . . . . . . 16 ⊢ 1 ∈ ℝ
61	59, 60	eqeltrdi 2873	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) ∈ ℝ)
62		eqle 11327	. . . . . . . . . . . . . . 15 ⊢ (((𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) ∈ ℝ ∧ (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) = 1) → (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) ≤ 1)
63	61, 59, 62	syl2anc 596	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) ≤ 1)
64	1, 12, 13	3pm3.2i 1358	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿)
65	2, 52, 30, 16	lnomul 31183	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ ((1 / (𝐾‘𝑥)) ∈ ℂ ∧ 𝑥 ∈ 𝑋)) → (𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥)) = ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))
66	64, 65	mpan 703	. . . . . . . . . . . . . . . . 17 ⊢ (((1 / (𝐾‘𝑥)) ∈ ℂ ∧ 𝑥 ∈ 𝑋) → (𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥)) = ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))
67	25, 51, 66	syl2anc 596	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥)) = ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))
68	67	eqcomd 2771	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) = (𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥)))
69	68	fveq2d 6889	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥))))
70		fveq2 6885	. . . . . . . . . . . . . . . . 17 ⊢ (𝑧 = ((1 / (𝐾‘𝑥))𝑅𝑥) → (𝐾‘𝑧) = (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)))
71	70	breq1d 5121	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 = ((1 / (𝐾‘𝑥))𝑅𝑥) → ((𝐾‘𝑧) ≤ 1 ↔ (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) ≤ 1))
72		2fveq3 6890	. . . . . . . . . . . . . . . . 17 ⊢ (𝑧 = ((1 / (𝐾‘𝑥))𝑅𝑥) → (𝑀‘(𝑇‘𝑧)) = (𝑀‘(𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥))))
73	72	eqeq2d 2776	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 = ((1 / (𝐾‘𝑥))𝑅𝑥) → ((𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘𝑧)) ↔ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥)))))
74	71, 73	anbi12d 644	. . . . . . . . . . . . . . 15 ⊢ (𝑧 = ((1 / (𝐾‘𝑥))𝑅𝑥) → (((𝐾‘𝑧) ≤ 1 ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘𝑧))) ↔ ((𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) ≤ 1 ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥))))))
75	74	rspcev 3583	. . . . . . . . . . . . . 14 ⊢ ((((1 / (𝐾‘𝑥))𝑅𝑥) ∈ 𝑋 ∧ ((𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) ≤ 1 ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥))))) → ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘𝑧))))
76	55, 63, 69, 75	syl12anc 850	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘𝑧))))
77		fvex 6898	. . . . . . . . . . . . . 14 ⊢ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ∈ V
78		eqeq1 2769	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) → (𝑦 = (𝑀‘(𝑇‘𝑧)) ↔ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘𝑧))))
79	78	anbi2d 642	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) → (((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧))) ↔ ((𝐾‘𝑧) ≤ 1 ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘𝑧)))))
80	79	rexbidv 3191	. . . . . . . . . . . . . 14 ⊢ (𝑦 = (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) → (∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧))) ↔ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘𝑧)))))
81	77, 80	elab 3640	. . . . . . . . . . . . 13 ⊢ ((𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ∈ {𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))} ↔ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘𝑧))))
82	76, 81	sylibr 237	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ∈ {𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))})
83		supxrub 13366	. . . . . . . . . . . 12 ⊢ (({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))} ⊆ ℝ^* ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ∈ {𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}) → (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ≤ sup({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}, ℝ^*, < ))
84	50, 82, 83	sylancr 599	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ≤ sup({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}, ℝ^*, < ))
85	84	adantll 727	. . . . . . . . . 10 ⊢ ((((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ≤ sup({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}, ℝ^*, < ))
86		nmlno0.3	. . . . . . . . . . . . . . 15 ⊢ 𝑁 = (𝑈 normOp_OLD 𝑊)
87	2, 14, 3, 41, 86	nmooval 31186	. . . . . . . . . . . . . 14 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:𝑋⟶𝑌) → (𝑁‘𝑇) = sup({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}, ℝ^*, < ))
88	1, 12, 27, 87	mp3an 1490	. . . . . . . . . . . . 13 ⊢ (𝑁‘𝑇) = sup({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}, ℝ^*, < )
89	88	eqeq1i 2770	. . . . . . . . . . . 12 ⊢ ((𝑁‘𝑇) = 0 ↔ sup({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}, ℝ^*, < ) = 0)
90	89	biimpi 219	. . . . . . . . . . 11 ⊢ ((𝑁‘𝑇) = 0 → sup({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}, ℝ^*, < ) = 0)
91	90	ad2antrr 739	. . . . . . . . . 10 ⊢ ((((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) ∧ (𝑇‘𝑥) ≠ 𝑄) → sup({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}, ℝ^*, < ) = 0)
92	85, 91	breqtrd 5139	. . . . . . . . 9 ⊢ ((((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ≤ 0)
93	14, 41	nvcl 31084	. . . . . . . . . . . 12 ⊢ ((𝑊 ∈ NrmCVec ∧ ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ∈ 𝑌) → (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ∈ ℝ)
94	12, 40, 93	sylancr 599	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ∈ ℝ)
95		0re 11225	. . . . . . . . . . 11 ⊢ 0 ∈ ℝ
96		lenlt 11303	. . . . . . . . . . 11 ⊢ (((𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ∈ ℝ ∧ 0 ∈ ℝ) → ((𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ≤ 0 ↔ ¬ 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))))
97	94, 95, 96	sylancl 598	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → ((𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ≤ 0 ↔ ¬ 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))))
98	97	adantll 727	. . . . . . . . 9 ⊢ ((((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) ∧ (𝑇‘𝑥) ≠ 𝑄) → ((𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ≤ 0 ↔ ¬ 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))))
99	92, 98	mpbid 235	. . . . . . . 8 ⊢ ((((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) ∧ (𝑇‘𝑥) ≠ 𝑄) → ¬ 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))))
100	99	ex 418	. . . . . . 7 ⊢ (((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) → ((𝑇‘𝑥) ≠ 𝑄 → ¬ 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))))
101	46, 100	pm2.65d 199	. . . . . 6 ⊢ (((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) → ¬ (𝑇‘𝑥) ≠ 𝑄)
102		nne 2964	. . . . . 6 ⊢ (¬ (𝑇‘𝑥) ≠ 𝑄 ↔ (𝑇‘𝑥) = 𝑄)
103	101, 102	sylib 221	. . . . 5 ⊢ (((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) → (𝑇‘𝑥) = 𝑄)
104		nmlno0.0	. . . . . . . 8 ⊢ 𝑍 = (𝑈 0_op 𝑊)
105	2, 15, 104	0oval 31211	. . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑥 ∈ 𝑋) → (𝑍‘𝑥) = 𝑄)
106	1, 12, 105	mp3an12 1480	. . . . . 6 ⊢ (𝑥 ∈ 𝑋 → (𝑍‘𝑥) = 𝑄)
107	106	adantl 487	. . . . 5 ⊢ (((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) → (𝑍‘𝑥) = 𝑄)
108	103, 107	eqtr4d 2803	. . . 4 ⊢ (((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) → (𝑇‘𝑥) = (𝑍‘𝑥))
109	108	ralrimiva 3159	. . 3 ⊢ ((𝑁‘𝑇) = 0 → ∀𝑥 ∈ 𝑋 (𝑇‘𝑥) = (𝑍‘𝑥))
110		ffn 6709	. . . . 5 ⊢ (𝑇:𝑋⟶𝑌 → 𝑇 Fn 𝑋)
111	27, 110	ax-mp 5	. . . 4 ⊢ 𝑇 Fn 𝑋
112	2, 14, 104	0oo 31212	. . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → 𝑍:𝑋⟶𝑌)
113	1, 12, 112	mp2an 705	. . . . 5 ⊢ 𝑍:𝑋⟶𝑌
114		ffn 6709	. . . . 5 ⊢ (𝑍:𝑋⟶𝑌 → 𝑍 Fn 𝑋)
115	113, 114	ax-mp 5	. . . 4 ⊢ 𝑍 Fn 𝑋
116		eqfnfv 7029	. . . 4 ⊢ ((𝑇 Fn 𝑋 ∧ 𝑍 Fn 𝑋) → (𝑇 = 𝑍 ↔ ∀𝑥 ∈ 𝑋 (𝑇‘𝑥) = (𝑍‘𝑥)))
117	111, 115, 116	mp2an 705	. . 3 ⊢ (𝑇 = 𝑍 ↔ ∀𝑥 ∈ 𝑋 (𝑇‘𝑥) = (𝑍‘𝑥))
118	109, 117	sylibr 237	. 2 ⊢ ((𝑁‘𝑇) = 0 → 𝑇 = 𝑍)
119		fveq2 6885	. . 3 ⊢ (𝑇 = 𝑍 → (𝑁‘𝑇) = (𝑁‘𝑍))
120	86, 104	nmoo0 31214	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → (𝑁‘𝑍) = 0)
121	1, 12, 120	mp2an 705	. . 3 ⊢ (𝑁‘𝑍) = 0
122	119, 121	eqtrdi 2816	. 2 ⊢ (𝑇 = 𝑍 → (𝑁‘𝑇) = 0)
123	118, 122	impbii 212	1 ⊢ ((𝑁‘𝑇) = 0 ↔ 𝑇 = 𝑍)

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 {cab 2743 ≠ wne 2960 ∀wral 3081 ∃wrex 3091 ⊆ wss 3906 class class class wbr 5111 Fn wfn 6535 ⟶wf 6536 ‘cfv 6540 (class class class)co 7419 supcsup 9407 ℂcc 11113 ℝcr 11114 0cc0 11115 1c1 11116 ℝ^*cxr 11257 < clt 11258 ≤ cle 11259 / cdiv 11886 NrmCVeccnv 31007 BaseSetcba 31009 ·_𝑠OLD cns 31010 0_veccn0v 31011 norm_CVcnmcv 31013 LnOp clno 31163 normOp_OLD cnmoo 31164 0_op c0o 31166

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-cnex 11171 ax-resscn 11172 ax-1cn 11173 ax-icn 11174 ax-addcl 11175 ax-addrcl 11176 ax-mulcl 11177 ax-mulrcl 11178 ax-mulcom 11179 ax-addass 11180 ax-mulass 11181 ax-distr 11182 ax-i2m1 11183 ax-1ne0 11184 ax-1rid 11185 ax-rnegex 11186 ax-rrecex 11187 ax-cnre 11188 ax-pre-lttri 11189 ax-pre-lttrn 11190 ax-pre-ltadd 11191 ax-pre-mulgt0 11192 ax-pre-sup 11193

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7869 df-1st 7992 df-2nd 7993 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-er 8700 df-map 8832 df-en 8950 df-dom 8951 df-sdom 8952 df-sup 9409 df-pnf 11260 df-mnf 11261 df-xr 11262 df-ltxr 11263 df-le 11264 df-sub 11458 df-neg 11459 df-div 11887 df-nn 12249 df-2 12318 df-3 12319 df-n0 12520 df-z 12607 df-uz 12879 df-rp 13033 df-seq 14056 df-exp 14116 df-cj 15174 df-re 15175 df-im 15176 df-sqrt 15310 df-abs 15311 df-grpo 30916 df-gid 30917 df-ginv 30918 df-ablo 30968 df-vc 30982 df-nv 31015 df-va 31018 df-ba 31019 df-sm 31020 df-0v 31021 df-nmcv 31023 df-lno 31167 df-nmoo 31168 df-0o 31170

This theorem is used by: nmlno0i 31217

W3C validator