| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > islindf5 | Structured version Visualization version GIF version | ||
| Description: A family is independent iff the linear combinations homomorphism is injective. (Contributed by Stefan O'Rear, 28-Feb-2015.) |
| Ref | Expression |
|---|---|
| islindf5.f | ⊢ 𝐹 = (𝑅 freeLMod 𝐼) |
| islindf5.b | ⊢ 𝐵 = (Base‘𝐹) |
| islindf5.c | ⊢ 𝐶 = (Base‘𝑇) |
| islindf5.v | ⊢ · = ( ·𝑠 ‘𝑇) |
| islindf5.e | ⊢ 𝐸 = (𝑥 ∈ 𝐵 ↦ (𝑇 Σg (𝑥 ∘f · 𝐴))) |
| islindf5.t | ⊢ (𝜑 → 𝑇 ∈ LMod) |
| islindf5.i | ⊢ (𝜑 → 𝐼 ∈ 𝑋) |
| islindf5.r | ⊢ (𝜑 → 𝑅 = (Scalar‘𝑇)) |
| islindf5.a | ⊢ (𝜑 → 𝐴:𝐼⟶𝐶) |
| Ref | Expression |
|---|---|
| islindf5 | ⊢ (𝜑 → (𝐴 LIndF 𝑇 ↔ 𝐸:𝐵–1-1→𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | islindf5.t | . . . 4 ⊢ (𝜑 → 𝑇 ∈ LMod) | |
| 2 | islindf5.i | . . . 4 ⊢ (𝜑 → 𝐼 ∈ 𝑋) | |
| 3 | islindf5.a | . . . 4 ⊢ (𝜑 → 𝐴:𝐼⟶𝐶) | |
| 4 | islindf5.c | . . . . 5 ⊢ 𝐶 = (Base‘𝑇) | |
| 5 | eqid 2736 | . . . . 5 ⊢ (Scalar‘𝑇) = (Scalar‘𝑇) | |
| 6 | islindf5.v | . . . . 5 ⊢ · = ( ·𝑠 ‘𝑇) | |
| 7 | eqid 2736 | . . . . 5 ⊢ (0g‘𝑇) = (0g‘𝑇) | |
| 8 | eqid 2736 | . . . . 5 ⊢ (0g‘(Scalar‘𝑇)) = (0g‘(Scalar‘𝑇)) | |
| 9 | eqid 2736 | . . . . 5 ⊢ (Base‘((Scalar‘𝑇) freeLMod 𝐼)) = (Base‘((Scalar‘𝑇) freeLMod 𝐼)) | |
| 10 | 4, 5, 6, 7, 8, 9 | islindf4 21793 | . . . 4 ⊢ ((𝑇 ∈ LMod ∧ 𝐼 ∈ 𝑋 ∧ 𝐴:𝐼⟶𝐶) → (𝐴 LIndF 𝑇 ↔ ∀𝑦 ∈ (Base‘((Scalar‘𝑇) freeLMod 𝐼))((𝑇 Σg (𝑦 ∘f · 𝐴)) = (0g‘𝑇) → 𝑦 = (𝐼 × {(0g‘(Scalar‘𝑇))})))) |
| 11 | 1, 2, 3, 10 | syl3anc 1373 | . . 3 ⊢ (𝜑 → (𝐴 LIndF 𝑇 ↔ ∀𝑦 ∈ (Base‘((Scalar‘𝑇) freeLMod 𝐼))((𝑇 Σg (𝑦 ∘f · 𝐴)) = (0g‘𝑇) → 𝑦 = (𝐼 × {(0g‘(Scalar‘𝑇))})))) |
| 12 | oveq1 7365 | . . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → (𝑥 ∘f · 𝐴) = (𝑦 ∘f · 𝐴)) | |
| 13 | 12 | oveq2d 7374 | . . . . . . . . 9 ⊢ (𝑥 = 𝑦 → (𝑇 Σg (𝑥 ∘f · 𝐴)) = (𝑇 Σg (𝑦 ∘f · 𝐴))) |
| 14 | islindf5.e | . . . . . . . . 9 ⊢ 𝐸 = (𝑥 ∈ 𝐵 ↦ (𝑇 Σg (𝑥 ∘f · 𝐴))) | |
| 15 | ovex 7391 | . . . . . . . . 9 ⊢ (𝑇 Σg (𝑦 ∘f · 𝐴)) ∈ V | |
| 16 | 13, 14, 15 | fvmpt 6941 | . . . . . . . 8 ⊢ (𝑦 ∈ 𝐵 → (𝐸‘𝑦) = (𝑇 Σg (𝑦 ∘f · 𝐴))) |
| 17 | 16 | adantl 481 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (𝐸‘𝑦) = (𝑇 Σg (𝑦 ∘f · 𝐴))) |
| 18 | 17 | eqeq1d 2738 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → ((𝐸‘𝑦) = (0g‘𝑇) ↔ (𝑇 Σg (𝑦 ∘f · 𝐴)) = (0g‘𝑇))) |
| 19 | islindf5.r | . . . . . . . . . . 11 ⊢ (𝜑 → 𝑅 = (Scalar‘𝑇)) | |
| 20 | 5 | lmodring 20819 | . . . . . . . . . . . 12 ⊢ (𝑇 ∈ LMod → (Scalar‘𝑇) ∈ Ring) |
| 21 | 1, 20 | syl 17 | . . . . . . . . . . 11 ⊢ (𝜑 → (Scalar‘𝑇) ∈ Ring) |
| 22 | 19, 21 | eqeltrd 2836 | . . . . . . . . . 10 ⊢ (𝜑 → 𝑅 ∈ Ring) |
| 23 | islindf5.f | . . . . . . . . . . 11 ⊢ 𝐹 = (𝑅 freeLMod 𝐼) | |
| 24 | eqid 2736 | . . . . . . . . . . 11 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
| 25 | 23, 24 | frlm0 21709 | . . . . . . . . . 10 ⊢ ((𝑅 ∈ Ring ∧ 𝐼 ∈ 𝑋) → (𝐼 × {(0g‘𝑅)}) = (0g‘𝐹)) |
| 26 | 22, 2, 25 | syl2anc 584 | . . . . . . . . 9 ⊢ (𝜑 → (𝐼 × {(0g‘𝑅)}) = (0g‘𝐹)) |
| 27 | 19 | fveq2d 6838 | . . . . . . . . . . 11 ⊢ (𝜑 → (0g‘𝑅) = (0g‘(Scalar‘𝑇))) |
| 28 | 27 | sneqd 4592 | . . . . . . . . . 10 ⊢ (𝜑 → {(0g‘𝑅)} = {(0g‘(Scalar‘𝑇))}) |
| 29 | 28 | xpeq2d 5654 | . . . . . . . . 9 ⊢ (𝜑 → (𝐼 × {(0g‘𝑅)}) = (𝐼 × {(0g‘(Scalar‘𝑇))})) |
| 30 | 26, 29 | eqtr3d 2773 | . . . . . . . 8 ⊢ (𝜑 → (0g‘𝐹) = (𝐼 × {(0g‘(Scalar‘𝑇))})) |
| 31 | 30 | adantr 480 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (0g‘𝐹) = (𝐼 × {(0g‘(Scalar‘𝑇))})) |
| 32 | 31 | eqeq2d 2747 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (𝑦 = (0g‘𝐹) ↔ 𝑦 = (𝐼 × {(0g‘(Scalar‘𝑇))}))) |
| 33 | 18, 32 | imbi12d 344 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (((𝐸‘𝑦) = (0g‘𝑇) → 𝑦 = (0g‘𝐹)) ↔ ((𝑇 Σg (𝑦 ∘f · 𝐴)) = (0g‘𝑇) → 𝑦 = (𝐼 × {(0g‘(Scalar‘𝑇))})))) |
| 34 | 33 | ralbidva 3157 | . . . 4 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 ((𝐸‘𝑦) = (0g‘𝑇) → 𝑦 = (0g‘𝐹)) ↔ ∀𝑦 ∈ 𝐵 ((𝑇 Σg (𝑦 ∘f · 𝐴)) = (0g‘𝑇) → 𝑦 = (𝐼 × {(0g‘(Scalar‘𝑇))})))) |
| 35 | 19 | eqcomd 2742 | . . . . . . . . 9 ⊢ (𝜑 → (Scalar‘𝑇) = 𝑅) |
| 36 | 35 | oveq1d 7373 | . . . . . . . 8 ⊢ (𝜑 → ((Scalar‘𝑇) freeLMod 𝐼) = (𝑅 freeLMod 𝐼)) |
| 37 | 36, 23 | eqtr4di 2789 | . . . . . . 7 ⊢ (𝜑 → ((Scalar‘𝑇) freeLMod 𝐼) = 𝐹) |
| 38 | 37 | fveq2d 6838 | . . . . . 6 ⊢ (𝜑 → (Base‘((Scalar‘𝑇) freeLMod 𝐼)) = (Base‘𝐹)) |
| 39 | islindf5.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐹) | |
| 40 | 38, 39 | eqtr4di 2789 | . . . . 5 ⊢ (𝜑 → (Base‘((Scalar‘𝑇) freeLMod 𝐼)) = 𝐵) |
| 41 | 40 | raleqdv 3296 | . . . 4 ⊢ (𝜑 → (∀𝑦 ∈ (Base‘((Scalar‘𝑇) freeLMod 𝐼))((𝑇 Σg (𝑦 ∘f · 𝐴)) = (0g‘𝑇) → 𝑦 = (𝐼 × {(0g‘(Scalar‘𝑇))})) ↔ ∀𝑦 ∈ 𝐵 ((𝑇 Σg (𝑦 ∘f · 𝐴)) = (0g‘𝑇) → 𝑦 = (𝐼 × {(0g‘(Scalar‘𝑇))})))) |
| 42 | 34, 41 | bitr4d 282 | . . 3 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 ((𝐸‘𝑦) = (0g‘𝑇) → 𝑦 = (0g‘𝐹)) ↔ ∀𝑦 ∈ (Base‘((Scalar‘𝑇) freeLMod 𝐼))((𝑇 Σg (𝑦 ∘f · 𝐴)) = (0g‘𝑇) → 𝑦 = (𝐼 × {(0g‘(Scalar‘𝑇))})))) |
| 43 | 11, 42 | bitr4d 282 | . 2 ⊢ (𝜑 → (𝐴 LIndF 𝑇 ↔ ∀𝑦 ∈ 𝐵 ((𝐸‘𝑦) = (0g‘𝑇) → 𝑦 = (0g‘𝐹)))) |
| 44 | 23, 39, 4, 6, 14, 1, 2, 19, 3 | frlmup1 21753 | . . 3 ⊢ (𝜑 → 𝐸 ∈ (𝐹 LMHom 𝑇)) |
| 45 | lmghm 20983 | . . 3 ⊢ (𝐸 ∈ (𝐹 LMHom 𝑇) → 𝐸 ∈ (𝐹 GrpHom 𝑇)) | |
| 46 | eqid 2736 | . . . 4 ⊢ (0g‘𝐹) = (0g‘𝐹) | |
| 47 | 39, 4, 46, 7 | ghmf1 19175 | . . 3 ⊢ (𝐸 ∈ (𝐹 GrpHom 𝑇) → (𝐸:𝐵–1-1→𝐶 ↔ ∀𝑦 ∈ 𝐵 ((𝐸‘𝑦) = (0g‘𝑇) → 𝑦 = (0g‘𝐹)))) |
| 48 | 44, 45, 47 | 3syl 18 | . 2 ⊢ (𝜑 → (𝐸:𝐵–1-1→𝐶 ↔ ∀𝑦 ∈ 𝐵 ((𝐸‘𝑦) = (0g‘𝑇) → 𝑦 = (0g‘𝐹)))) |
| 49 | 43, 48 | bitr4d 282 | 1 ⊢ (𝜑 → (𝐴 LIndF 𝑇 ↔ 𝐸:𝐵–1-1→𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∀wral 3051 {csn 4580 class class class wbr 5098 ↦ cmpt 5179 × cxp 5622 ⟶wf 6488 –1-1→wf1 6489 ‘cfv 6492 (class class class)co 7358 ∘f cof 7620 Basecbs 17136 Scalarcsca 17180 ·𝑠 cvsca 17181 0gc0g 17359 Σg cgsu 17360 GrpHom cghm 19141 Ringcrg 20168 LModclmod 20811 LMHom clmhm 20971 freeLMod cfrlm 21701 LIndF clindf 21759 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-tp 4585 df-op 4587 df-uni 4864 df-int 4903 df-iun 4948 df-iin 4949 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-se 5578 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-isom 6501 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-of 7622 df-om 7809 df-1st 7933 df-2nd 7934 df-supp 8103 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-2o 8398 df-er 8635 df-map 8765 df-ixp 8836 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-fsupp 9265 df-sup 9345 df-oi 9415 df-card 9851 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-nn 12146 df-2 12208 df-3 12209 df-4 12210 df-5 12211 df-6 12212 df-7 12213 df-8 12214 df-9 12215 df-n0 12402 df-z 12489 df-dec 12608 df-uz 12752 df-fz 13424 df-fzo 13571 df-seq 13925 df-hash 14254 df-struct 17074 df-sets 17091 df-slot 17109 df-ndx 17121 df-base 17137 df-ress 17158 df-plusg 17190 df-mulr 17191 df-sca 17193 df-vsca 17194 df-ip 17195 df-tset 17196 df-ple 17197 df-ds 17199 df-hom 17201 df-cco 17202 df-0g 17361 df-gsum 17362 df-prds 17367 df-pws 17369 df-mre 17505 df-mrc 17506 df-acs 17508 df-mgm 18565 df-sgrp 18644 df-mnd 18660 df-mhm 18708 df-submnd 18709 df-grp 18866 df-minusg 18867 df-sbg 18868 df-mulg 18998 df-subg 19053 df-ghm 19142 df-cntz 19246 df-cmn 19711 df-abl 19712 df-mgp 20076 df-rng 20088 df-ur 20117 df-ring 20170 df-nzr 20446 df-subrg 20503 df-lmod 20813 df-lss 20883 df-lsp 20923 df-lmhm 20974 df-lbs 21027 df-sra 21125 df-rgmod 21126 df-dsmm 21687 df-frlm 21702 df-uvc 21738 df-lindf 21761 |
| This theorem is referenced by: indlcim 21795 |
| Copyright terms: Public domain | W3C validator |