Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nfimdetndef | Structured version Visualization version GIF version |
Description: The determinant is not defined for an infinite matrix. (Contributed by AV, 27-Dec-2018.) |
Ref | Expression |
---|---|
nfimdetndef.d | ⊢ 𝐷 = (𝑁 maDet 𝑅) |
Ref | Expression |
---|---|
nfimdetndef | ⊢ (𝑁 ∉ Fin → 𝐷 = ∅) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfimdetndef.d | . . 3 ⊢ 𝐷 = (𝑁 maDet 𝑅) | |
2 | eqid 2758 | . . 3 ⊢ (𝑁 Mat 𝑅) = (𝑁 Mat 𝑅) | |
3 | eqid 2758 | . . 3 ⊢ (Base‘(𝑁 Mat 𝑅)) = (Base‘(𝑁 Mat 𝑅)) | |
4 | eqid 2758 | . . 3 ⊢ (Base‘(SymGrp‘𝑁)) = (Base‘(SymGrp‘𝑁)) | |
5 | eqid 2758 | . . 3 ⊢ (ℤRHom‘𝑅) = (ℤRHom‘𝑅) | |
6 | eqid 2758 | . . 3 ⊢ (pmSgn‘𝑁) = (pmSgn‘𝑁) | |
7 | eqid 2758 | . . 3 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
8 | eqid 2758 | . . 3 ⊢ (mulGrp‘𝑅) = (mulGrp‘𝑅) | |
9 | 1, 2, 3, 4, 5, 6, 7, 8 | mdetfval 21286 | . 2 ⊢ 𝐷 = (𝑚 ∈ (Base‘(𝑁 Mat 𝑅)) ↦ (𝑅 Σg (𝑝 ∈ (Base‘(SymGrp‘𝑁)) ↦ ((((ℤRHom‘𝑅) ∘ (pmSgn‘𝑁))‘𝑝)(.r‘𝑅)((mulGrp‘𝑅) Σg (𝑥 ∈ 𝑁 ↦ ((𝑝‘𝑥)𝑚𝑥))))))) |
10 | df-nel 3056 | . . . . . . 7 ⊢ (𝑁 ∉ Fin ↔ ¬ 𝑁 ∈ Fin) | |
11 | 10 | biimpi 219 | . . . . . 6 ⊢ (𝑁 ∉ Fin → ¬ 𝑁 ∈ Fin) |
12 | 11 | intnanrd 493 | . . . . 5 ⊢ (𝑁 ∉ Fin → ¬ (𝑁 ∈ Fin ∧ 𝑅 ∈ V)) |
13 | matbas0 21110 | . . . . 5 ⊢ (¬ (𝑁 ∈ Fin ∧ 𝑅 ∈ V) → (Base‘(𝑁 Mat 𝑅)) = ∅) | |
14 | 12, 13 | syl 17 | . . . 4 ⊢ (𝑁 ∉ Fin → (Base‘(𝑁 Mat 𝑅)) = ∅) |
15 | 14 | mpteq1d 5121 | . . 3 ⊢ (𝑁 ∉ Fin → (𝑚 ∈ (Base‘(𝑁 Mat 𝑅)) ↦ (𝑅 Σg (𝑝 ∈ (Base‘(SymGrp‘𝑁)) ↦ ((((ℤRHom‘𝑅) ∘ (pmSgn‘𝑁))‘𝑝)(.r‘𝑅)((mulGrp‘𝑅) Σg (𝑥 ∈ 𝑁 ↦ ((𝑝‘𝑥)𝑚𝑥))))))) = (𝑚 ∈ ∅ ↦ (𝑅 Σg (𝑝 ∈ (Base‘(SymGrp‘𝑁)) ↦ ((((ℤRHom‘𝑅) ∘ (pmSgn‘𝑁))‘𝑝)(.r‘𝑅)((mulGrp‘𝑅) Σg (𝑥 ∈ 𝑁 ↦ ((𝑝‘𝑥)𝑚𝑥)))))))) |
16 | mpt0 6473 | . . 3 ⊢ (𝑚 ∈ ∅ ↦ (𝑅 Σg (𝑝 ∈ (Base‘(SymGrp‘𝑁)) ↦ ((((ℤRHom‘𝑅) ∘ (pmSgn‘𝑁))‘𝑝)(.r‘𝑅)((mulGrp‘𝑅) Σg (𝑥 ∈ 𝑁 ↦ ((𝑝‘𝑥)𝑚𝑥))))))) = ∅ | |
17 | 15, 16 | eqtrdi 2809 | . 2 ⊢ (𝑁 ∉ Fin → (𝑚 ∈ (Base‘(𝑁 Mat 𝑅)) ↦ (𝑅 Σg (𝑝 ∈ (Base‘(SymGrp‘𝑁)) ↦ ((((ℤRHom‘𝑅) ∘ (pmSgn‘𝑁))‘𝑝)(.r‘𝑅)((mulGrp‘𝑅) Σg (𝑥 ∈ 𝑁 ↦ ((𝑝‘𝑥)𝑚𝑥))))))) = ∅) |
18 | 9, 17 | syl5eq 2805 | 1 ⊢ (𝑁 ∉ Fin → 𝐷 = ∅) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 399 = wceq 1538 ∈ wcel 2111 ∉ wnel 3055 Vcvv 3409 ∅c0 4225 ↦ cmpt 5112 ∘ ccom 5528 ‘cfv 6335 (class class class)co 7150 Fincfn 8527 Basecbs 16541 .rcmulr 16624 Σg cgsu 16772 SymGrpcsymg 18562 pmSgncpsgn 18684 mulGrpcmgp 19307 ℤRHomczrh 20269 Mat cmat 21107 maDet cmdat 21284 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2729 ax-rep 5156 ax-sep 5169 ax-nul 5176 ax-pr 5298 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-fal 1551 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2557 df-eu 2588 df-clab 2736 df-cleq 2750 df-clel 2830 df-nfc 2901 df-ne 2952 df-nel 3056 df-ral 3075 df-rex 3076 df-reu 3077 df-rab 3079 df-v 3411 df-sbc 3697 df-csb 3806 df-dif 3861 df-un 3863 df-in 3865 df-ss 3875 df-nul 4226 df-if 4421 df-sn 4523 df-pr 4525 df-op 4529 df-uni 4799 df-iun 4885 df-br 5033 df-opab 5095 df-mpt 5113 df-id 5430 df-xp 5530 df-rel 5531 df-cnv 5532 df-co 5533 df-dm 5534 df-rn 5535 df-res 5536 df-ima 5537 df-iota 6294 df-fun 6337 df-fn 6338 df-f 6339 df-f1 6340 df-fo 6341 df-f1o 6342 df-fv 6343 df-ov 7153 df-oprab 7154 df-mpo 7155 df-slot 16545 df-base 16547 df-mat 21108 df-mdet 21285 |
This theorem is referenced by: mdetfval1 21290 |
Copyright terms: Public domain | W3C validator |