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

Theorem submafval 22899
Description: First substitution for a submatrix. (Contributed by AV, 28-Dec-2018.)
Hypotheses
Ref Expression
submafval.a 𝐴 = (𝑁 Mat 𝑅)
submafval.q 𝑄 = (𝑁 subMat 𝑅)
submafval.b 𝐵 = (Base‘𝐴)
Assertion
Ref Expression
submafval 𝑄 = (𝑚 ∈ 𝐵 ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ (𝑁 ∖ {𝑘}), 𝑗 ∈ (𝑁 ∖ {𝑙}) ↦ (𝑖𝑚𝑗))))
Distinct variable groups:   𝐵,𝑚   𝑖,𝑁,𝑗,𝑘,𝑙,𝑚   𝑅,𝑖,𝑗,𝑘,𝑙,𝑚
Allowed substitution hints:   𝐴(𝑖, 𝑗, 𝑘, 𝑚, 𝑙)   𝐵(𝑖, 𝑗, 𝑘, 𝑙)   𝑄(𝑖, 𝑗, 𝑘, 𝑚, 𝑙)

Proof of Theorem submafval
Dummy variables 𝑛 𝑟 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 submafval.q . 2 𝑄 = (𝑁 subMat 𝑅)
2 oveq12 7429 . . . . . . . 8 ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑛 Mat 𝑟) = (𝑁 Mat 𝑅))
3 submafval.a . . . . . . . 8 𝐴 = (𝑁 Mat 𝑅)
42, 3eqtr4di 2813 . . . . . . 7 ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑛 Mat 𝑟) = 𝐴)
54fveq2d 6889 . . . . . 6 ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (Base‘(𝑛 Mat 𝑟)) = (Base‘𝐴))
6 submafval.b . . . . . 6 𝐵 = (Base‘𝐴)
75, 6eqtr4di 2813 . . . . 5 ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (Base‘(𝑛 Mat 𝑟)) = 𝐵)
8 simpl 488 . . . . . 6 ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → 𝑛 = 𝑁)
9 difeq1 4056 . . . . . . . 8 (𝑛 = 𝑁 → (𝑛 ∖ {𝑘}) = (𝑁 ∖ {𝑘}))
109adantr 486 . . . . . . 7 ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑛 ∖ {𝑘}) = (𝑁 ∖ {𝑘}))
11 difeq1 4056 . . . . . . . 8 (𝑛 = 𝑁 → (𝑛 ∖ {𝑙}) = (𝑁 ∖ {𝑙}))
1211adantr 486 . . . . . . 7 ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑛 ∖ {𝑙}) = (𝑁 ∖ {𝑙}))
13 eqidd 2761 . . . . . . 7 ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑖𝑚𝑗) = (𝑖𝑚𝑗))
1410, 12, 13mpoeq123dv 7495 . . . . . 6 ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑖 ∈ (𝑛 ∖ {𝑘}), 𝑗 ∈ (𝑛 ∖ {𝑙}) ↦ (𝑖𝑚𝑗)) = (𝑖 ∈ (𝑁 ∖ {𝑘}), 𝑗 ∈ (𝑁 ∖ {𝑙}) ↦ (𝑖𝑚𝑗)))
158, 8, 14mpoeq123dv 7495 . . . . 5 ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑘 ∈ 𝑛, 𝑙 ∈ 𝑛 ↦ (𝑖 ∈ (𝑛 ∖ {𝑘}), 𝑗 ∈ (𝑛 ∖ {𝑙}) ↦ (𝑖𝑚𝑗))) = (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ (𝑁 ∖ {𝑘}), 𝑗 ∈ (𝑁 ∖ {𝑙}) ↦ (𝑖𝑚𝑗))))
167, 15mpteq12dv 5191 . . . 4 ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ↦ (𝑘 ∈ 𝑛, 𝑙 ∈ 𝑛 ↦ (𝑖 ∈ (𝑛 ∖ {𝑘}), 𝑗 ∈ (𝑛 ∖ {𝑙}) ↦ (𝑖𝑚𝑗)))) = (𝑚 ∈ 𝐵 ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ (𝑁 ∖ {𝑘}), 𝑗 ∈ (𝑁 ∖ {𝑙}) ↦ (𝑖𝑚𝑗)))))
17 df-subma 22897 . . . 4 subMat = (𝑛 ∈ V, 𝑟 ∈ V ↦ (𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ↦ (𝑘 ∈ 𝑛, 𝑙 ∈ 𝑛 ↦ (𝑖 ∈ (𝑛 ∖ {𝑘}), 𝑗 ∈ (𝑛 ∖ {𝑙}) ↦ (𝑖𝑚𝑗)))))
186fvexi 6899 . . . . 5 𝐵 ∈ V
1918mptex 7229 . . . 4 (𝑚 ∈ 𝐵 ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ (𝑁 ∖ {𝑘}), 𝑗 ∈ (𝑁 ∖ {𝑙}) ↦ (𝑖𝑚𝑗)))) ∈ V
2016, 17, 19ovmpoa 7575 . . 3 ((𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑁 subMat 𝑅) = (𝑚 ∈ 𝐵 ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ (𝑁 ∖ {𝑘}), 𝑗 ∈ (𝑁 ∖ {𝑙}) ↦ (𝑖𝑚𝑗)))))
2117mpondm0 7661 . . . . 5 (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑁 subMat 𝑅) = ∅)
22 mpt0 6681 . . . . 5 (𝑚 ∈ ∅ ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ (𝑁 ∖ {𝑘}), 𝑗 ∈ (𝑁 ∖ {𝑙}) ↦ (𝑖𝑚𝑗)))) = ∅
2321, 22eqtr4di 2813 . . . 4 (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑁 subMat 𝑅) = (𝑚 ∈ ∅ ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ (𝑁 ∖ {𝑘}), 𝑗 ∈ (𝑁 ∖ {𝑙}) ↦ (𝑖𝑚𝑗)))))
243fveq2i 6888 . . . . . . 7 (Base‘𝐴) = (Base‘(𝑁 Mat 𝑅))
256, 24eqtri 2783 . . . . . 6 𝐵 = (Base‘(𝑁 Mat 𝑅))
26 matbas0pc 22729 . . . . . 6 (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (Base‘(𝑁 Mat 𝑅)) = ∅)
2725, 26eqtrid 2807 . . . . 5 (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → 𝐵 = ∅)
2827mpteq1d 5194 . . . 4 (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑚 ∈ 𝐵 ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ (𝑁 ∖ {𝑘}), 𝑗 ∈ (𝑁 ∖ {𝑙}) ↦ (𝑖𝑚𝑗)))) = (𝑚 ∈ ∅ ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ (𝑁 ∖ {𝑘}), 𝑗 ∈ (𝑁 ∖ {𝑙}) ↦ (𝑖𝑚𝑗)))))
2923, 28eqtr4d 2798 . . 3 (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑁 subMat 𝑅) = (𝑚 ∈ 𝐵 ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ (𝑁 ∖ {𝑘}), 𝑗 ∈ (𝑁 ∖ {𝑙}) ↦ (𝑖𝑚𝑗)))))
3020, 29pm2.61i 184 . 2 (𝑁 subMat 𝑅) = (𝑚 ∈ 𝐵 ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ (𝑁 ∖ {𝑘}), 𝑗 ∈ (𝑁 ∖ {𝑙}) ↦ (𝑖𝑚𝑗))))
311, 30eqtri 2783 1 𝑄 = (𝑚 ∈ 𝐵 ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ (𝑁 ∖ {𝑘}), 𝑗 ∈ (𝑁 ∖ {𝑙}) ↦ (𝑖𝑚𝑗))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 401   = wceq 1569   ∈ wcel 2144  Vcvv 3450   ∖ cdif 4045  ∅c0 4278  {csn 4584   ↦ cmpt 5185  ‘cfv 6538  (class class class)co 7420   ∈ cmpo 7422  Basecbs 17392   Mat cmat 22727   subMat csubma 22896
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751  ax-cnex 11259  ax-1cn 11261  ax-addcl 11263
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-2nd 8002  df-frecs 8302  df-wrecs 8333  df-recs 8382  df-rdg 8421  df-nn 12339  df-slot 17365  df-ndx 17377  df-base 17393  df-mat 22728  df-subma 22897
This theorem is used by:  submaval0  22900
  Copyright terms: Public domain W3C validator