| 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 2729 | . . . . 5 ⊢ (Scalar‘𝑇) = (Scalar‘𝑇) | |
| 6 | islindf5.v | . . . . 5 ⊢ · = ( ·𝑠 ‘𝑇) | |
| 7 | eqid 2729 | . . . . 5 ⊢ (0g‘𝑇) = (0g‘𝑇) | |
| 8 | eqid 2729 | . . . . 5 ⊢ (0g‘(Scalar‘𝑇)) = (0g‘(Scalar‘𝑇)) | |
| 9 | eqid 2729 | . . . . 5 ⊢ (Base‘((Scalar‘𝑇) freeLMod 𝐼)) = (Base‘((Scalar‘𝑇) freeLMod 𝐼)) | |
| 10 | 4, 5, 6, 7, 8, 9 | islindf4 21747 | . . . 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 7394 | . . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → (𝑥 ∘f · 𝐴) = (𝑦 ∘f · 𝐴)) | |
| 13 | 12 | oveq2d 7403 | . . . . . . . . 9 ⊢ (𝑥 = 𝑦 → (𝑇 Σg (𝑥 ∘f · 𝐴)) = (𝑇 Σg (𝑦 ∘f · 𝐴))) |
| 14 | islindf5.e | . . . . . . . . 9 ⊢ 𝐸 = (𝑥 ∈ 𝐵 ↦ (𝑇 Σg (𝑥 ∘f · 𝐴))) | |
| 15 | ovex 7420 | . . . . . . . . 9 ⊢ (𝑇 Σg (𝑦 ∘f · 𝐴)) ∈ V | |
| 16 | 13, 14, 15 | fvmpt 6968 | . . . . . . . 8 ⊢ (𝑦 ∈ 𝐵 → (𝐸‘𝑦) = (𝑇 Σg (𝑦 ∘f · 𝐴))) |
| 17 | 16 | adantl 481 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (𝐸‘𝑦) = (𝑇 Σg (𝑦 ∘f · 𝐴))) |
| 18 | 17 | eqeq1d 2731 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → ((𝐸‘𝑦) = (0g‘𝑇) ↔ (𝑇 Σg (𝑦 ∘f · 𝐴)) = (0g‘𝑇))) |
| 19 | islindf5.r | . . . . . . . . . . 11 ⊢ (𝜑 → 𝑅 = (Scalar‘𝑇)) | |
| 20 | 5 | lmodring 20774 | . . . . . . . . . . . 12 ⊢ (𝑇 ∈ LMod → (Scalar‘𝑇) ∈ Ring) |
| 21 | 1, 20 | syl 17 | . . . . . . . . . . 11 ⊢ (𝜑 → (Scalar‘𝑇) ∈ Ring) |
| 22 | 19, 21 | eqeltrd 2828 | . . . . . . . . . 10 ⊢ (𝜑 → 𝑅 ∈ Ring) |
| 23 | islindf5.f | . . . . . . . . . . 11 ⊢ 𝐹 = (𝑅 freeLMod 𝐼) | |
| 24 | eqid 2729 | . . . . . . . . . . 11 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
| 25 | 23, 24 | frlm0 21663 | . . . . . . . . . 10 ⊢ ((𝑅 ∈ Ring ∧ 𝐼 ∈ 𝑋) → (𝐼 × {(0g‘𝑅)}) = (0g‘𝐹)) |
| 26 | 22, 2, 25 | syl2anc 584 | . . . . . . . . 9 ⊢ (𝜑 → (𝐼 × {(0g‘𝑅)}) = (0g‘𝐹)) |
| 27 | 19 | fveq2d 6862 | . . . . . . . . . . 11 ⊢ (𝜑 → (0g‘𝑅) = (0g‘(Scalar‘𝑇))) |
| 28 | 27 | sneqd 4601 | . . . . . . . . . 10 ⊢ (𝜑 → {(0g‘𝑅)} = {(0g‘(Scalar‘𝑇))}) |
| 29 | 28 | xpeq2d 5668 | . . . . . . . . 9 ⊢ (𝜑 → (𝐼 × {(0g‘𝑅)}) = (𝐼 × {(0g‘(Scalar‘𝑇))})) |
| 30 | 26, 29 | eqtr3d 2766 | . . . . . . . 8 ⊢ (𝜑 → (0g‘𝐹) = (𝐼 × {(0g‘(Scalar‘𝑇))})) |
| 31 | 30 | adantr 480 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (0g‘𝐹) = (𝐼 × {(0g‘(Scalar‘𝑇))})) |
| 32 | 31 | eqeq2d 2740 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (𝑦 = (0g‘𝐹) ↔ 𝑦 = (𝐼 × {(0g‘(Scalar‘𝑇))}))) |
| 33 | 18, 32 | imbi12d 344 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (((𝐸‘𝑦) = (0g‘𝑇) → 𝑦 = (0g‘𝐹)) ↔ ((𝑇 Σg (𝑦 ∘f · 𝐴)) = (0g‘𝑇) → 𝑦 = (𝐼 × {(0g‘(Scalar‘𝑇))})))) |
| 34 | 33 | ralbidva 3154 | . . . 4 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 ((𝐸‘𝑦) = (0g‘𝑇) → 𝑦 = (0g‘𝐹)) ↔ ∀𝑦 ∈ 𝐵 ((𝑇 Σg (𝑦 ∘f · 𝐴)) = (0g‘𝑇) → 𝑦 = (𝐼 × {(0g‘(Scalar‘𝑇))})))) |
| 35 | 19 | eqcomd 2735 | . . . . . . . . 9 ⊢ (𝜑 → (Scalar‘𝑇) = 𝑅) |
| 36 | 35 | oveq1d 7402 | . . . . . . . 8 ⊢ (𝜑 → ((Scalar‘𝑇) freeLMod 𝐼) = (𝑅 freeLMod 𝐼)) |
| 37 | 36, 23 | eqtr4di 2782 | . . . . . . 7 ⊢ (𝜑 → ((Scalar‘𝑇) freeLMod 𝐼) = 𝐹) |
| 38 | 37 | fveq2d 6862 | . . . . . 6 ⊢ (𝜑 → (Base‘((Scalar‘𝑇) freeLMod 𝐼)) = (Base‘𝐹)) |
| 39 | islindf5.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐹) | |
| 40 | 38, 39 | eqtr4di 2782 | . . . . 5 ⊢ (𝜑 → (Base‘((Scalar‘𝑇) freeLMod 𝐼)) = 𝐵) |
| 41 | 40 | raleqdv 3299 | . . . 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 21707 | . . 3 ⊢ (𝜑 → 𝐸 ∈ (𝐹 LMHom 𝑇)) |
| 45 | lmghm 20938 | . . 3 ⊢ (𝐸 ∈ (𝐹 LMHom 𝑇) → 𝐸 ∈ (𝐹 GrpHom 𝑇)) | |
| 46 | eqid 2729 | . . . 4 ⊢ (0g‘𝐹) = (0g‘𝐹) | |
| 47 | 39, 4, 46, 7 | ghmf1 19178 | . . 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 1540 ∈ wcel 2109 ∀wral 3044 {csn 4589 class class class wbr 5107 ↦ cmpt 5188 × cxp 5636 ⟶wf 6507 –1-1→wf1 6508 ‘cfv 6511 (class class class)co 7387 ∘f cof 7651 Basecbs 17179 Scalarcsca 17223 ·𝑠 cvsca 17224 0gc0g 17402 Σg cgsu 17403 GrpHom cghm 19144 Ringcrg 20142 LModclmod 20766 LMHom clmhm 20926 freeLMod cfrlm 21655 LIndF clindf 21713 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5234 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 ax-cnex 11124 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 ax-pre-mulgt0 11145 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3354 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-tp 4594 df-op 4596 df-uni 4872 df-int 4911 df-iun 4957 df-iin 4958 df-br 5108 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5533 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-se 5592 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6274 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-isom 6520 df-riota 7344 df-ov 7390 df-oprab 7391 df-mpo 7392 df-of 7653 df-om 7843 df-1st 7968 df-2nd 7969 df-supp 8140 df-frecs 8260 df-wrecs 8291 df-recs 8340 df-rdg 8378 df-1o 8434 df-2o 8435 df-er 8671 df-map 8801 df-ixp 8871 df-en 8919 df-dom 8920 df-sdom 8921 df-fin 8922 df-fsupp 9313 df-sup 9393 df-oi 9463 df-card 9892 df-pnf 11210 df-mnf 11211 df-xr 11212 df-ltxr 11213 df-le 11214 df-sub 11407 df-neg 11408 df-nn 12187 df-2 12249 df-3 12250 df-4 12251 df-5 12252 df-6 12253 df-7 12254 df-8 12255 df-9 12256 df-n0 12443 df-z 12530 df-dec 12650 df-uz 12794 df-fz 13469 df-fzo 13616 df-seq 13967 df-hash 14296 df-struct 17117 df-sets 17134 df-slot 17152 df-ndx 17164 df-base 17180 df-ress 17201 df-plusg 17233 df-mulr 17234 df-sca 17236 df-vsca 17237 df-ip 17238 df-tset 17239 df-ple 17240 df-ds 17242 df-hom 17244 df-cco 17245 df-0g 17404 df-gsum 17405 df-prds 17410 df-pws 17412 df-mre 17547 df-mrc 17548 df-acs 17550 df-mgm 18567 df-sgrp 18646 df-mnd 18662 df-mhm 18710 df-submnd 18711 df-grp 18868 df-minusg 18869 df-sbg 18870 df-mulg 19000 df-subg 19055 df-ghm 19145 df-cntz 19249 df-cmn 19712 df-abl 19713 df-mgp 20050 df-rng 20062 df-ur 20091 df-ring 20144 df-nzr 20422 df-subrg 20479 df-lmod 20768 df-lss 20838 df-lsp 20878 df-lmhm 20929 df-lbs 20982 df-sra 21080 df-rgmod 21081 df-dsmm 21641 df-frlm 21656 df-uvc 21692 df-lindf 21715 |
| This theorem is referenced by: indlcim 21749 |
| Copyright terms: Public domain | W3C validator |