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

Theorem djulclr 7389
Description: Left closure of disjoint union. (Contributed by Jim Kingdon, 21-Jun-2022.) (Revised by BJ, 6-Jul-2022.)
Assertion
Ref Expression
djulclr  |-  ( C  e.  A  ->  (
(inl  |`  A ) `  C )  e.  ( A B ) )

Proof of Theorem djulclr
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 fvres 5719 . 2  |-  ( C  e.  A  ->  (
(inl  |`  A ) `  C )  =  (inl
`  C ) )
2 elex 2833 . . . 4  |-  ( C  e.  A  ->  C  e.  _V )
3 0ex 4260 . . . . . 6  |-  (/)  e.  _V
43snid 3740 . . . . 5  |-  (/)  e.  { (/)
}
5 opelxpi 4806 . . . . 5  |-  ( (
(/)  e.  { (/) }  /\  C  e.  A )  -> 
<. (/) ,  C >.  e.  ( { (/) }  X.  A ) )
64, 5mpan 428 . . . 4  |-  ( C  e.  A  ->  <. (/) ,  C >.  e.  ( { (/) }  X.  A ) )
7 opeq2 3905 . . . . 5  |-  ( x  =  C  ->  <. (/) ,  x >.  =  <. (/) ,  C >. )
8 df-inl 7387 . . . . 5  |- inl  =  ( x  e.  _V  |->  <. (/)
,  x >. )
97, 8fvmptg 5781 . . . 4  |-  ( ( C  e.  _V  /\  <. (/)
,  C >.  e.  ( { (/) }  X.  A
) )  ->  (inl `  C )  =  <. (/)
,  C >. )
102, 6, 9syl2anc 415 . . 3  |-  ( C  e.  A  ->  (inl `  C )  =  <. (/)
,  C >. )
11 elun1 3396 . . . . 5  |-  ( <. (/)
,  C >.  e.  ( { (/) }  X.  A
)  ->  <. (/) ,  C >.  e.  ( ( {
(/) }  X.  A
)  u.  ( { 1o }  X.  B
) ) )
126, 11syl 14 . . . 4  |-  ( C  e.  A  ->  <. (/) ,  C >.  e.  ( ( {
(/) }  X.  A
)  u.  ( { 1o }  X.  B
) ) )
13 df-dju 7378 . . . 4  |-  ( A B )  =  ( ( { (/) }  X.  A )  u.  ( { 1o }  X.  B
) )
1412, 13eleqtrrdi 2332 . . 3  |-  ( C  e.  A  ->  <. (/) ,  C >.  e.  ( A B ) )
1510, 14eqeltrd 2315 . 2  |-  ( C  e.  A  ->  (inl `  C )  e.  ( A B ) )
161, 15eqeltrd 2315 1  |-  ( C  e.  A  ->  (
(inl  |`  A ) `  C )  e.  ( A B ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    = wceq 1402    e. wcel 2209   _Vcvv 2821    u. cun 3218   (/)c0 3520   {csn 3709   <.cop 3712    X. cxp 4772    |` cres 4776   ` cfv 5377   1oc1o 6680   ⊔ cdju 7377  inlcinl 7385
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 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346
This proof depends on definitions:  df-bi 117  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-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-res 4786  df-iota 5337  df-fun 5379  df-fv 5385  df-dju 7378  df-inl 7387
This theorem is used by:  inlresf1  7401
  Copyright terms: Public domain W3C validator