Theorem marrepeval 20369

Description: An entry of a matrix with a replaced row. (Contributed by AV, 12-Feb-2019.)

Hypotheses

Ref	Expression
marrepfval.a	|- A = ( N Mat R )
marrepfval.b	|- B = ( Base ` A )
marrepfval.q	|- Q = ( N matRRep R )
marrepfval.z	|- .0. = ( 0g ` R )

Assertion

Ref	Expression
marrepeval	|- ( ( ( M e. B /\ S e. ( Base ` R ) ) /\ ( K e. N /\ L e. N ) /\ ( I e. N /\ J e. N ) ) -> ( I ( K ( M Q S ) L ) J ) = if ( I = K , if ( J = L , S , .0. ) , ( I M J ) ) )

Proof of Theorem marrepeval

Dummy variables i j are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		marrepfval.a	. . . 4 |- A = ( N Mat R )
2		marrepfval.b	. . . 4 |- B = ( Base ` A )
3		marrepfval.q	. . . 4 |- Q = ( N matRRep R )
4		marrepfval.z	. . . 4 |- .0. = ( 0g ` R )
5	1, 2, 3, 4	marrepval 20368	. . 3 |- ( ( ( M e. B /\ S e. ( Base ` R ) ) /\ ( K e. N /\ L e. N ) ) -> ( K ( M Q S ) L ) = ( i e. N , j e. N |-> if ( i = K , if ( j = L , S , .0. ) , ( i M j ) ) ) )
6	5	3adant3 1081	. 2 |- ( ( ( M e. B /\ S e. ( Base ` R ) ) /\ ( K e. N /\ L e. N ) /\ ( I e. N /\ J e. N ) ) -> ( K ( M Q S ) L ) = ( i e. N , j e. N |-> if ( i = K , if ( j = L , S , .0. ) , ( i M j ) ) ) )
7		simp3l 1089	. . 3 |- ( ( ( M e. B /\ S e. ( Base ` R ) ) /\ ( K e. N /\ L e. N ) /\ ( I e. N /\ J e. N ) ) -> I e. N )
8		simpl3r 1117	. . 3 |- ( ( ( ( M e. B /\ S e. ( Base ` R ) ) /\ ( K e. N /\ L e. N ) /\ ( I e. N /\ J e. N ) ) /\ i = I ) -> J e. N )
9		fvex 6201	. . . . . . . . 9 |- ( 0g ` R ) e. _V
10	4, 9	eqeltri 2697	. . . . . . . 8 |- .0. e. _V
11		ifexg 4157	. . . . . . . 8 |- ( ( S e. ( Base ` R ) /\ .0. e. _V ) -> if ( j = L , S , .0. ) e. _V )
12	10, 11	mpan2 707	. . . . . . 7 |- ( S e. ( Base ` R ) -> if ( j = L , S , .0. ) e. _V )
13		ovexd 6680	. . . . . . 7 |- ( S e. ( Base ` R ) -> ( i M j ) e. _V )
14	12, 13	ifcld 4131	. . . . . 6 |- ( S e. ( Base ` R ) -> if ( i = K , if ( j = L , S , .0. ) , ( i M j ) ) e. _V )
15	14	adantl 482	. . . . 5 |- ( ( M e. B /\ S e. ( Base ` R ) ) -> if ( i = K , if ( j = L , S , .0. ) , ( i M j ) ) e. _V )
16	15	3ad2ant1 1082	. . . 4 |- ( ( ( M e. B /\ S e. ( Base ` R ) ) /\ ( K e. N /\ L e. N ) /\ ( I e. N /\ J e. N ) ) -> if ( i = K , if ( j = L , S , .0. ) , ( i M j ) ) e. _V )
17	16	adantr 481	. . 3 |- ( ( ( ( M e. B /\ S e. ( Base ` R ) ) /\ ( K e. N /\ L e. N ) /\ ( I e. N /\ J e. N ) ) /\ ( i = I /\ j = J ) ) -> if ( i = K , if ( j = L , S , .0. ) , ( i M j ) ) e. _V )
18		eqeq1 2626	. . . . . 6 |- ( i = I -> ( i = K <-> I = K ) )
19	18	adantr 481	. . . . 5 |- ( ( i = I /\ j = J ) -> ( i = K <-> I = K ) )
20		eqeq1 2626	. . . . . . 7 |- ( j = J -> ( j = L <-> J = L ) )
21	20	ifbid 4108	. . . . . 6 |- ( j = J -> if ( j = L , S , .0. ) = if ( J = L , S , .0. ) )
22	21	adantl 482	. . . . 5 |- ( ( i = I /\ j = J ) -> if ( j = L , S , .0. ) = if ( J = L , S , .0. ) )
23		oveq12 6659	. . . . 5 |- ( ( i = I /\ j = J ) -> ( i M j ) = ( I M J ) )
24	19, 22, 23	ifbieq12d 4113	. . . 4 |- ( ( i = I /\ j = J ) -> if ( i = K , if ( j = L , S , .0. ) , ( i M j ) ) = if ( I = K , if ( J = L , S , .0. ) , ( I M J ) ) )
25	24	adantl 482	. . 3 |- ( ( ( ( M e. B /\ S e. ( Base ` R ) ) /\ ( K e. N /\ L e. N ) /\ ( I e. N /\ J e. N ) ) /\ ( i = I /\ j = J ) ) -> if ( i = K , if ( j = L , S , .0. ) , ( i M j ) ) = if ( I = K , if ( J = L , S , .0. ) , ( I M J ) ) )
26	7, 8, 17, 25	ovmpt2dv2 6794	. 2 |- ( ( ( M e. B /\ S e. ( Base ` R ) ) /\ ( K e. N /\ L e. N ) /\ ( I e. N /\ J e. N ) ) -> ( ( K ( M Q S ) L ) = ( i e. N , j e. N |-> if ( i = K , if ( j = L , S , .0. ) , ( i M j ) ) ) -> ( I ( K ( M Q S ) L ) J ) = if ( I = K , if ( J = L , S , .0. ) , ( I M J ) ) ) )
27	6, 26	mpd 15	1 |- ( ( ( M e. B /\ S e. ( Base ` R ) ) /\ ( K e. N /\ L e. N ) /\ ( I e. N /\ J e. N ) ) -> ( I ( K ( M Q S ) L ) J ) = if ( I = K , if ( J = L , S , .0. ) , ( I M J ) ) )

Syntax hints:   -> wi 4   <-> wb 196   /\ wa 384   /\ w3a 1037   = wceq 1483   e. wcel 1990   _Vcvv 3200   ifcif 4086   ` cfv 5888  (class class class)co 6650   |-> cmpt2 6652   Basecbs 15857   0gc0g 16100   Mat cmat 20213   matRRep cmarrep 20362

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-1st 7168  df-2nd 7169  df-slot 15861  df-base 15863  df-mat 20214  df-marrep 20364

This theorem is referenced by:  submatminr1  29876