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

Theorem updjudhf 7370
Description: The mapping of an element of the disjoint union to the value of the corresponding function is a function. (Contributed by AV, 26-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
updjudhf  |-  ( ph  ->  H : ( A B ) --> C )
Distinct variable groups:    x, A    x, B    x, C    ph, x
Allowed substitution hints:    F( x)    G( x)    H( x)

Proof of Theorem updjudhf
StepHypRef Expression
1 eldju2ndl 7363 . . . . . 6  |-  ( ( x  e.  ( A B )  /\  ( 1st `  x )  =  (/) )  ->  ( 2nd `  x )  e.  A
)
21ex 115 . . . . 5  |-  ( x  e.  ( A B )  ->  ( ( 1st `  x )  =  (/)  ->  ( 2nd `  x
)  e.  A ) )
3 updjud.f . . . . . 6  |-  ( ph  ->  F : A --> C )
4 ffvelcdm 5810 . . . . . . 7  |-  ( ( F : A --> C  /\  ( 2nd `  x )  e.  A )  -> 
( F `  ( 2nd `  x ) )  e.  C )
54ex 115 . . . . . 6  |-  ( F : A --> C  -> 
( ( 2nd `  x
)  e.  A  -> 
( F `  ( 2nd `  x ) )  e.  C ) )
63, 5syl 14 . . . . 5  |-  ( ph  ->  ( ( 2nd `  x
)  e.  A  -> 
( F `  ( 2nd `  x ) )  e.  C ) )
72, 6sylan9r 410 . . . 4  |-  ( (
ph  /\  x  e.  ( A B ) )  ->  ( ( 1st `  x )  =  (/)  ->  ( F `  ( 2nd `  x ) )  e.  C ) )
87imp 124 . . 3  |-  ( ( ( ph  /\  x  e.  ( A B )
)  /\  ( 1st `  x )  =  (/) )  ->  ( F `  ( 2nd `  x ) )  e.  C )
9 df-ne 2413 . . . . 5  |-  ( ( 1st `  x )  =/=  (/)  <->  -.  ( 1st `  x )  =  (/) )
10 eldju2ndr 7364 . . . . . . 7  |-  ( ( x  e.  ( A B )  /\  ( 1st `  x )  =/=  (/) )  ->  ( 2nd `  x )  e.  B
)
1110ex 115 . . . . . 6  |-  ( x  e.  ( A B )  ->  ( ( 1st `  x )  =/=  (/)  ->  ( 2nd `  x )  e.  B ) )
12 updjud.g . . . . . . 7  |-  ( ph  ->  G : B --> C )
13 ffvelcdm 5810 . . . . . . . 8  |-  ( ( G : B --> C  /\  ( 2nd `  x )  e.  B )  -> 
( G `  ( 2nd `  x ) )  e.  C )
1413ex 115 . . . . . . 7  |-  ( G : B --> C  -> 
( ( 2nd `  x
)  e.  B  -> 
( G `  ( 2nd `  x ) )  e.  C ) )
1512, 14syl 14 . . . . . 6  |-  ( ph  ->  ( ( 2nd `  x
)  e.  B  -> 
( G `  ( 2nd `  x ) )  e.  C ) )
1611, 15sylan9r 410 . . . . 5  |-  ( (
ph  /\  x  e.  ( A B ) )  ->  ( ( 1st `  x )  =/=  (/)  ->  ( G `  ( 2nd `  x ) )  e.  C ) )
179, 16biimtrrid 153 . . . 4  |-  ( (
ph  /\  x  e.  ( A B ) )  ->  ( -.  ( 1st `  x )  =  (/)  ->  ( G `  ( 2nd `  x ) )  e.  C ) )
1817imp 124 . . 3  |-  ( ( ( ph  /\  x  e.  ( A B )
)  /\  -.  ( 1st `  x )  =  (/) )  ->  ( G `
 ( 2nd `  x
) )  e.  C
)
19 eldju1st 7362 . . . . . 6  |-  ( x  e.  ( A B )  ->  ( ( 1st `  x )  =  (/)  \/  ( 1st `  x
)  =  1o ) )
20 1n0 6665 . . . . . . . 8  |-  1o  =/=  (/)
21 neeq1 2425 . . . . . . . 8  |-  ( ( 1st `  x )  =  1o  ->  (
( 1st `  x
)  =/=  (/)  <->  1o  =/=  (/) ) )
2220, 21mpbiri 168 . . . . . . 7  |-  ( ( 1st `  x )  =  1o  ->  ( 1st `  x )  =/=  (/) )
2322orim2i 769 . . . . . 6  |-  ( ( ( 1st `  x
)  =  (/)  \/  ( 1st `  x )  =  1o )  ->  (
( 1st `  x
)  =  (/)  \/  ( 1st `  x )  =/=  (/) ) )
2419, 23syl 14 . . . . 5  |-  ( x  e.  ( A B )  ->  ( ( 1st `  x )  =  (/)  \/  ( 1st `  x
)  =/=  (/) ) )
2524adantl 277 . . . 4  |-  ( (
ph  /\  x  e.  ( A B ) )  ->  ( ( 1st `  x )  =  (/)  \/  ( 1st `  x
)  =/=  (/) ) )
26 dcne 2423 . . . 4  |-  (DECID  ( 1st `  x )  =  (/)  <->  (
( 1st `  x
)  =  (/)  \/  ( 1st `  x )  =/=  (/) ) )
2725, 26sylibr 134 . . 3  |-  ( (
ph  /\  x  e.  ( A B ) )  -> DECID 
( 1st `  x
)  =  (/) )
288, 18, 27ifcldadc 3652 . 2  |-  ( (
ph  /\  x  e.  ( A B ) )  ->  if ( ( 1st `  x )  =  (/) ,  ( F `
 ( 2nd `  x
) ) ,  ( G `  ( 2nd `  x ) ) )  e.  C )
29 updjudhf.h . 2  |-  H  =  ( x  e.  ( A B )  |->  if ( ( 1st `  x
)  =  (/) ,  ( F `  ( 2nd `  x ) ) ,  ( G `  ( 2nd `  x ) ) ) )
3028, 29fmptd 5831 1  |-  ( ph  ->  H : ( A B ) --> C )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    \/ wo 716  DECID wdc 842    = wceq 1398    e. wcel 2203    =/= wne 2412   (/)c0 3508   ifcif 3620    |-> cmpt 4171   -->wf 5348   ` cfv 5352   1stc1st 6332   2ndc2nd 6333   1oc1o 6640   ⊔ cdju 7328
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-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-nul 4236  ax-pow 4287  ax-pr 4322  ax-un 4554
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-if 3621  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-opab 4172  df-mpt 4173  df-tr 4209  df-id 4414  df-iord 4487  df-on 4489  df-suc 4492  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-1st 6334  df-2nd 6335  df-1o 6647  df-dju 7329  df-inl 7338  df-inr 7339
This theorem is referenced by:  updjudhcoinlf  7371  updjudhcoinrg  7372  updjud  7373
  Copyright terms: Public domain W3C validator