MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  marepvfval Structured version   Visualization version   GIF version

Theorem marepvfval 20190
Description: First substitution for the definition of the function replacing a column of a matrix by a vector. (Contributed by AV, 14-Feb-2019.) (Revised by AV, 26-Feb-2019.)
Hypotheses
Ref Expression
marepvfval.a 𝐴 = (𝑁 Mat 𝑅)
marepvfval.b 𝐵 = (Base‘𝐴)
marepvfval.q 𝑄 = (𝑁 matRepV 𝑅)
marepvfval.v 𝑉 = ((Base‘𝑅) ↑𝑚 𝑁)
Assertion
Ref Expression
marepvfval 𝑄 = (𝑚𝐵, 𝑣𝑉 ↦ (𝑘𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑗 = 𝑘, (𝑣𝑖), (𝑖𝑚𝑗)))))
Distinct variable groups:   𝐵,𝑚,𝑣   𝑖,𝑁,𝑗,𝑘,𝑚,𝑣   𝑅,𝑖,𝑗,𝑘,𝑚,𝑣   𝑚,𝑉,𝑣
Allowed substitution hints:   𝐴(𝑣,𝑖,𝑗,𝑘,𝑚)   𝐵(𝑖,𝑗,𝑘)   𝑄(𝑣,𝑖,𝑗,𝑘,𝑚)   𝑉(𝑖,𝑗,𝑘)

