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

Theorem nmlno0lem 31388
Description: Lemma for nmlno0i 31389. (Contributed by NM, 28-Nov-2007.) (New usage is discouraged.)
Hypotheses
Ref Expression
nmlno0.3 𝑁 = (𝑈 normOpOLD 𝑊)
nmlno0.0 𝑍 = (𝑈 0op 𝑊)
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 𝑃 = (0vec‘𝑈)
nmlno0lem.q 𝑄 = (0vec‘𝑊)
nmlno0lem.k 𝐾 = (normCV‘𝑈)
nmlno0lem.m 𝑀 = (normCV‘𝑊)
Assertion
Ref Expression
nmlno0lem ((𝑁‘𝑇) = 0 ↔ 𝑇 = 𝑍)

Proof of Theorem nmlno0lem
Dummy variables 𝑦 𝑧 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 nmlno0lem.u . . . . . . . . . . . . . . 15 𝑈 ∈ NrmCVec
2 nmlno0lem.1 . . . . . . . . . . . . . . . 16 𝑋 = (BaseSet‘𝑈)
3 nmlno0lem.k . . . . . . . . . . . . . . . 16 𝐾 = (normCV‘𝑈)
42, 3nvcl 31256 . . . . . . . . . . . . . . 15 ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ 𝑋) → (𝐾‘𝑥) ∈ ℝ)
51, 4mpan 703 . . . . . . . . . . . . . 14 (𝑥 ∈ 𝑋 → (𝐾‘𝑥) ∈ ℝ)
65recnd 11330 . . . . . . . . . . . . 13 (𝑥 ∈ 𝑋 → (𝐾‘𝑥) ∈ ℂ)
76adantr 486 . . . . . . . . . . . 12 ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝐾‘𝑥) ∈ ℂ)
8 nmlno0lem.p . . . . . . . . . . . . . . . . 17 𝑃 = (0vec‘𝑈)
92, 8, 3nvz 31264 . . . . . . . . . . . . . . . 16 ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ 𝑋) → ((𝐾‘𝑥) = 0 ↔ 𝑥 = 𝑃))
101, 9mpan 703 . . . . . . . . . . . . . . 15 (𝑥 ∈ 𝑋 → ((𝐾‘𝑥) = 0 ↔ 𝑥 = 𝑃))
11 fveq2 6883 . . . . . . . . . . . . . . . 16 (𝑥 = 𝑃 → (𝑇‘𝑥) = (𝑇‘𝑃))
12 nmlno0lem.w . . . . . . . . . . . . . . . . 17 𝑊 ∈ NrmCVec
13 nmlno0lem.l . . . . . . . . . . . . . . . . 17 𝑇 ∈ 𝐿
14 nmlno0lem.2 . . . . . . . . . . . . . . . . . 18 𝑌 = (BaseSet‘𝑊)
15 nmlno0lem.q . . . . . . . . . . . . . . . . . 18 𝑄 = (0vec‘𝑊)
16 nmlno0.7 . . . . . . . . . . . . . . . . . 18 𝐿 = (𝑈 LnOp 𝑊)
172, 14, 8, 15, 16lno0 31351 . . . . . . . . . . . . . . . . 17 ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → (𝑇‘𝑃) = 𝑄)
181, 12, 13, 17mp3an 1490 . . . . . . . . . . . . . . . 16 (𝑇‘𝑃) = 𝑄
1911, 18eqtrdi 2812 . . . . . . . . . . . . . . 15 (𝑥 = 𝑃 → (𝑇‘𝑥) = 𝑄)
2010, 19biimtrdi 256 . . . . . . . . . . . . . 14 (𝑥 ∈ 𝑋 → ((𝐾‘𝑥) = 0 → (𝑇‘𝑥) = 𝑄))
2120necon3d 2977 . . . . . . . . . . . . 13 (𝑥 ∈ 𝑋 → ((𝑇‘𝑥) ≠ 𝑄 → (𝐾‘𝑥) ≠ 0))
2221imp 412 . . . . . . . . . . . 12 ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝐾‘𝑥) ≠ 0)
237, 22recne0d 12080 . . . . . . . . . . 11 ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (1 / (𝐾‘𝑥)) ≠ 0)
24 simpr 490 . . . . . . . . . . 11 ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑇‘𝑥) ≠ 𝑄)
257, 22reccld 12079 . . . . . . . . . . . . . 14 ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (1 / (𝐾‘𝑥)) ∈ ℂ)
262, 14, 16lnof 31350 . . . . . . . . . . . . . . . . 17 ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) → 𝑇:𝑋⟶𝑌)
271, 12, 13, 26mp3an 1490 . . . . . . . . . . . . . . . 16 𝑇:𝑋⟶𝑌
2827ffvelcdmi 7081 . . . . . . . . . . . . . . 15 (𝑥 ∈ 𝑋 → (𝑇‘𝑥) ∈ 𝑌)
2928adantr 486 . . . . . . . . . . . . . 14 ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑇‘𝑥) ∈ 𝑌)
30 nmlno0lem.s . . . . . . . . . . . . . . . 16 𝑆 = ( ·𝑠OLD ‘𝑊)
3114, 30, 15nvmul0or 31245 . . . . . . . . . . . . . . 15 ((𝑊 ∈ NrmCVec ∧ (1 / (𝐾‘𝑥)) ∈ ℂ ∧ (𝑇‘𝑥) ∈ 𝑌) → (((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) = 𝑄 ↔ ((1 / (𝐾‘𝑥)) = 0 ∨ (𝑇‘𝑥) = 𝑄)))
3212, 31mp3an1 1477 . . . . . . . . . . . . . 14 (((1 / (𝐾‘𝑥)) ∈ ℂ ∧ (𝑇‘𝑥) ∈ 𝑌) → (((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) = 𝑄 ↔ ((1 / (𝐾‘𝑥)) = 0 ∨ (𝑇‘𝑥) = 𝑄)))
3325, 29, 32syl2anc 596 . . . . . . . . . . . . 13 ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) = 𝑄 ↔ ((1 / (𝐾‘𝑥)) = 0 ∨ (𝑇‘𝑥) = 𝑄)))
3433necon3abid 2992 . . . . . . . . . . . 12 ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ≠ 𝑄 ↔ ¬ ((1 / (𝐾‘𝑥)) = 0 ∨ (𝑇‘𝑥) = 𝑄)))
35 neanior 3049 . . . . . . . . . . . 12 (((1 / (𝐾‘𝑥)) ≠ 0 ∧ (𝑇‘𝑥) ≠ 𝑄) ↔ ¬ ((1 / (𝐾‘𝑥)) = 0 ∨ (𝑇‘𝑥) = 𝑄))
3634, 35bitr4di 292 . . . . . . . . . . 11 ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ≠ 𝑄 ↔ ((1 / (𝐾‘𝑥)) ≠ 0 ∧ (𝑇‘𝑥) ≠ 𝑄)))
3723, 24, 36mpbir2and 726 . . . . . . . . . 10 ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ≠ 𝑄)
3814, 30nvscl 31221 . . . . . . . . . . . . 13 ((𝑊 ∈ NrmCVec ∧ (1 / (𝐾‘𝑥)) ∈ ℂ ∧ (𝑇‘𝑥) ∈ 𝑌) → ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ∈ 𝑌)
3912, 38mp3an1 1477 . . . . . . . . . . . 12 (((1 / (𝐾‘𝑥)) ∈ ℂ ∧ (𝑇‘𝑥) ∈ 𝑌) → ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ∈ 𝑌)
4025, 29, 39syl2anc 596 . . . . . . . . . . 11 ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ∈ 𝑌)
41 nmlno0lem.m . . . . . . . . . . . 12 𝑀 = (normCV‘𝑊)
4214, 15, 41nvgt0 31269 . . . . . . . . . . 11 ((𝑊 ∈ NrmCVec ∧ ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ∈ 𝑌) → (((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ≠ 𝑄 ↔ 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))))
4312, 40, 42sylancr 599 . . . . . . . . . 10 ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ≠ 𝑄 ↔ 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))))
4437, 43mpbid 235 . . . . . . . . 9 ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))))
4544ex 418 . . . . . . . 8 (𝑥 ∈ 𝑋 → ((𝑇‘𝑥) ≠ 𝑄 → 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))))
4645adantl 487 . . . . . . 7 (((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) → ((𝑇‘𝑥) ≠ 𝑄 → 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))))
4714, 41nmosetre 31359 . . . . . . . . . . . . . 14 ((𝑊 ∈ NrmCVec ∧ 𝑇:𝑋⟶𝑌) → {𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))} ⊆ ℝ)
4812, 27, 47mp2an 705 . . . . . . . . . . . . 13 {𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))} ⊆ ℝ
49 ressxr 11346 . . . . . . . . . . . . 13 ℝ ⊆ ℝ*
5048, 49sstri 3940 . . . . . . . . . . . 12 {𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))} ⊆ ℝ*
51 simpl 488 . . . . . . . . . . . . . . 15 ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → 𝑥 ∈ 𝑋)
52 nmlno0lem.r . . . . . . . . . . . . . . . . 17 𝑅 = ( ·𝑠OLD ‘𝑈)
532, 52nvscl 31221 . . . . . . . . . . . . . . . 16 ((𝑈 ∈ NrmCVec ∧ (1 / (𝐾‘𝑥)) ∈ ℂ ∧ 𝑥 ∈ 𝑋) → ((1 / (𝐾‘𝑥))𝑅𝑥) ∈ 𝑋)
541, 53mp3an1 1477 . . . . . . . . . . . . . . 15 (((1 / (𝐾‘𝑥)) ∈ ℂ ∧ 𝑥 ∈ 𝑋) → ((1 / (𝐾‘𝑥))𝑅𝑥) ∈ 𝑋)
5525, 51, 54syl2anc 596 . . . . . . . . . . . . . 14 ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → ((1 / (𝐾‘𝑥))𝑅𝑥) ∈ 𝑋)
5619necon3i 2988 . . . . . . . . . . . . . . . . 17 ((𝑇‘𝑥) ≠ 𝑄 → 𝑥 ≠ 𝑃)
572, 52, 8, 3nv1 31270 . . . . . . . . . . . . . . . . . 18 ((𝑈 ∈ NrmCVec ∧ 𝑥 ∈ 𝑋 ∧ 𝑥 ≠ 𝑃) → (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) = 1)
581, 57mp3an1 1477 . . . . . . . . . . . . . . . . 17 ((𝑥 ∈ 𝑋 ∧ 𝑥 ≠ 𝑃) → (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) = 1)
5956, 58sylan2 605 . . . . . . . . . . . . . . . 16 ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) = 1)
60 1re 11301 . . . . . . . . . . . . . . . 16 1 ∈ ℝ
6159, 60eqeltrdi 2869 . . . . . . . . . . . . . . 15 ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) ∈ ℝ)
62 eqle 11405 . . . . . . . . . . . . . . 15 (((𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) ∈ ℝ ∧ (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) = 1) → (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) ≤ 1)
6361, 59, 62syl2anc 596 . . . . . . . . . . . . . 14 ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) ≤ 1)
641, 12, 133pm3.2i 1358 . . . . . . . . . . . . . . . . . 18 (𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿)
652, 52, 30, 16lnomul 31355 . . . . . . . . . . . . . . . . . 18 (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇 ∈ 𝐿) ∧ ((1 / (𝐾‘𝑥)) ∈ ℂ ∧ 𝑥 ∈ 𝑋)) → (𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥)) = ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))
6664, 65mpan 703 . . . . . . . . . . . . . . . . 17 (((1 / (𝐾‘𝑥)) ∈ ℂ ∧ 𝑥 ∈ 𝑋) → (𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥)) = ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))
6725, 51, 66syl2anc 596 . . . . . . . . . . . . . . . 16 ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥)) = ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))
6867eqcomd 2767 . . . . . . . . . . . . . . 15 ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) = (𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥)))
6968fveq2d 6887 . . . . . . . . . . . . . 14 ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥))))
70 fveq2 6883 . . . . . . . . . . . . . . . . 17 (𝑧 = ((1 / (𝐾‘𝑥))𝑅𝑥) → (𝐾‘𝑧) = (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)))
7170breq1d 5113 . . . . . . . . . . . . . . . 16 (𝑧 = ((1 / (𝐾‘𝑥))𝑅𝑥) → ((𝐾‘𝑧) ≤ 1 ↔ (𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) ≤ 1))
72 2fveq3 6888 . . . . . . . . . . . . . . . . 17 (𝑧 = ((1 / (𝐾‘𝑥))𝑅𝑥) → (𝑀‘(𝑇‘𝑧)) = (𝑀‘(𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥))))
7372eqeq2d 2772 . . . . . . . . . . . . . . . 16 (𝑧 = ((1 / (𝐾‘𝑥))𝑅𝑥) → ((𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘𝑧)) ↔ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥)))))
7471, 73anbi12d 644 . . . . . . . . . . . . . . 15 (𝑧 = ((1 / (𝐾‘𝑥))𝑅𝑥) → (((𝐾‘𝑧) ≤ 1 ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘𝑧))) ↔ ((𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) ≤ 1 ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥))))))
7574rspcev 3577 . . . . . . . . . . . . . 14 ((((1 / (𝐾‘𝑥))𝑅𝑥) ∈ 𝑋 ∧ ((𝐾‘((1 / (𝐾‘𝑥))𝑅𝑥)) ≤ 1 ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘((1 / (𝐾‘𝑥))𝑅𝑥))))) → ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘𝑧))))
7655, 63, 69, 75syl12anc 850 . . . . . . . . . . . . 13 ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘𝑧))))
77 fvex 6896 . . . . . . . . . . . . . 14 (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ∈ V
78 eqeq1 2765 . . . . . . . . . . . . . . . 16 (𝑦 = (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) → (𝑦 = (𝑀‘(𝑇‘𝑧)) ↔ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘𝑧))))
7978anbi2d 642 . . . . . . . . . . . . . . 15 (𝑦 = (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) → (((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧))) ↔ ((𝐾‘𝑧) ≤ 1 ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘𝑧)))))
8079rexbidv 3187 . . . . . . . . . . . . . 14 (𝑦 = (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) → (∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧))) ↔ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘𝑧)))))
8177, 80elab 3633 . . . . . . . . . . . . 13 ((𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ∈ {𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))} ↔ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) = (𝑀‘(𝑇‘𝑧))))
8276, 81sylibr 237 . . . . . . . . . . . 12 ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ∈ {𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))})
83 supxrub 13447 . . . . . . . . . . . 12 (({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))} ⊆ ℝ* ∧ (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ∈ {𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}) → (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ≤ sup({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}, ℝ*, < ))
8450, 82, 83sylancr 599 . . . . . . . . . . 11 ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ≤ sup({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}, ℝ*, < ))
8584adantll 727 . . . . . . . . . 10 ((((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ≤ sup({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}, ℝ*, < ))
86 nmlno0.3 . . . . . . . . . . . . . . 15 𝑁 = (𝑈 normOpOLD 𝑊)
872, 14, 3, 41, 86nmooval 31358 . . . . . . . . . . . . . 14 ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇:𝑋⟶𝑌) → (𝑁‘𝑇) = sup({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}, ℝ*, < ))
881, 12, 27, 87mp3an 1490 . . . . . . . . . . . . 13 (𝑁‘𝑇) = sup({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}, ℝ*, < )
8988eqeq1i 2766 . . . . . . . . . . . 12 ((𝑁‘𝑇) = 0 ↔ sup({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}, ℝ*, < ) = 0)
9089biimpi 219 . . . . . . . . . . 11 ((𝑁‘𝑇) = 0 → sup({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}, ℝ*, < ) = 0)
9190ad2antrr 739 . . . . . . . . . 10 ((((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) ∧ (𝑇‘𝑥) ≠ 𝑄) → sup({𝑦 ∣ ∃𝑧 ∈ 𝑋 ((𝐾‘𝑧) ≤ 1 ∧ 𝑦 = (𝑀‘(𝑇‘𝑧)))}, ℝ*, < ) = 0)
9285, 91breqtrd 5131 . . . . . . . . 9 ((((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ≤ 0)
9314, 41nvcl 31256 . . . . . . . . . . . 12 ((𝑊 ∈ NrmCVec ∧ ((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)) ∈ 𝑌) → (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ∈ ℝ)
9412, 40, 93sylancr 599 . . . . . . . . . . 11 ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ∈ ℝ)
95 0re 11303 . . . . . . . . . . 11 0 ∈ ℝ
96 lenlt 11381 . . . . . . . . . . 11 (((𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ∈ ℝ ∧ 0 ∈ ℝ) → ((𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ≤ 0 ↔ ¬ 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))))
9794, 95, 96sylancl 598 . . . . . . . . . 10 ((𝑥 ∈ 𝑋 ∧ (𝑇‘𝑥) ≠ 𝑄) → ((𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ≤ 0 ↔ ¬ 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))))
9897adantll 727 . . . . . . . . 9 ((((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) ∧ (𝑇‘𝑥) ≠ 𝑄) → ((𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))) ≤ 0 ↔ ¬ 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))))
9992, 98mpbid 235 . . . . . . . 8 ((((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) ∧ (𝑇‘𝑥) ≠ 𝑄) → ¬ 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥))))
10099ex 418 . . . . . . 7 (((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) → ((𝑇‘𝑥) ≠ 𝑄 → ¬ 0 < (𝑀‘((1 / (𝐾‘𝑥))𝑆(𝑇‘𝑥)))))
10146, 100pm2.65d 199 . . . . . 6 (((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) → ¬ (𝑇‘𝑥) ≠ 𝑄)
102 nne 2960 . . . . . 6 (¬ (𝑇‘𝑥) ≠ 𝑄 ↔ (𝑇‘𝑥) = 𝑄)
103101, 102sylib 221 . . . . 5 (((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) → (𝑇‘𝑥) = 𝑄)
104 nmlno0.0 . . . . . . . 8 𝑍 = (𝑈 0op 𝑊)
1052, 15, 1040oval 31383 . . . . . . 7 ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑥 ∈ 𝑋) → (𝑍‘𝑥) = 𝑄)
1061, 12, 105mp3an12 1480 . . . . . 6 (𝑥 ∈ 𝑋 → (𝑍‘𝑥) = 𝑄)
107106adantl 487 . . . . 5 (((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) → (𝑍‘𝑥) = 𝑄)
108103, 107eqtr4d 2799 . . . 4 (((𝑁‘𝑇) = 0 ∧ 𝑥 ∈ 𝑋) → (𝑇‘𝑥) = (𝑍‘𝑥))
109108ralrimiva 3155 . . 3 ((𝑁‘𝑇) = 0 → ∀𝑥 ∈ 𝑋 (𝑇‘𝑥) = (𝑍‘𝑥))
110 ffn 6707 . . . . 5 (𝑇:𝑋⟶𝑌 → 𝑇 Fn 𝑋)
11127, 110ax-mp 5 . . . 4 𝑇 Fn 𝑋
1122, 14, 1040oo 31384 . . . . . 6 ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → 𝑍:𝑋⟶𝑌)
1131, 12, 112mp2an 705 . . . . 5 𝑍:𝑋⟶𝑌
114 ffn 6707 . . . . 5 (𝑍:𝑋⟶𝑌 → 𝑍 Fn 𝑋)
115113, 114ax-mp 5 . . . 4 𝑍 Fn 𝑋
116 eqfnfv 7027 . . . 4 ((𝑇 Fn 𝑋 ∧ 𝑍 Fn 𝑋) → (𝑇 = 𝑍 ↔ ∀𝑥 ∈ 𝑋 (𝑇‘𝑥) = (𝑍‘𝑥)))
117111, 115, 116mp2an 705 . . 3 (𝑇 = 𝑍 ↔ ∀𝑥 ∈ 𝑋 (𝑇‘𝑥) = (𝑍‘𝑥))
118109, 117sylibr 237 . 2 ((𝑁‘𝑇) = 0 → 𝑇 = 𝑍)
119 fveq2 6883 . . 3 (𝑇 = 𝑍 → (𝑁‘𝑇) = (𝑁‘𝑍))
12086, 104nmoo0 31386 . . . 4 ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → (𝑁‘𝑍) = 0)
1211, 12, 120mp2an 705 . . 3 (𝑁‘𝑍) = 0
122119, 121eqtrdi 2812 . 2 (𝑇 = 𝑍 → (𝑁‘𝑇) = 0)
123118, 122impbii 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 2145  {cab 2739   ≠ wne 2956  ∀wral 3077  ∃wrex 3087   ⊆ wss 3899   class class class wbr 5103   Fn wfn 6532  ⟶wf 6533  ‘cfv 6537  (class class class)co 7418  supcsup 9425  ℂcc 11191  ℝcr 11192  0cc0 11193  1c1 11194  ℝ*cxr 11335   < clt 11336   ≤ cle 11337   / cdiv 11966  NrmCVeccnv 31179  BaseSetcba 31181   ·𝑠OLD cns 31182  0veccn0v 31183  normCVcnmcv 31185   LnOp clno 31335   normOpOLD cnmoo 31336   0op c0o 31338
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749  ax-cnex 11249  ax-resscn 11250  ax-1cn 11251  ax-icn 11252  ax-addcl 11253  ax-addrcl 11254  ax-mulcl 11255  ax-mulrcl 11256  ax-mulcom 11257  ax-addass 11258  ax-mulass 11259  ax-distr 11260  ax-i2m1 11261  ax-1ne0 11262  ax-1rid 11263  ax-rnegex 11264  ax-rrecex 11265  ax-cnre 11266  ax-pre-lttri 11267  ax-pre-lttrn 11268  ax-pre-ltadd 11269  ax-pre-mulgt0 11270  ax-pre-sup 11271
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7375  df-ov 7421  df-oprab 7422  df-mpo 7423  df-om 7876  df-1st 7999  df-2nd 8000  df-frecs 8292  df-wrecs 8323  df-recs 8372  df-rdg 8411  df-er 8710  df-map 8842  df-en 8967  df-dom 8968  df-sdom 8969  df-sup 9427  df-pnf 11338  df-mnf 11339  df-xr 11340  df-ltxr 11341  df-le 11342  df-sub 11536  df-neg 11537  df-div 11967  df-nn 12329  df-2 12398  df-3 12399  df-n0 12600  df-z 12687  df-uz 12959  df-rp 13114  df-seq 14138  df-exp 14198  df-cj 15259  df-re 15260  df-im 15261  df-sqrt 15395  df-abs 15396  df-grpo 31088  df-gid 31089  df-ginv 31090  df-ablo 31140  df-vc 31154  df-nv 31187  df-va 31190  df-ba 31191  df-sm 31192  df-0v 31193  df-nmcv 31195  df-lno 31339  df-nmoo 31340  df-0o 31342
This theorem is used by:  nmlno0i  31389
  Copyright terms: Public domain W3C validator