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

Theorem submafval 22874
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 7421 . . . . . . . 8 ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑛 Mat 𝑟) = (𝑁 Mat 𝑅))
3 submafval.a . . . . . . . 8 𝐴 = (𝑁 Mat 𝑅)
42, 3eqtr4di 2814 . . . . . . 7 ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑛 Mat 𝑟) = 𝐴)
54fveq2d 6881 . . . . . 6 ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (Base‘(𝑛 Mat 𝑟)) = (Base‘𝐴))
6 submafval.b . . . . . 6 𝐵 = (Base‘𝐴)
75, 6eqtr4di 2814 . . . . 5 ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (Base‘(𝑛 Mat 𝑟)) = 𝐵)
8 simpl 488 . . . . . 6 ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → 𝑛 = 𝑁)
9 difeq1 4067 . . . . . . . 8 (𝑛 = 𝑁 → (𝑛 ∖ {𝑘}) = (𝑁 ∖ {𝑘}))
109adantr 486 . . . . . . 7 ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑛 ∖ {𝑘}) = (𝑁 ∖ {𝑘}))
11 difeq1 4067 . . . . . . . 8 (𝑛 = 𝑁 → (𝑛 ∖ {𝑙}) = (𝑁 ∖ {𝑙}))
1211adantr 486 . . . . . . 7 ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑛 ∖ {𝑙}) = (𝑁 ∖ {𝑙}))
13 eqidd 2762 . . . . . . 7 ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑖𝑚𝑗) = (𝑖𝑚𝑗))
1410, 12, 13mpoeq123dv 7487 . . . . . 6 ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑖 ∈ (𝑛 ∖ {𝑘}), 𝑗 ∈ (𝑛 ∖ {𝑙}) ↦ (𝑖𝑚𝑗)) = (𝑖 ∈ (𝑁 ∖ {𝑘}), 𝑗 ∈ (𝑁 ∖ {𝑙}) ↦ (𝑖𝑚𝑗)))
158, 8, 14mpoeq123dv 7487 . . . . 5 ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑘 ∈ 𝑛, 𝑙 ∈ 𝑛 ↦ (𝑖 ∈ (𝑛 ∖ {𝑘}), 𝑗 ∈ (𝑛 ∖ {𝑙}) ↦ (𝑖𝑚𝑗))) = (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ (𝑁 ∖ {𝑘}), 𝑗 ∈ (𝑁 ∖ {𝑙}) ↦ (𝑖𝑚𝑗))))
167, 15mpteq12dv 5192 . . . 4 ((𝑛 = 𝑁 ∧ 𝑟 = 𝑅) → (𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ↦ (𝑘 ∈ 𝑛, 𝑙 ∈ 𝑛 ↦ (𝑖 ∈ (𝑛 ∖ {𝑘}), 𝑗 ∈ (𝑛 ∖ {𝑙}) ↦ (𝑖𝑚𝑗)))) = (𝑚 ∈ 𝐵 ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ (𝑁 ∖ {𝑘}), 𝑗 ∈ (𝑁 ∖ {𝑙}) ↦ (𝑖𝑚𝑗)))))
17 df-subma 22872 . . . 4 subMat = (𝑛 ∈ V, 𝑟 ∈ V ↦ (𝑚 ∈ (Base‘(𝑛 Mat 𝑟)) ↦ (𝑘 ∈ 𝑛, 𝑙 ∈ 𝑛 ↦ (𝑖 ∈ (𝑛 ∖ {𝑘}), 𝑗 ∈ (𝑛 ∖ {𝑙}) ↦ (𝑖𝑚𝑗)))))
186fvexi 6891 . . . . 5 𝐵 ∈ V
1918mptex 7221 . . . 4 (𝑚 ∈ 𝐵 ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ (𝑁 ∖ {𝑘}), 𝑗 ∈ (𝑁 ∖ {𝑙}) ↦ (𝑖𝑚𝑗)))) ∈ V
2016, 17, 19ovmpoa 7567 . . 3 ((𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑁 subMat 𝑅) = (𝑚 ∈ 𝐵 ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ (𝑁 ∖ {𝑘}), 𝑗 ∈ (𝑁 ∖ {𝑙}) ↦ (𝑖𝑚𝑗)))))
2117mpondm0 7653 . . . . 5 (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑁 subMat 𝑅) = ∅)
22 mpt0 6673 . . . . 5 (𝑚 ∈ ∅ ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ (𝑁 ∖ {𝑘}), 𝑗 ∈ (𝑁 ∖ {𝑙}) ↦ (𝑖𝑚𝑗)))) = ∅
2321, 22eqtr4di 2814 . . . 4 (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑁 subMat 𝑅) = (𝑚 ∈ ∅ ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ (𝑁 ∖ {𝑘}), 𝑗 ∈ (𝑁 ∖ {𝑙}) ↦ (𝑖𝑚𝑗)))))
243fveq2i 6880 . . . . . . 7 (Base‘𝐴) = (Base‘(𝑁 Mat 𝑅))
256, 24eqtri 2784 . . . . . 6 𝐵 = (Base‘(𝑁 Mat 𝑅))
26 matbas0pc 22704 . . . . . 6 (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (Base‘(𝑁 Mat 𝑅)) = ∅)
2725, 26eqtrid 2808 . . . . 5 (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → 𝐵 = ∅)
2827mpteq1d 5195 . . . 4 (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑚 ∈ 𝐵 ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ (𝑁 ∖ {𝑘}), 𝑗 ∈ (𝑁 ∖ {𝑙}) ↦ (𝑖𝑚𝑗)))) = (𝑚 ∈ ∅ ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ (𝑁 ∖ {𝑘}), 𝑗 ∈ (𝑁 ∖ {𝑙}) ↦ (𝑖𝑚𝑗)))))
2923, 28eqtr4d 2799 . . 3 (¬ (𝑁 ∈ V ∧ 𝑅 ∈ V) → (𝑁 subMat 𝑅) = (𝑚 ∈ 𝐵 ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ (𝑁 ∖ {𝑘}), 𝑗 ∈ (𝑁 ∖ {𝑙}) ↦ (𝑖𝑚𝑗)))))
3020, 29pm2.61i 184 . 2 (𝑁 subMat 𝑅) = (𝑚 ∈ 𝐵 ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ (𝑁 ∖ {𝑘}), 𝑗 ∈ (𝑁 ∖ {𝑙}) ↦ (𝑖𝑚𝑗))))
311, 30eqtri 2784 1 𝑄 = (𝑚 ∈ 𝐵 ↦ (𝑘 ∈ 𝑁, 𝑙 ∈ 𝑁 ↦ (𝑖 ∈ (𝑁 ∖ {𝑘}), 𝑗 ∈ (𝑁 ∖ {𝑙}) ↦ (𝑖𝑚𝑗))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3451   ∖ cdif 3896  ∅c0 4279  {csn 4584   ↦ cmpt 5186  ‘cfv 6531  (class class class)co 7412   ∈ cmpo 7414  Basecbs 17367   Mat cmat 22702   subMat csubma 22871
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740  ax-cnex 11237  ax-1cn 11239  ax-addcl 11241
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6297  df-ord 6358  df-on 6359  df-lim 6360  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7867  df-2nd 7991  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-nn 12317  df-slot 17340  df-ndx 17352  df-base 17368  df-mat 22703  df-subma 22872
This theorem is used by:  submaval0  22875
  Copyright terms: Public domain W3C validator