Theorem islno 31114

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 31113	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → 𝐿 = {𝑤 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑤‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑤‘𝑦))𝐻(𝑤‘𝑧))})
9	8	eleq2d 2849	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → (𝑇 ∈ 𝐿 ↔ 𝑇 ∈ {𝑤 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑤‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑤‘𝑦))𝐻(𝑤‘𝑧))}))
10		fveq1 6880	. . . . . . 7 ⊢ (𝑤 = 𝑇 → (𝑤‘((𝑥𝑅𝑦)𝐺𝑧)) = (𝑇‘((𝑥𝑅𝑦)𝐺𝑧)))
11		fveq1 6880	. . . . . . . . 9 ⊢ (𝑤 = 𝑇 → (𝑤‘𝑦) = (𝑇‘𝑦))
12	11	oveq2d 7426	. . . . . . . 8 ⊢ (𝑤 = 𝑇 → (𝑥𝑆(𝑤‘𝑦)) = (𝑥𝑆(𝑇‘𝑦)))
13		fveq1 6880	. . . . . . . 8 ⊢ (𝑤 = 𝑇 → (𝑤‘𝑧) = (𝑇‘𝑧))
14	12, 13	oveq12d 7428	. . . . . . 7 ⊢ (𝑤 = 𝑇 → ((𝑥𝑆(𝑤‘𝑦))𝐻(𝑤‘𝑧)) = ((𝑥𝑆(𝑇‘𝑦))𝐻(𝑇‘𝑧)))
15	10, 14	eqeq12d 2779	. . . . . 6 ⊢ (𝑤 = 𝑇 → ((𝑤‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑤‘𝑦))𝐻(𝑤‘𝑧)) ↔ (𝑇‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑇‘𝑦))𝐻(𝑇‘𝑧))))
16	15	2ralbidv 3229	. . . . 5 ⊢ (𝑤 = 𝑇 → (∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑤‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑤‘𝑦))𝐻(𝑤‘𝑧)) ↔ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑇‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑇‘𝑦))𝐻(𝑇‘𝑧))))
17	16	ralbidv 3188	. . . 4 ⊢ (𝑤 = 𝑇 → (∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑤‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑤‘𝑦))𝐻(𝑤‘𝑧)) ↔ ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑇‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑇‘𝑦))𝐻(𝑇‘𝑧))))
18	17	elrab 3650	. . 3 ⊢ (𝑇 ∈ {𝑤 ∈ (𝑌 ↑m 𝑋) ∣ ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑤‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑤‘𝑦))𝐻(𝑤‘𝑧))} ↔ (𝑇 ∈ (𝑌 ↑m 𝑋) ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑇‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑇‘𝑦))𝐻(𝑇‘𝑧))))
19	2	fvexi 6895	. . . . 5 ⊢ 𝑌 ∈ V
20	1	fvexi 6895	. . . . 5 ⊢ 𝑋 ∈ V
21	19, 20	elmap 8865	. . . 4 ⊢ (𝑇 ∈ (𝑌 ↑m 𝑋) ↔ 𝑇:𝑋⟶𝑌)
22	21	anbi1i 635	. . 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 400   = wceq 1570   ∈ wcel 2143  ∀wral 3079  {crab 3416  ⟶wf 6532  ‘cfv 6536  (class class class)co 7410   ↑_m cmap 8820  ℂcc 11102  NrmCVeccnv 30945   +_𝑣 cpv 30946  BaseSetcba 30947   ·_𝑠OLD cns 30948   LnOp clno 31101

This proof depends on 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-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  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-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-sbc 3745  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-map 8822  df-lno 31105

This theorem is used by:  lnolin  31115  lnof  31116  lnocoi  31118  0lno  31151  ipblnfi  31216