Theorem updjudhf 7425

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

Step	Hyp	Ref	Expression
1		eldju2ndl 7418	. . . . . 6 |- ( ( x e. ( A ⊔ B ) /\ ( 1st ` x ) = (/) ) -> ( 2nd ` x ) e. A )
2	1	ex 115	. . . . 5 |- ( x e. ( A ⊔ B ) -> ( ( 1st ` x ) = (/) -> ( 2nd ` x ) e. A ) )
3		updjud.f	. . . . . 6 |- ( ph -> F : A --> C )
4		ffvelcdm 5844	. . . . . . 7 |- ( ( F : A --> C /\ ( 2nd ` x ) e. A ) -> ( F ` ( 2nd ` x ) ) e. C )
5	4	ex 115	. . . . . 6 |- ( F : A --> C -> ( ( 2nd ` x ) e. A -> ( F ` ( 2nd ` x ) ) e. C ) )
6	3, 5	syl 14	. . . . 5 |- ( ph -> ( ( 2nd ` x ) e. A -> ( F ` ( 2nd ` x ) ) e. C ) )
7	2, 6	sylan9r 414	. . . 4 |- ( ( ph /\ x e. ( A ⊔ B ) ) -> ( ( 1st ` x ) = (/) -> ( F ` ( 2nd ` x ) ) e. C ) )
8	7	imp 124	. . 3 |- ( ( ( ph /\ x e. ( A ⊔ B ) ) /\ ( 1st ` x ) = (/) ) -> ( F ` ( 2nd ` x ) ) e. C )
9		df-ne 2421	. . . . 5 |- ( ( 1st ` x ) =/= (/) <-> -. ( 1st ` x ) = (/) )
10		eldju2ndr 7419	. . . . . . 7 |- ( ( x e. ( A ⊔ B ) /\ ( 1st ` x ) =/= (/) ) -> ( 2nd ` x ) e. B )
11	10	ex 115	. . . . . 6 |- ( x e. ( A ⊔ B ) -> ( ( 1st ` x ) =/= (/) -> ( 2nd ` x ) e. B ) )
12		updjud.g	. . . . . . 7 |- ( ph -> G : B --> C )
13		ffvelcdm 5844	. . . . . . . 8 |- ( ( G : B --> C /\ ( 2nd ` x ) e. B ) -> ( G ` ( 2nd ` x ) ) e. C )
14	13	ex 115	. . . . . . 7 |- ( G : B --> C -> ( ( 2nd ` x ) e. B -> ( G ` ( 2nd ` x ) ) e. C ) )
15	12, 14	syl 14	. . . . . 6 |- ( ph -> ( ( 2nd ` x ) e. B -> ( G ` ( 2nd ` x ) ) e. C ) )
16	11, 15	sylan9r 414	. . . . 5 |- ( ( ph /\ x e. ( A ⊔ B ) ) -> ( ( 1st ` x ) =/= (/) -> ( G ` ( 2nd ` x ) ) e. C ) )
17	9, 16	biimtrrid 153	. . . 4 |- ( ( ph /\ x e. ( A ⊔ B ) ) -> ( -. ( 1st ` x ) = (/) -> ( G ` ( 2nd ` x ) ) e. C ) )
18	17	imp 124	. . 3 |- ( ( ( ph /\ x e. ( A ⊔ B ) ) /\ -. ( 1st ` x ) = (/) ) -> ( G ` ( 2nd ` x ) ) e. C )
19		eldju1st 7417	. . . . . 6 |- ( x e. ( A ⊔ B ) -> ( ( 1st ` x ) = (/) \/ ( 1st ` x ) = 1o ) )
20		1n0 6709	. . . . . . . 8 |- 1o =/= (/)
21		neeq1 2433	. . . . . . . 8 |- ( ( 1st ` x ) = 1o -> ( ( 1st ` x ) =/= (/) <-> 1o =/= (/) ) )
22	20, 21	mpbiri 168	. . . . . . 7 |- ( ( 1st ` x ) = 1o -> ( 1st ` x ) =/= (/) )
23	22	orim2i 773	. . . . . 6 |- ( ( ( 1st ` x ) = (/) \/ ( 1st ` x ) = 1o ) -> ( ( 1st ` x ) = (/) \/ ( 1st ` x ) =/= (/) ) )
24	19, 23	syl 14	. . . . 5 |- ( x e. ( A ⊔ B ) -> ( ( 1st ` x ) = (/) \/ ( 1st ` x ) =/= (/) ) )
25	24	adantl 277	. . . 4 |- ( ( ph /\ x e. ( A ⊔ B ) ) -> ( ( 1st ` x ) = (/) \/ ( 1st ` x ) =/= (/) ) )
26		dcne 2431	. . . 4 |- (DECID ( 1st ` x ) = (/) <-> ( ( 1st ` x ) = (/) \/ ( 1st ` x ) =/= (/) ) )
27	25, 26	sylibr 134	. . 3 |- ( ( ph /\ x e. ( A ⊔ B ) ) -> DECID ( 1st ` x ) = (/) )
28	8, 18, 27	ifcldadc 3670	. 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 ) ) ) )
30	28, 29	fmptd 5865	1 |- ( ph -> H : ( A ⊔ B ) --> C )

This proof depends on syntax axioms:   -. wn 3   -> wi 4   /\ wa 104   \/ wo 720  DECID wdc 846   = wceq 1402   e. wcel 2209   =/= wne 2420   (/)c0 3520   ifcif 3638   |-> cmpt 4193   -->wf 5376   ` cfv 5380   1stc1st 6376   2ndc2nd 6377   1oc1o 6684   ⊔ cdju 7383

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580

This proof depends on definitions:  df-bi 117  df-dc 847  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-iord 4513  df-on 4515  df-suc 4518  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-1st 6378  df-2nd 6379  df-1o 6691  df-dju 7384  df-inl 7393  df-inr 7394

This theorem is used by:  updjudhcoinlf  7426  updjudhcoinrg  7427  updjud  7428