Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > submabas | Structured version Visualization version GIF version |
Description: Any subset of the index set of a square matrix defines a submatrix of the matrix. (Contributed by AV, 1-Jan-2019.) |
Ref | Expression |
---|---|
submabas.a | ⊢ 𝐴 = (𝑁 Mat 𝑅) |
submabas.b | ⊢ 𝐵 = (Base‘𝐴) |
Ref | Expression |
---|---|
submabas | ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐷 ⊆ 𝑁) → (𝑖 ∈ 𝐷, 𝑗 ∈ 𝐷 ↦ (𝑖𝑀𝑗)) ∈ (Base‘(𝐷 Mat 𝑅))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2819 | . 2 ⊢ (𝐷 Mat 𝑅) = (𝐷 Mat 𝑅) | |
2 | eqid 2819 | . 2 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
3 | eqid 2819 | . 2 ⊢ (Base‘(𝐷 Mat 𝑅)) = (Base‘(𝐷 Mat 𝑅)) | |
4 | submabas.a | . . . . 5 ⊢ 𝐴 = (𝑁 Mat 𝑅) | |
5 | submabas.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐴) | |
6 | 4, 5 | matrcl 21013 | . . . 4 ⊢ (𝑀 ∈ 𝐵 → (𝑁 ∈ Fin ∧ 𝑅 ∈ V)) |
7 | 6 | simpld 497 | . . 3 ⊢ (𝑀 ∈ 𝐵 → 𝑁 ∈ Fin) |
8 | ssfi 8730 | . . 3 ⊢ ((𝑁 ∈ Fin ∧ 𝐷 ⊆ 𝑁) → 𝐷 ∈ Fin) | |
9 | 7, 8 | sylan 582 | . 2 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐷 ⊆ 𝑁) → 𝐷 ∈ Fin) |
10 | 6 | simprd 498 | . . 3 ⊢ (𝑀 ∈ 𝐵 → 𝑅 ∈ V) |
11 | 10 | adantr 483 | . 2 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐷 ⊆ 𝑁) → 𝑅 ∈ V) |
12 | ssel 3959 | . . . . . 6 ⊢ (𝐷 ⊆ 𝑁 → (𝑖 ∈ 𝐷 → 𝑖 ∈ 𝑁)) | |
13 | 12 | adantl 484 | . . . . 5 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐷 ⊆ 𝑁) → (𝑖 ∈ 𝐷 → 𝑖 ∈ 𝑁)) |
14 | 13 | imp 409 | . . . 4 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐷 ⊆ 𝑁) ∧ 𝑖 ∈ 𝐷) → 𝑖 ∈ 𝑁) |
15 | 14 | 3adant3 1127 | . . 3 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐷 ⊆ 𝑁) ∧ 𝑖 ∈ 𝐷 ∧ 𝑗 ∈ 𝐷) → 𝑖 ∈ 𝑁) |
16 | ssel 3959 | . . . . . 6 ⊢ (𝐷 ⊆ 𝑁 → (𝑗 ∈ 𝐷 → 𝑗 ∈ 𝑁)) | |
17 | 16 | adantl 484 | . . . . 5 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐷 ⊆ 𝑁) → (𝑗 ∈ 𝐷 → 𝑗 ∈ 𝑁)) |
18 | 17 | imp 409 | . . . 4 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐷 ⊆ 𝑁) ∧ 𝑗 ∈ 𝐷) → 𝑗 ∈ 𝑁) |
19 | 18 | 3adant2 1126 | . . 3 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐷 ⊆ 𝑁) ∧ 𝑖 ∈ 𝐷 ∧ 𝑗 ∈ 𝐷) → 𝑗 ∈ 𝑁) |
20 | 5 | eleq2i 2902 | . . . . . 6 ⊢ (𝑀 ∈ 𝐵 ↔ 𝑀 ∈ (Base‘𝐴)) |
21 | 20 | biimpi 218 | . . . . 5 ⊢ (𝑀 ∈ 𝐵 → 𝑀 ∈ (Base‘𝐴)) |
22 | 21 | adantr 483 | . . . 4 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐷 ⊆ 𝑁) → 𝑀 ∈ (Base‘𝐴)) |
23 | 22 | 3ad2ant1 1128 | . . 3 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐷 ⊆ 𝑁) ∧ 𝑖 ∈ 𝐷 ∧ 𝑗 ∈ 𝐷) → 𝑀 ∈ (Base‘𝐴)) |
24 | 4, 2 | matecl 21026 | . . 3 ⊢ ((𝑖 ∈ 𝑁 ∧ 𝑗 ∈ 𝑁 ∧ 𝑀 ∈ (Base‘𝐴)) → (𝑖𝑀𝑗) ∈ (Base‘𝑅)) |
25 | 15, 19, 23, 24 | syl3anc 1366 | . 2 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐷 ⊆ 𝑁) ∧ 𝑖 ∈ 𝐷 ∧ 𝑗 ∈ 𝐷) → (𝑖𝑀𝑗) ∈ (Base‘𝑅)) |
26 | 1, 2, 3, 9, 11, 25 | matbas2d 21024 | 1 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐷 ⊆ 𝑁) → (𝑖 ∈ 𝐷, 𝑗 ∈ 𝐷 ↦ (𝑖𝑀𝑗)) ∈ (Base‘(𝐷 Mat 𝑅))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1082 = wceq 1531 ∈ wcel 2108 Vcvv 3493 ⊆ wss 3934 ‘cfv 6348 (class class class)co 7148 ∈ cmpo 7150 Fincfn 8501 Basecbs 16475 Mat cmat 21008 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1905 ax-6 1964 ax-7 2009 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2154 ax-12 2170 ax-ext 2791 ax-rep 5181 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7453 ax-cnex 10585 ax-resscn 10586 ax-1cn 10587 ax-icn 10588 ax-addcl 10589 ax-addrcl 10590 ax-mulcl 10591 ax-mulrcl 10592 ax-mulcom 10593 ax-addass 10594 ax-mulass 10595 ax-distr 10596 ax-i2m1 10597 ax-1ne0 10598 ax-1rid 10599 ax-rnegex 10600 ax-rrecex 10601 ax-cnre 10602 ax-pre-lttri 10603 ax-pre-lttrn 10604 ax-pre-ltadd 10605 ax-pre-mulgt0 10606 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1083 df-3an 1084 df-tru 1534 df-ex 1775 df-nf 1779 df-sb 2064 df-mo 2616 df-eu 2648 df-clab 2798 df-cleq 2812 df-clel 2891 df-nfc 2961 df-ne 3015 df-nel 3122 df-ral 3141 df-rex 3142 df-reu 3143 df-rab 3145 df-v 3495 df-sbc 3771 df-csb 3882 df-dif 3937 df-un 3939 df-in 3941 df-ss 3950 df-pss 3952 df-nul 4290 df-if 4466 df-pw 4539 df-sn 4560 df-pr 4562 df-tp 4564 df-op 4566 df-ot 4568 df-uni 4831 df-int 4868 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-riota 7106 df-ov 7151 df-oprab 7152 df-mpo 7153 df-om 7573 df-1st 7681 df-2nd 7682 df-supp 7823 df-wrecs 7939 df-recs 8000 df-rdg 8038 df-1o 8094 df-oadd 8098 df-er 8281 df-map 8400 df-ixp 8454 df-en 8502 df-dom 8503 df-sdom 8504 df-fin 8505 df-fsupp 8826 df-sup 8898 df-pnf 10669 df-mnf 10670 df-xr 10671 df-ltxr 10672 df-le 10673 df-sub 10864 df-neg 10865 df-nn 11631 df-2 11692 df-3 11693 df-4 11694 df-5 11695 df-6 11696 df-7 11697 df-8 11698 df-9 11699 df-n0 11890 df-z 11974 df-dec 12091 df-uz 12236 df-fz 12885 df-struct 16477 df-ndx 16478 df-slot 16479 df-base 16481 df-sets 16482 df-ress 16483 df-plusg 16570 df-mulr 16571 df-sca 16573 df-vsca 16574 df-ip 16575 df-tset 16576 df-ple 16577 df-ds 16579 df-hom 16581 df-cco 16582 df-0g 16707 df-prds 16713 df-pws 16715 df-sra 19936 df-rgmod 19937 df-dsmm 20868 df-frlm 20883 df-mat 21009 |
This theorem is referenced by: smadiadetlem3lem0 21266 smadiadet 21271 madjusmdetlem1 31085 |
Copyright terms: Public domain | W3C validator |