Theorem lmhmclm 25463

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 21359	. . . 4 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝑆 ∈ LMod)
2		lmhmlmod2 21358	. . . 4 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → 𝑇 ∈ LMod)
3	1, 2	2thd 268	. . 3 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → (𝑆 ∈ LMod ↔ 𝑇 ∈ LMod))
4		eqid 2763	. . . . . 6 ⊢ (Scalar‘𝑆) = (Scalar‘𝑆)
5		eqid 2763	. . . . . 6 ⊢ (Scalar‘𝑇) = (Scalar‘𝑇)
6	4, 5	lmhmsca 21356	. . . . 5 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → (Scalar‘𝑇) = (Scalar‘𝑆))
7	6	eqcomd 2769	. . . 4 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → (Scalar‘𝑆) = (Scalar‘𝑇))
8	7	fveq2d 6920	. . . . 5 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → (Base‘(Scalar‘𝑆)) = (Base‘(Scalar‘𝑇)))
9	8	oveq2d 7467	. . . 4 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → (ℂfld ↾s (Base‘(Scalar‘𝑆))) = (ℂfld ↾s (Base‘(Scalar‘𝑇))))
10	7, 9	eqeq12d 2779	. . 3 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → ((Scalar‘𝑆) = (ℂfld ↾s (Base‘(Scalar‘𝑆))) ↔ (Scalar‘𝑇) = (ℂfld ↾s (Base‘(Scalar‘𝑇)))))
11	8	eleq1d 2849	. . 3 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → ((Base‘(Scalar‘𝑆)) ∈ (SubRing‘ℂfld) ↔ (Base‘(Scalar‘𝑇)) ∈ (SubRing‘ℂfld)))
12	3, 10, 11	3anbi123d 1465	. 2 ⊢ (𝐹 ∈ (𝑆 LMHom 𝑇) → ((𝑆 ∈ LMod ∧ (Scalar‘𝑆) = (ℂfld ↾s (Base‘(Scalar‘𝑆))) ∧ (Base‘(Scalar‘𝑆)) ∈ (SubRing‘ℂfld)) ↔ (𝑇 ∈ LMod ∧ (Scalar‘𝑇) = (ℂfld ↾s (Base‘(Scalar‘𝑇))) ∧ (Base‘(Scalar‘𝑇)) ∈ (SubRing‘ℂfld))))
13		eqid 2763	. . 3 ⊢ (Base‘(Scalar‘𝑆)) = (Base‘(Scalar‘𝑆))
14	4, 13	isclm 25440	. 2 ⊢ (𝑆 ∈ ℂMod ↔ (𝑆 ∈ LMod ∧ (Scalar‘𝑆) = (ℂfld ↾s (Base‘(Scalar‘𝑆))) ∧ (Base‘(Scalar‘𝑆)) ∈ (SubRing‘ℂfld)))
15		eqid 2763	. . 3 ⊢ (Base‘(Scalar‘𝑇)) = (Base‘(Scalar‘𝑇))
16	5, 15	isclm 25440	. 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 2147  ‘cfv 6566  (class class class)co 7451  Basecbs 17431   ↾_s cress 17452  Scalarcsca 17475  SubRingcsubrg 20872  LModclmod 21186   LMHom clmhm 21345  ℂ_fldccnfld 21729  ℂModcclm 25438

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 5255  ax-nul 5266  ax-pr 5398

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 4841  df-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-lmhm 21348  df-clm 25439

This theorem is used by: (None)