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

Theorem updjudhcoinlf 7270
Description: The composition of the mapping of an element of the disjoint union to the value of the corresponding function and the left injection equals the first function. (Contributed by AV, 27-Jun-2022.)
Hypotheses
Ref Expression
updjud.f  |-  ( ph  ->  F : A --> C )
updjud.g  |-  ( ph  ->  G : B --> C )
updjudhf.h  |-  H  =  ( x  e.  ( A B )  |->  if ( ( 1st `  x
)  =  (/) ,  ( F `  ( 2nd `  x ) ) ,  ( G `  ( 2nd `  x ) ) ) )
Assertion
Ref Expression
updjudhcoinlf  |-  ( ph  ->  ( H  o.  (inl  |`  A ) )  =  F )
Distinct variable groups:    x, A    x, B    x, C    ph, x    x, F
Allowed substitution hints:    G( x)    H( x)

Proof of Theorem updjudhcoinlf
Dummy variable  a is distinct from all other variables.
StepHypRef Expression
1 updjud.f . . . . 5  |-  ( ph  ->  F : A --> C )
2 updjud.g . . . . 5  |-  ( ph  ->  G : B --> C )
3 updjudhf.h . . . . 5  |-  H  =  ( x  e.  ( A B )  |->  if ( ( 1st `  x
)  =  (/) ,  ( F `  ( 2nd `  x ) ) ,  ( G `  ( 2nd `  x ) ) ) )
41, 2, 3updjudhf 7269 . . . 4  |-  ( ph  ->  H : ( A B ) --> C )
5 ffn 5479 . . . 4  |-  ( H : ( A B ) --> C  ->  H  Fn  ( A B ) )
64, 5syl 14 . . 3  |-  ( ph  ->  H  Fn  ( A B ) )
7 inlresf1 7251 . . . 4  |-  (inl  |`  A ) : A -1-1-> ( A B )
8 f1fn 5541 . . . 4  |-  ( (inl  |`  A ) : A -1-1-> ( A B )  ->  (inl  |`  A )  Fn  A
)
97, 8mp1i 10 . . 3  |-  ( ph  ->  (inl  |`  A )  Fn  A )
10 f1f 5539 . . . . 5  |-  ( (inl  |`  A ) : A -1-1-> ( A B )  ->  (inl  |`  A ) : A --> ( A B ) )
117, 10ax-mp 5 . . . 4  |-  (inl  |`  A ) : A --> ( A B )
12 frn 5488 . . . 4  |-  ( (inl  |`  A ) : A --> ( A B )  ->  ran  (inl  |`  A )  C_  ( A B ) )
1311, 12mp1i 10 . . 3  |-  ( ph  ->  ran  (inl  |`  A ) 
C_  ( A B ) )
14 fnco 5437 . . 3  |-  ( ( H  Fn  ( A B )  /\  (inl  |`  A )  Fn  A  /\  ran  (inl  |`  A ) 
C_  ( A B ) )  ->  ( H  o.  (inl  |`  A ) )  Fn  A )
156, 9, 13, 14syl3anc 1271 . 2  |-  ( ph  ->  ( H  o.  (inl  |`  A ) )  Fn  A )
16 ffn 5479 . . 3  |-  ( F : A --> C  ->  F  Fn  A )
171, 16syl 14 . 2  |-  ( ph  ->  F  Fn  A )
18 fvco2 5711 . . . 4  |-  ( ( (inl  |`  A )  Fn  A  /\  a  e.  A )  ->  (
( H  o.  (inl  |`  A ) ) `  a )  =  ( H `  ( (inl  |`  A ) `  a
) ) )
199, 18sylan 283 . . 3  |-  ( (
ph  /\  a  e.  A )  ->  (
( H  o.  (inl  |`  A ) ) `  a )  =  ( H `  ( (inl  |`  A ) `  a
) ) )
20 fvres 5659 . . . . . 6  |-  ( a  e.  A  ->  (
(inl  |`  A ) `  a )  =  (inl
`  a ) )
2120adantl 277 . . . . 5  |-  ( (
ph  /\  a  e.  A )  ->  (
(inl  |`  A ) `  a )  =  (inl
`  a ) )
2221fveq2d 5639 . . . 4  |-  ( (
ph  /\  a  e.  A )  ->  ( H `  ( (inl  |`  A ) `  a
) )  =  ( H `  (inl `  a ) ) )
233a1i 9 . . . . 5  |-  ( (
ph  /\  a  e.  A )  ->  H  =  ( x  e.  ( A B )  |->  if ( ( 1st `  x )  =  (/) ,  ( F `  ( 2nd `  x ) ) ,  ( G `  ( 2nd `  x ) ) ) ) )
24 fveq2 5635 . . . . . . . . 9  |-  ( x  =  (inl `  a
)  ->  ( 1st `  x )  =  ( 1st `  (inl `  a ) ) )
2524eqeq1d 2238 . . . . . . . 8  |-  ( x  =  (inl `  a
)  ->  ( ( 1st `  x )  =  (/) 
<->  ( 1st `  (inl `  a ) )  =  (/) ) )
26 fveq2 5635 . . . . . . . . 9  |-  ( x  =  (inl `  a
)  ->  ( 2nd `  x )  =  ( 2nd `  (inl `  a ) ) )
2726fveq2d 5639 . . . . . . . 8  |-  ( x  =  (inl `  a
)  ->  ( F `  ( 2nd `  x
) )  =  ( F `  ( 2nd `  (inl `  a )
) ) )
2826fveq2d 5639 . . . . . . . 8  |-  ( x  =  (inl `  a
)  ->  ( G `  ( 2nd `  x
) )  =  ( G `  ( 2nd `  (inl `  a )
) ) )
2925, 27, 28ifbieq12d 3630 . . . . . . 7  |-  ( x  =  (inl `  a
)  ->  if (
( 1st `  x
)  =  (/) ,  ( F `  ( 2nd `  x ) ) ,  ( G `  ( 2nd `  x ) ) )  =  if ( ( 1st `  (inl `  a ) )  =  (/) ,  ( F `  ( 2nd `  (inl `  a ) ) ) ,  ( G `  ( 2nd `  (inl `  a ) ) ) ) )
3029adantl 277 . . . . . 6  |-  ( ( ( ph  /\  a  e.  A )  /\  x  =  (inl `  a )
)  ->  if (
( 1st `  x
)  =  (/) ,  ( F `  ( 2nd `  x ) ) ,  ( G `  ( 2nd `  x ) ) )  =  if ( ( 1st `  (inl `  a ) )  =  (/) ,  ( F `  ( 2nd `  (inl `  a ) ) ) ,  ( G `  ( 2nd `  (inl `  a ) ) ) ) )
31 1stinl 7264 . . . . . . . . 9  |-  ( a  e.  A  ->  ( 1st `  (inl `  a
) )  =  (/) )
3231adantl 277 . . . . . . . 8  |-  ( (
ph  /\  a  e.  A )  ->  ( 1st `  (inl `  a
) )  =  (/) )
3332adantr 276 . . . . . . 7  |-  ( ( ( ph  /\  a  e.  A )  /\  x  =  (inl `  a )
)  ->  ( 1st `  (inl `  a )
)  =  (/) )
3433iftrued 3610 . . . . . 6  |-  ( ( ( ph  /\  a  e.  A )  /\  x  =  (inl `  a )
)  ->  if (
( 1st `  (inl `  a ) )  =  (/) ,  ( F `  ( 2nd `  (inl `  a ) ) ) ,  ( G `  ( 2nd `  (inl `  a ) ) ) )  =  ( F `
 ( 2nd `  (inl `  a ) ) ) )
3530, 34eqtrd 2262 . . . . 5  |-  ( ( ( ph  /\  a  e.  A )  /\  x  =  (inl `  a )
)  ->  if (
( 1st `  x
)  =  (/) ,  ( F `  ( 2nd `  x ) ) ,  ( G `  ( 2nd `  x ) ) )  =  ( F `
 ( 2nd `  (inl `  a ) ) ) )
36 djulcl 7241 . . . . . 6  |-  ( a  e.  A  ->  (inl `  a )  e.  ( A B ) )
3736adantl 277 . . . . 5  |-  ( (
ph  /\  a  e.  A )  ->  (inl `  a )  e.  ( A B ) )
381adantr 276 . . . . . 6  |-  ( (
ph  /\  a  e.  A )  ->  F : A --> C )
39 2ndinl 7265 . . . . . . . 8  |-  ( a  e.  A  ->  ( 2nd `  (inl `  a
) )  =  a )
4039adantl 277 . . . . . . 7  |-  ( (
ph  /\  a  e.  A )  ->  ( 2nd `  (inl `  a
) )  =  a )
41 simpr 110 . . . . . . 7  |-  ( (
ph  /\  a  e.  A )  ->  a  e.  A )
4240, 41eqeltrd 2306 . . . . . 6  |-  ( (
ph  /\  a  e.  A )  ->  ( 2nd `  (inl `  a
) )  e.  A
)
4338, 42ffvelcdmd 5779 . . . . 5  |-  ( (
ph  /\  a  e.  A )  ->  ( F `  ( 2nd `  (inl `  a )
) )  e.  C
)
4423, 35, 37, 43fvmptd 5723 . . . 4  |-  ( (
ph  /\  a  e.  A )  ->  ( H `  (inl `  a
) )  =  ( F `  ( 2nd `  (inl `  a )
) ) )
4522, 44eqtrd 2262 . . 3  |-  ( (
ph  /\  a  e.  A )  ->  ( H `  ( (inl  |`  A ) `  a
) )  =  ( F `  ( 2nd `  (inl `  a )
) ) )
4640fveq2d 5639 . . 3  |-  ( (
ph  /\  a  e.  A )  ->  ( F `  ( 2nd `  (inl `  a )
) )  =  ( F `  a ) )
4719, 45, 463eqtrd 2266 . 2  |-  ( (
ph  /\  a  e.  A )  ->  (
( H  o.  (inl  |`  A ) ) `  a )  =  ( F `  a ) )
4815, 17, 47eqfnfvd 5743 1  |-  ( ph  ->  ( H  o.  (inl  |`  A ) )  =  F )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1395    e. wcel 2200    C_ wss 3198   (/)c0 3492   ifcif 3603    |-> cmpt 4148   ran crn 4724    |` cres 4725    o. ccom 4727    Fn wfn 5319   -->wf 5320   -1-1->wf1 5321   ` cfv 5324   1stc1st 6296   2ndc2nd 6297   ⊔ cdju 7227  inlcinl 7235
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-nul 4213  ax-pow 4262  ax-pr 4297  ax-un 4528
This theorem depends on definitions:  df-bi 117  df-dc 840  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-if 3604  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-br 4087  df-opab 4149  df-mpt 4150  df-tr 4186  df-id 4388  df-iord 4461  df-on 4463  df-suc 4466  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-1st 6298  df-2nd 6299  df-1o 6577  df-dju 7228  df-inl 7237  df-inr 7238
This theorem is referenced by:  updjud  7272
  Copyright terms: Public domain W3C validator