ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  fvmpopr2d Unicode version

Theorem fvmpopr2d 6168
Description: Value of an operation given by maps-to notation. (Contributed by Rohan Ridenour, 14-May-2024.)
Hypotheses
Ref Expression
fvmpopr2d.1  |-  ( ph  ->  F  =  ( a  e.  A ,  b  e.  B  |->  C ) )
fvmpopr2d.2  |-  ( ph  ->  P  =  <. a ,  b >. )
fvmpopr2d.3  |-  ( (
ph  /\  a  e.  A  /\  b  e.  B
)  ->  C  e.  V )
Assertion
Ref Expression
fvmpopr2d  |-  ( (
ph  /\  a  e.  A  /\  b  e.  B
)  ->  ( F `  P )  =  C )
Distinct variable groups:    A, a, b    B, a, b
Allowed substitution hints:    ph( a, b)    C( a, b)    P( a, b)    F( a, b)    V( a, b)

Proof of Theorem fvmpopr2d
Dummy variables  c  d are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-ov 6031 . . 3  |-  ( a ( a  e.  A ,  b  e.  B  |->  C ) b )  =  ( ( a  e.  A ,  b  e.  B  |->  C ) `
 <. a ,  b
>. )
2 fvmpopr2d.1 . . . . 5  |-  ( ph  ->  F  =  ( a  e.  A ,  b  e.  B  |->  C ) )
323ad2ant1 1045 . . . 4  |-  ( (
ph  /\  a  e.  A  /\  b  e.  B
)  ->  F  =  ( a  e.  A ,  b  e.  B  |->  C ) )
4 fvmpopr2d.2 . . . . 5  |-  ( ph  ->  P  =  <. a ,  b >. )
543ad2ant1 1045 . . . 4  |-  ( (
ph  /\  a  e.  A  /\  b  e.  B
)  ->  P  =  <. a ,  b >.
)
63, 5fveq12d 5655 . . 3  |-  ( (
ph  /\  a  e.  A  /\  b  e.  B
)  ->  ( F `  P )  =  ( ( a  e.  A ,  b  e.  B  |->  C ) `  <. a ,  b >. )
)
71, 6eqtr4id 2283 . 2  |-  ( (
ph  /\  a  e.  A  /\  b  e.  B
)  ->  ( a
( a  e.  A ,  b  e.  B  |->  C ) b )  =  ( F `  P ) )
8 nfcv 2375 . . . . 5  |-  F/_ c C
9 nfcv 2375 . . . . 5  |-  F/_ d C
10 nfcv 2375 . . . . . 6  |-  F/_ a
d
11 nfcsb1v 3161 . . . . . 6  |-  F/_ a [_ c  /  a ]_ C
1210, 11nfcsbw 3165 . . . . 5  |-  F/_ a [_ d  /  b ]_ [_ c  /  a ]_ C
13 nfcsb1v 3161 . . . . 5  |-  F/_ b [_ d  /  b ]_ [_ c  /  a ]_ C
14 csbeq1a 3137 . . . . . 6  |-  ( a  =  c  ->  C  =  [_ c  /  a ]_ C )
15 csbeq1a 3137 . . . . . 6  |-  ( b  =  d  ->  [_ c  /  a ]_ C  =  [_ d  /  b ]_ [_ c  /  a ]_ C )
1614, 15sylan9eq 2284 . . . . 5  |-  ( ( a  =  c  /\  b  =  d )  ->  C  =  [_ d  /  b ]_ [_ c  /  a ]_ C
)
178, 9, 12, 13, 16cbvmpo 6110 . . . 4  |-  ( a  e.  A ,  b  e.  B  |->  C )  =  ( c  e.  A ,  d  e.  B  |->  [_ d  /  b ]_ [_ c  /  a ]_ C )
1817oveqi 6041 . . 3  |-  ( a ( a  e.  A ,  b  e.  B  |->  C ) b )  =  ( a ( c  e.  A , 
d  e.  B  |->  [_ d  /  b ]_ [_ c  /  a ]_ C
) b )
19 eqidd 2232 . . . 4  |-  ( (
ph  /\  a  e.  A  /\  b  e.  B
)  ->  ( c  e.  A ,  d  e.  B  |->  [_ d  /  b ]_ [_ c  /  a ]_ C )  =  ( c  e.  A , 
d  e.  B  |->  [_ d  /  b ]_ [_ c  /  a ]_ C
) )
20 equcom 1754 . . . . . . . 8  |-  ( a  =  c  <->  c  =  a )
21 equcom 1754 . . . . . . . 8  |-  ( b  =  d  <->  d  =  b )
2220, 21anbi12i 460 . . . . . . 7  |-  ( ( a  =  c  /\  b  =  d )  <->  ( c  =  a  /\  d  =  b )
)
2322, 16sylbir 135 . . . . . 6  |-  ( ( c  =  a  /\  d  =  b )  ->  C  =  [_ d  /  b ]_ [_ c  /  a ]_ C
)
2423eqcomd 2237 . . . . 5  |-  ( ( c  =  a  /\  d  =  b )  ->  [_ d  /  b ]_ [_ c  /  a ]_ C  =  C
)
2524adantl 277 . . . 4  |-  ( ( ( ph  /\  a  e.  A  /\  b  e.  B )  /\  (
c  =  a  /\  d  =  b )
)  ->  [_ d  / 
b ]_ [_ c  / 
a ]_ C  =  C )
26 simp2 1025 . . . 4  |-  ( (
ph  /\  a  e.  A  /\  b  e.  B
)  ->  a  e.  A )
27 simp3 1026 . . . 4  |-  ( (
ph  /\  a  e.  A  /\  b  e.  B
)  ->  b  e.  B )
28 fvmpopr2d.3 . . . 4  |-  ( (
ph  /\  a  e.  A  /\  b  e.  B
)  ->  C  e.  V )
2919, 25, 26, 27, 28ovmpod 6159 . . 3  |-  ( (
ph  /\  a  e.  A  /\  b  e.  B
)  ->  ( a
( c  e.  A ,  d  e.  B  |-> 
[_ d  /  b ]_ [_ c  /  a ]_ C ) b )  =  C )
3018, 29eqtrid 2276 . 2  |-  ( (
ph  /\  a  e.  A  /\  b  e.  B
)  ->  ( a
( a  e.  A ,  b  e.  B  |->  C ) b )  =  C )
317, 30eqtr3d 2266 1  |-  ( (
ph  /\  a  e.  A  /\  b  e.  B
)  ->  ( F `  P )  =  C )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1005    = wceq 1398    e. wcel 2202   [_csb 3128   <.cop 3676   ` cfv 5333  (class class class)co 6028    e. cmpo 6030
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-setind 4641
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-iota 5293  df-fun 5335  df-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033
This theorem is referenced by:  mpomulcn  15360
  Copyright terms: Public domain W3C validator