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

Theorem djulclr 7110
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 5579 . 2  |-  ( C  e.  A  ->  (
(inl  |`  A ) `  C )  =  (inl
`  C ) )
2 elex 2771 . . . 4  |-  ( C  e.  A  ->  C  e.  _V )
3 0ex 4157 . . . . . 6  |-  (/)  e.  _V
43snid 3650 . . . . 5  |-  (/)  e.  { (/)
}
5 opelxpi 4692 . . . . 5  |-  ( (
(/)  e.  { (/) }  /\  C  e.  A )  -> 
<. (/) ,  C >.  e.  ( { (/) }  X.  A ) )
64, 5mpan 424 . . . 4  |-  ( C  e.  A  ->  <. (/) ,  C >.  e.  ( { (/) }  X.  A ) )
7 opeq2 3806 . . . . 5  |-  ( x  =  C  ->  <. (/) ,  x >.  =  <. (/) ,  C >. )
8 df-inl 7108 . . . . 5  |- inl  =  ( x  e.  _V  |->  <. (/)
,  x >. )
97, 8fvmptg 5634 . . . 4  |-  ( ( C  e.  _V  /\  <. (/)
,  C >.  e.  ( { (/) }  X.  A
) )  ->  (inl `  C )  =  <. (/)
,  C >. )
102, 6, 9syl2anc 411 . . 3  |-  ( C  e.  A  ->  (inl `  C )  =  <. (/)
,  C >. )
11 elun1 3327 . . . . 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 7099 . . . 4  |-  ( A B )  =  ( ( { (/) }  X.  A )  u.  ( { 1o }  X.  B
) )
1412, 13eleqtrrdi 2287 . . 3  |-  ( C  e.  A  ->  <. (/) ,  C >.  e.  ( A B ) )
1510, 14eqeltrd 2270 . 2  |-  ( C  e.  A  ->  (inl `  C )  e.  ( A B ) )
161, 15eqeltrd 2270 1  |-  ( C  e.  A  ->  (
(inl  |`  A ) `  C )  e.  ( A B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1364    e. wcel 2164   _Vcvv 2760    u. cun 3152   (/)c0 3447   {csn 3619   <.cop 3622    X. cxp 4658    |` cres 4662   ` cfv 5255   1oc1o 6464   ⊔ cdju 7098  inlcinl 7106
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2167  ax-ext 2175  ax-sep 4148  ax-nul 4156  ax-pow 4204  ax-pr 4239
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-v 2762  df-sbc 2987  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-nul 3448  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-br 4031  df-opab 4092  df-mpt 4093  df-id 4325  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-res 4672  df-iota 5216  df-fun 5257  df-fv 5263  df-dju 7099  df-inl 7108
This theorem is referenced by:  inlresf1  7122
  Copyright terms: Public domain W3C validator