Theorem islno 31382

Description: The predicate "is a linear operator." (Contributed by NM, 4-Dec-2007.) (Revised by Mario Carneiro, 16-Nov-2013.) (New usage is discouraged.)

Hypotheses

Ref	Expression
lnoval.1	⊢ 𝑋 = (BaseSet‘𝑈)
lnoval.2	⊢ 𝑌 = (BaseSet‘𝑊)
lnoval.3	⊢ 𝐺 = ( +𝑣 ‘𝑈)
lnoval.4	⊢ 𝐻 = ( +𝑣 ‘𝑊)
lnoval.5	⊢ 𝑅 = ( ·𝑠OLD ‘𝑈)
lnoval.6	⊢ 𝑆 = ( ·𝑠OLD ‘𝑊)
lnoval.7	⊢ 𝐿 = (𝑈 LnOp 𝑊)

Assertion

Ref	Expression
islno	⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → (𝑇 ∈ 𝐿 ↔ (𝑇:𝑋⟶𝑌 ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑇‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑇‘𝑦))𝐻(𝑇‘𝑧)))))

Distinct variable groups:   𝑥,𝑦,𝑧,𝑈   𝑥,𝑊,𝑦,𝑧   𝑦,𝑋,𝑧   𝑥,𝑇,𝑦,𝑧

Allowed substitution hints:   𝑅(𝑥, 𝑦, 𝑧)   𝑆(𝑥, 𝑦, 𝑧)   𝐺(𝑥, 𝑦, 𝑧)   𝐻(𝑥, 𝑦, 𝑧)   𝐿(𝑥, 𝑦, 𝑧)   𝑋(𝑥)   𝑌(𝑥, 𝑦, 𝑧)

Proof of Theorem islno

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		lnoval.1	. . . 4 ⊢ 𝑋 = (BaseSet‘𝑈)
2		lnoval.2	. . . 4 ⊢ 𝑌 = (BaseSet‘𝑊)
3		lnoval.3	. . . 4 ⊢ 𝐺 = ( +𝑣 ‘𝑈)
4		lnoval.4	. . . 4 ⊢ 𝐻 = ( +𝑣 ‘𝑊)
5		lnoval.5	. . . 4 ⊢ 𝑅 = ( ·𝑠OLD ‘𝑈)
6		lnoval.6	. . . 4 ⊢ 𝑆 = ( ·𝑠OLD ‘𝑊)
7		lnoval.7	. . . 4 ⊢ 𝐿 = (𝑈 LnOp 𝑊)
8	1, 2, 3, 4, 5, 6, 7	lnoval 31381	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → 𝐿 = {𝑤 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑤‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑤‘𝑦))𝐻(𝑤‘𝑧))})
9	8	eleq2d 2850	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → (𝑇 ∈ 𝐿 ↔ 𝑇 ∈ {𝑤 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑤‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑤‘𝑦))𝐻(𝑤‘𝑧))}))
10		fveq1 6904	. . . . . . 7 ⊢ (𝑤 = 𝑇 → (𝑤‘((𝑥𝑅𝑦)𝐺𝑧)) = (𝑇‘((𝑥𝑅𝑦)𝐺𝑧)))
11		fveq1 6904	. . . . . . . . 9 ⊢ (𝑤 = 𝑇 → (𝑤‘𝑦) = (𝑇‘𝑦))
12	11	oveq2d 7456	. . . . . . . 8 ⊢ (𝑤 = 𝑇 → (𝑥𝑆(𝑤‘𝑦)) = (𝑥𝑆(𝑇‘𝑦)))
13		fveq1 6904	. . . . . . . 8 ⊢ (𝑤 = 𝑇 → (𝑤‘𝑧) = (𝑇‘𝑧))
14	12, 13	oveq12d 7458	. . . . . . 7 ⊢ (𝑤 = 𝑇 → ((𝑥𝑆(𝑤‘𝑦))𝐻(𝑤‘𝑧)) = ((𝑥𝑆(𝑇‘𝑦))𝐻(𝑇‘𝑧)))
15	10, 14	eqeq12d 2779	. . . . . 6 ⊢ (𝑤 = 𝑇 → ((𝑤‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑤‘𝑦))𝐻(𝑤‘𝑧)) ↔ (𝑇‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑇‘𝑦))𝐻(𝑇‘𝑧))))
16	15	2ralbidv 3230	. . . . 5 ⊢ (𝑤 = 𝑇 → (∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑤‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑤‘𝑦))𝐻(𝑤‘𝑧)) ↔ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑇‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑇‘𝑦))𝐻(𝑇‘𝑧))))
17	16	ralbidv 3189	. . . 4 ⊢ (𝑤 = 𝑇 → (∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑤‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑤‘𝑦))𝐻(𝑤‘𝑧)) ↔ ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑇‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑇‘𝑦))𝐻(𝑇‘𝑧))))
18	17	elrab 3648	. . 3 ⊢ (𝑇 ∈ {𝑤 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑤‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑤‘𝑦))𝐻(𝑤‘𝑧))} ↔ (𝑇 ∈ (𝑌 ↑m 𝑋) ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑇‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑇‘𝑦))𝐻(𝑇‘𝑧))))
19	2	fvexi 6919	. . . . 5 ⊢ 𝑌 ∈ V
20	1	fvexi 6919	. . . . 5 ⊢ 𝑋 ∈ V
21	19, 20	elmap 8924	. . . 4 ⊢ (𝑇 ∈ (𝑌 ↑m 𝑋) ↔ 𝑇:𝑋⟶𝑌)
22	21	anbi1i 636	. . 3 ⊢ ((𝑇 ∈ (𝑌 ↑m 𝑋) ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑇‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑇‘𝑦))𝐻(𝑇‘𝑧))) ↔ (𝑇:𝑋⟶𝑌 ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑇‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑇‘𝑦))𝐻(𝑇‘𝑧))))
23	18, 22	bitri 278	. 2 ⊢ (𝑇 ∈ {𝑤 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑤‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑤‘𝑦))𝐻(𝑤‘𝑧))} ↔ (𝑇:𝑋⟶𝑌 ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑇‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑇‘𝑦))𝐻(𝑇‘𝑧))))
24	9, 23	bitrdi 290	1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → (𝑇 ∈ 𝐿 ↔ (𝑇:𝑋⟶𝑌 ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑇‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑇‘𝑦))𝐻(𝑇‘𝑧)))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  {crab 3416  ⟶wf 6551  ‘cfv 6555  (class class class)co 7440   ↑_m cmap 8872  ℂcc 11222  NrmCVeccnv 31213   +_𝑣 cpv 31214  BaseSetcba 31215   ·_𝑠OLD cns 31216   LnOp clno 31369

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-fv 6563  df-ov 7443  df-oprab 7444  df-mpo 7445  df-map 8874  df-lno 31373

This theorem is used by:  lnolin  31383  lnof  31384  lnocoi  31386  0lno  31419  ipblnfi  31484