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

Theorem djulclr 7005
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 5504 . 2  |-  ( C  e.  A  ->  (
(inl  |`  A ) `  C )  =  (inl
`  C ) )
2 elex 2732 . . . 4  |-  ( C  e.  A  ->  C  e.  _V )
3 0ex 4103 . . . . . 6  |-  (/)  e.  _V
43snid 3601 . . . . 5  |-  (/)  e.  { (/)
}
5 opelxpi 4630 . . . . 5  |-  ( (
(/)  e.  { (/) }  /\  C  e.  A )  -> 
<. (/) ,  C >.  e.  ( { (/) }  X.  A ) )
64, 5mpan 421 . . . 4  |-  ( C  e.  A  ->  <. (/) ,  C >.  e.  ( { (/) }  X.  A ) )
7 opeq2 3753 . . . . 5  |-  ( x  =  C  ->  <. (/) ,  x >.  =  <. (/) ,  C >. )
8 df-inl 7003 . . . . 5  |- inl  =  ( x  e.  _V  |->  <. (/)
,  x >. )
97, 8fvmptg 5556 . . . 4  |-  ( ( C  e.  _V  /\  <. (/)
,  C >.  e.  ( { (/) }  X.  A
) )  ->  (inl `  C )  =  <. (/)
,  C >. )
102, 6, 9syl2anc 409 . . 3  |-  ( C  e.  A  ->  (inl `  C )  =  <. (/)
,  C >. )
11 elun1 3284 . . . . 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 6994 . . . 4  |-  ( A B )  =  ( ( { (/) }  X.  A )  u.  ( { 1o }  X.  B
) )
1412, 13eleqtrrdi 2258 . . 3  |-  ( C  e.  A  ->  <. (/) ,  C >.  e.  ( A B ) )
1510, 14eqeltrd 2241 . 2  |-  ( C  e.  A  ->  (inl `  C )  e.  ( A B ) )
161, 15eqeltrd 2241 1  |-  ( C  e.  A  ->  (
(inl  |`  A ) `  C )  e.  ( A B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1342    e. wcel 2135   _Vcvv 2721    u. cun 3109   (/)c0 3404   {csn 3570   <.cop 3573    X. cxp 4596    |` cres 4600   ` cfv 5182   1oc1o 6368   ⊔ cdju 6993  inlcinl 7001
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1434  ax-7 1435  ax-gen 1436  ax-ie1 1480  ax-ie2 1481  ax-8 1491  ax-10 1492  ax-11 1493  ax-i12 1494  ax-bndl 1496  ax-4 1497  ax-17 1513  ax-i9 1517  ax-ial 1521  ax-i5r 1522  ax-14 2138  ax-ext 2146  ax-sep 4094  ax-nul 4102  ax-pow 4147  ax-pr 4181
This theorem depends on definitions:  df-bi 116  df-3an 969  df-tru 1345  df-nf 1448  df-sb 1750  df-eu 2016  df-mo 2017  df-clab 2151  df-cleq 2157  df-clel 2160  df-nfc 2295  df-ral 2447  df-rex 2448  df-v 2723  df-sbc 2947  df-dif 3113  df-un 3115  df-in 3117  df-ss 3124  df-nul 3405  df-pw 3555  df-sn 3576  df-pr 3577  df-op 3579  df-uni 3784  df-br 3977  df-opab 4038  df-mpt 4039  df-id 4265  df-xp 4604  df-rel 4605  df-cnv 4606  df-co 4607  df-dm 4608  df-res 4610  df-iota 5147  df-fun 5184  df-fv 5190  df-dju 6994  df-inl 7003
This theorem is referenced by:  inlresf1  7017
  Copyright terms: Public domain W3C validator