![]() |
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 2727 | . . 3 ⊢ (𝑁 Mat 𝑅) = (𝑁 Mat 𝑅) | |
3 | eqid 2727 | . . 3 ⊢ (Base‘(𝑁 Mat 𝑅)) = (Base‘(𝑁 Mat 𝑅)) | |
4 | eqid 2727 | . . 3 ⊢ (Base‘(SymGrp‘𝑁)) = (Base‘(SymGrp‘𝑁)) | |
5 | eqid 2727 | . . 3 ⊢ (ℤRHom‘𝑅) = (ℤRHom‘𝑅) | |
6 | eqid 2727 | . . 3 ⊢ (pmSgn‘𝑁) = (pmSgn‘𝑁) | |
7 | eqid 2727 | . . 3 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
8 | eqid 2727 | . . 3 ⊢ (mulGrp‘𝑅) = (mulGrp‘𝑅) | |
9 | 1, 2, 3, 4, 5, 6, 7, 8 | mdetfval 22462 | . 2 ⊢ 𝐷 = (𝑚 ∈ (Base‘(𝑁 Mat 𝑅)) ↦ (𝑅 Σg (𝑝 ∈ (Base‘(SymGrp‘𝑁)) ↦ ((((ℤRHom‘𝑅) ∘ (pmSgn‘𝑁))‘𝑝)(.r‘𝑅)((mulGrp‘𝑅) Σg (𝑥 ∈ 𝑁 ↦ ((𝑝‘𝑥)𝑚𝑥))))))) |
10 | df-nel 3042 | . . . . . . 7 ⊢ (𝑁 ∉ Fin ↔ ¬ 𝑁 ∈ Fin) | |
11 | 10 | biimpi 215 | . . . . . 6 ⊢ (𝑁 ∉ Fin → ¬ 𝑁 ∈ Fin) |
12 | 11 | intnanrd 489 | . . . . 5 ⊢ (𝑁 ∉ Fin → ¬ (𝑁 ∈ Fin ∧ 𝑅 ∈ V)) |
13 | matbas0 22284 | . . . . 5 ⊢ (¬ (𝑁 ∈ Fin ∧ 𝑅 ∈ V) → (Base‘(𝑁 Mat 𝑅)) = ∅) | |
14 | 12, 13 | syl 17 | . . . 4 ⊢ (𝑁 ∉ Fin → (Base‘(𝑁 Mat 𝑅)) = ∅) |
15 | 14 | mpteq1d 5237 | . . 3 ⊢ (𝑁 ∉ Fin → (𝑚 ∈ (Base‘(𝑁 Mat 𝑅)) ↦ (𝑅 Σg (𝑝 ∈ (Base‘(SymGrp‘𝑁)) ↦ ((((ℤRHom‘𝑅) ∘ (pmSgn‘𝑁))‘𝑝)(.r‘𝑅)((mulGrp‘𝑅) Σg (𝑥 ∈ 𝑁 ↦ ((𝑝‘𝑥)𝑚𝑥))))))) = (𝑚 ∈ ∅ ↦ (𝑅 Σg (𝑝 ∈ (Base‘(SymGrp‘𝑁)) ↦ ((((ℤRHom‘𝑅) ∘ (pmSgn‘𝑁))‘𝑝)(.r‘𝑅)((mulGrp‘𝑅) Σg (𝑥 ∈ 𝑁 ↦ ((𝑝‘𝑥)𝑚𝑥)))))))) |
16 | mpt0 6691 | . . 3 ⊢ (𝑚 ∈ ∅ ↦ (𝑅 Σg (𝑝 ∈ (Base‘(SymGrp‘𝑁)) ↦ ((((ℤRHom‘𝑅) ∘ (pmSgn‘𝑁))‘𝑝)(.r‘𝑅)((mulGrp‘𝑅) Σg (𝑥 ∈ 𝑁 ↦ ((𝑝‘𝑥)𝑚𝑥))))))) = ∅ | |
17 | 15, 16 | eqtrdi 2783 | . 2 ⊢ (𝑁 ∉ Fin → (𝑚 ∈ (Base‘(𝑁 Mat 𝑅)) ↦ (𝑅 Σg (𝑝 ∈ (Base‘(SymGrp‘𝑁)) ↦ ((((ℤRHom‘𝑅) ∘ (pmSgn‘𝑁))‘𝑝)(.r‘𝑅)((mulGrp‘𝑅) Σg (𝑥 ∈ 𝑁 ↦ ((𝑝‘𝑥)𝑚𝑥))))))) = ∅) |
18 | 9, 17 | eqtrid 2779 | 1 ⊢ (𝑁 ∉ Fin → 𝐷 = ∅) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1534 ∈ wcel 2099 ∉ wnel 3041 Vcvv 3469 ∅c0 4318 ↦ cmpt 5225 ∘ ccom 5676 ‘cfv 6542 (class class class)co 7414 Fincfn 8953 Basecbs 17165 .rcmulr 17219 Σg cgsu 17407 SymGrpcsymg 19305 pmSgncpsgn 19428 mulGrpcmgp 20058 ℤRHomczrh 21405 Mat cmat 22281 maDet cmdat 22460 |
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 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2164 ax-ext 2698 ax-rep 5279 ax-sep 5293 ax-nul 5300 ax-pow 5359 ax-pr 5423 ax-un 7732 ax-cnex 11180 ax-1cn 11182 ax-addcl 11184 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3or 1086 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2705 df-cleq 2719 df-clel 2805 df-nfc 2880 df-ne 2936 df-nel 3042 df-ral 3057 df-rex 3066 df-reu 3372 df-rab 3428 df-v 3471 df-sbc 3775 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3963 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-op 4631 df-uni 4904 df-iun 4993 df-br 5143 df-opab 5205 df-mpt 5226 df-tr 5260 df-id 5570 df-eprel 5576 df-po 5584 df-so 5585 df-fr 5627 df-we 5629 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-pred 6299 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7863 df-2nd 7986 df-frecs 8278 df-wrecs 8309 df-recs 8383 df-rdg 8422 df-nn 12229 df-slot 17136 df-ndx 17148 df-base 17166 df-mat 22282 df-mdet 22461 |
This theorem is referenced by: mdetfval1 22466 |
Copyright terms: Public domain | W3C validator |