Proof of Theorem marepvfval
Dummy variables 𝑛 𝑟 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 marepvfval.q . 2 𝑄 = (𝑁 matRepV 𝑅)
2 marepvfval.b . . . . . 6 𝐵 = (Base‘𝐴)
3 fvex 6113 . . . . . 6 (Base‘𝐴) ∈ V
42, 3eqeltri 2684 . . . . 5 𝐵 ∈ V
5 marepvfval.v . . . . . . 7 𝑉 = ((Base‘𝑅) ↑𝑚 𝑁)
6 ovex 6577 . . . . . . 7 ((Base‘𝑅) ↑𝑚 𝑁) ∈ V
75, 6eqeltri 2684 . . . . . 6 𝑉 ∈ V
87a1i 11 . . . . 5 ((𝑁 ∈ V ∧ 𝑅 ∈ V) → 𝑉 ∈ V)
9 mpt2exga 7135 . . . . 5 ((𝐵 ∈ V ∧ 𝑉 ∈ V) → (𝑚𝐵, 𝑣𝑉 ↦ (𝑘𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑗 = 𝑘, (𝑣𝑖), (𝑖𝑚𝑗))))) ∈ V)
104, 8, 9sylancr 694 . . . 4 ((𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑚𝐵, 𝑣𝑉 ↦ (𝑘𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑗 = 𝑘, (𝑣𝑖), (𝑖𝑚𝑗))))) ∈ V)
11 oveq12 6558 . . . . . . . . 9 ((𝑛 = 𝑁𝑟 = 𝑅) → (𝑛 Mat 𝑟) = (𝑁 Mat 𝑅))
12 marepvfval.a . . . . . . . . 9 𝐴 = (𝑁 Mat 𝑅)
1311, 12syl6eqr 2662 . . . . . . . 8 ((𝑛 = 𝑁𝑟 = 𝑅) → (𝑛 Mat 𝑟) = 𝐴)
1413fveq2d 6107 . . . . . . 7 ((𝑛 = 𝑁𝑟 = 𝑅) → (Base‘(𝑛 Mat 𝑟)) = (Base‘𝐴))
1514, 2syl6eqr 2662 . . . . . 6 ((𝑛 = 𝑁𝑟 = 𝑅) → (Base‘(𝑛 Mat 𝑟)) = 𝐵)
16 fveq2 6103 . . . . . . . . 9 (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
1716adantl 481 . . . . . . . 8 ((𝑛 = 𝑁𝑟 = 𝑅) → (Base‘𝑟) = (Base‘𝑅))
18 simpl 472 . . . . . . . 8 ((𝑛 = 𝑁𝑟 = 𝑅) → 𝑛 = 𝑁)
1917, 18oveq12d 6567 . . . . . . 7 ((𝑛 = 𝑁𝑟 = 𝑅) → ((Base‘𝑟) ↑𝑚 𝑛) = ((Base‘𝑅) ↑𝑚 𝑁))
2019, 5syl6eqr 2662 . . . . . 6 ((𝑛 = 𝑁𝑟 = 𝑅) → ((Base‘𝑟) ↑𝑚 𝑛) = 𝑉)
21 eqidd 2611 . . . . . . . 8 ((𝑛 = 𝑁𝑟 = 𝑅) → if(𝑗 = 𝑘, (𝑣𝑖), (𝑖𝑚𝑗)) = if(𝑗 = 𝑘, (𝑣𝑖), (𝑖𝑚𝑗)))
2218, 18, 21mpt2eq123dv 6615 . . . . . . 7 ((𝑛 = 𝑁𝑟 = 𝑅) → (𝑖𝑛, 𝑗𝑛 ↦ if(𝑗 = 𝑘, (𝑣𝑖), (𝑖𝑚𝑗))) = (𝑖𝑁, 𝑗𝑁 ↦ if(𝑗 = 𝑘, (𝑣𝑖), (𝑖𝑚𝑗))))
2318, 22mpteq12dv 4663 . . . . . 6 ((𝑛 = 𝑁𝑟 = 𝑅) → (𝑘𝑛 ↦ (𝑖𝑛, 𝑗𝑛 ↦ if(𝑗 = 𝑘, (𝑣𝑖), (𝑖𝑚𝑗)))) = (𝑘𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑗 = 𝑘, (𝑣𝑖), (𝑖𝑚𝑗)))))
2415, 20, 23mpt2eq123dv 6615 . . . . 5 ((𝑛 = 𝑁𝑟 = 𝑅) → (𝑚 ∈ (Base‘(𝑛 Mat 𝑟)), 𝑣 ∈ ((Base‘𝑟) ↑𝑚 𝑛) ↦ (𝑘𝑛 ↦ (𝑖𝑛, 𝑗𝑛 ↦ if(𝑗 = 𝑘, (𝑣𝑖), (𝑖𝑚𝑗))))) = (𝑚𝐵, 𝑣𝑉 ↦ (𝑘𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑗 = 𝑘, (𝑣𝑖), (𝑖𝑚𝑗))))))
25 df-marepv 20184 . . . . 5 matRepV = (𝑛 ∈ V, 𝑟 ∈ V ↦ (𝑚 ∈ (Base‘(𝑛 Mat 𝑟)), 𝑣 ∈ ((Base‘𝑟) ↑𝑚 𝑛) ↦ (𝑘𝑛 ↦ (𝑖𝑛, 𝑗𝑛 ↦ if(𝑗 = 𝑘, (𝑣𝑖), (𝑖𝑚𝑗))))))
2624, 25ovmpt2ga 6688 . . . 4 ((𝑁 ∈ V ∧ 𝑅 ∈ V ∧ (𝑚𝐵, 𝑣𝑉 ↦ (𝑘𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑗 = 𝑘, (𝑣𝑖), (𝑖𝑚𝑗))))) ∈ V) → (𝑁 matRepV 𝑅) = (𝑚𝐵, 𝑣𝑉 ↦ (𝑘𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑗 = 𝑘, (𝑣𝑖), (𝑖𝑚𝑗))))))
2710, 26mpd3an3 1417 . . 3 ((𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑁 matRepV 𝑅) = (𝑚𝐵, 𝑣𝑉 ↦ (𝑘𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑗 = 𝑘, (𝑣𝑖), (𝑖𝑚𝑗))))))
2825mpt2ndm0 6773 . . . . 5 (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑁 matRepV 𝑅) = ∅)
29 mpt20 6623 . . . . 5 (𝑚 ∈ ∅, 𝑣 ∈ ((Base‘𝑅) ↑𝑚 𝑁) ↦ (𝑘𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑗 = 𝑘, (𝑣𝑖), (𝑖𝑚𝑗))))) = ∅
3028, 29syl6eqr 2662 . . . 4 (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑁 matRepV 𝑅) = (𝑚 ∈ ∅, 𝑣 ∈ ((Base‘𝑅) ↑𝑚 𝑁) ↦ (𝑘𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑗 = 𝑘, (𝑣𝑖), (𝑖𝑚𝑗))))))
3112fveq2i 6106 . . . . . . 7 (Base‘𝐴) = (Base‘(𝑁 Mat 𝑅))
322, 31eqtri 2632 . . . . . 6 𝐵 = (Base‘(𝑁 Mat 𝑅))
33 matbas0pc 20034 . . . . . 6 (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (Base‘(𝑁 Mat 𝑅)) = ∅)
3432, 33syl5eq 2656 . . . . 5 (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → 𝐵 = ∅)
35 mpt2eq12 6613 . . . . 5 ((𝐵 = ∅ ∧ 𝑉 = ((Base‘𝑅) ↑𝑚 𝑁)) → (𝑚𝐵, 𝑣𝑉 ↦ (𝑘𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑗 = 𝑘, (𝑣𝑖), (𝑖𝑚𝑗))))) = (𝑚 ∈ ∅, 𝑣 ∈ ((Base‘𝑅) ↑𝑚 𝑁) ↦ (𝑘𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑗 = 𝑘, (𝑣𝑖), (𝑖𝑚𝑗))))))
3634, 5, 35sylancl 693 . . . 4 (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑚𝐵, 𝑣𝑉 ↦ (𝑘𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑗 = 𝑘, (𝑣𝑖), (𝑖𝑚𝑗))))) = (𝑚 ∈ ∅, 𝑣 ∈ ((Base‘𝑅) ↑𝑚 𝑁) ↦ (𝑘𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑗 = 𝑘, (𝑣𝑖), (𝑖𝑚𝑗))))))
3730, 36eqtr4d 2647 . . 3 (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑁 matRepV 𝑅) = (𝑚𝐵, 𝑣𝑉 ↦ (𝑘𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑗 = 𝑘, (𝑣𝑖), (𝑖𝑚𝑗))))))
3827, 37pm2.61i 175 . 2 (𝑁 matRepV 𝑅) = (𝑚𝐵, 𝑣𝑉 ↦ (𝑘𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑗 = 𝑘, (𝑣𝑖), (𝑖𝑚𝑗)))))
391, 38eqtri 2632 1 𝑄 = (𝑚𝐵, 𝑣𝑉 ↦ (𝑘𝑁 ↦ (𝑖𝑁, 𝑗𝑁 ↦ if(𝑗 = 𝑘, (𝑣𝑖), (𝑖𝑚𝑗)))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wa 383   = wceq 1475  wcel 1977  Vcvv 3173  c0 3874  ifcif 4036  cmpt 4643  cfv 5804  (class class class)co 6549  cmpt2 6551  𝑚 cmap 7744  Basecbs 15695   Mat cmat 20032   matRepV cmatrepV 20182
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-1st 7059  df-2nd 7060  df-slot 15699  df-base 15700  df-mat 20033  df-marepv 20184
This theorem is referenced by:  marepvval0  20191
  Copyright terms: Public domain W3C validator