Theorem lmhmclm 25277

Description: The domain of a linear operator is a subcomplex module iff the range is. (Contributed by Mario Carneiro, 21-Oct-2015.)

Assertion

Ref	Expression
lmhmclm	⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → (𝑆 ∈ ℂMod ↔ 𝑇 ∈ ℂMod))

Proof of Theorem lmhmclm

Step	Hyp	Ref	Expression
1		lmhmlmod1 21184	. . . 4 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝑆 ∈ LMod)
2		lmhmlmod2 21183	. . . 4 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝑇 ∈ LMod)
3	1, 2	2thd 268	. . 3 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → (𝑆 ∈ LMod ↔ 𝑇 ∈ LMod))
4		eqid 2765	. . . . . 6 ⊢ (Scalar‘𝑆) = (Scalar‘𝑆)
5		eqid 2765	. . . . . 6 ⊢ (Scalar‘𝑇) = (Scalar‘𝑇)
6	4, 5	lmhmsca 21181	. . . . 5 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → (Scalar‘𝑇) = (Scalar‘𝑆))
7	6	eqcomd 2771	. . . 4 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → (Scalar‘𝑆) = (Scalar‘𝑇))
8	7	fveq2d 6889	. . . . 5 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → (Base‘(Scalar‘𝑆)) = (Base‘(Scalar‘𝑇)))
9	8	oveq2d 7432	. . . 4 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → (ℂfld ↾s (Base‘(Scalar‘𝑆))) = (ℂfld ↾s (Base‘(Scalar‘𝑇))))
10	7, 9	eqeq12d 2781	. . 3 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → ((Scalar‘𝑆) = (ℂfld ↾s (Base‘(Scalar‘𝑆))) ↔ (Scalar‘𝑇) = (ℂfld ↾s (Base‘(Scalar‘𝑇)))))
11	8	eleq1d 2850	. . 3 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → ((Base‘(Scalar‘𝑆)) ∈ (SubRing‘ℂfld) ↔ (Base‘(Scalar‘𝑇)) ∈ (SubRing‘ℂfld)))
12	3, 10, 11	3anbi123d 1464	. 2 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → ((𝑆 ∈ LMod ∧ (Scalar‘𝑆) = (ℂfld ↾s (Base‘(Scalar‘𝑆))) ∧ (Base‘(Scalar‘𝑆)) ∈ (SubRing‘ℂfld)) ↔ (𝑇 ∈ LMod ∧ (Scalar‘𝑇) = (ℂfld ↾s (Base‘(Scalar‘𝑇))) ∧ (Base‘(Scalar‘𝑇)) ∈ (SubRing‘ℂfld))))
13		eqid 2765	. . 3 ⊢ (Base‘(Scalar‘𝑆)) = (Base‘(Scalar‘𝑆))
14	4, 13	isclm 25254	. 2 ⊢ (𝑆 ∈ ℂMod ↔ (𝑆 ∈ LMod ∧ (Scalar‘𝑆) = (ℂfld ↾s (Base‘(Scalar‘𝑆))) ∧ (Base‘(Scalar‘𝑆)) ∈ (SubRing‘ℂfld)))
15		eqid 2765	. . 3 ⊢ (Base‘(Scalar‘𝑇)) = (Base‘(Scalar‘𝑇))
16	5, 15	isclm 25254	. 2 ⊢ (𝑇 ∈ ℂMod ↔ (𝑇 ∈ LMod ∧ (Scalar‘𝑇) = (ℂfld ↾s (Base‘(Scalar‘𝑇))) ∧ (Base‘(Scalar‘𝑇)) ∈ (SubRing‘ℂfld)))
17	12, 14, 16	3bitr4g 317	1 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → (𝑆 ∈ ℂMod ↔ 𝑇 ∈ ℂMod))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146  ‘cfv 6540  (class class class)co 7416  Basecbs 17287   ↾_s cress 17308  Scalarcsca 17331  SubRingcsubrg 20698  LModclmod 21011   LMHom clmhm 21170  ℂ_fldccnfld 21552  ℂModcclm 25252

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-sep 5259  ax-nul 5271  ax-pr 5406

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 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-iota 6496  df-fun 6542  df-fv 6548  df-ov 7419  df-oprab 7420  df-mpo 7421  df-lmhm 21173  df-clm 25253

This theorem is used by: (None)