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

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

Proof of Theorem djurclr
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 fvres 5694 . 2  |-  ( C  e.  B  ->  (
(inr  |`  B ) `  C )  =  (inr
`  C ) )
2 elex 2825 . . . 4  |-  ( C  e.  B  ->  C  e.  _V )
3 1oex 6655 . . . . . 6  |-  1o  e.  _V
43snid 3720 . . . . 5  |-  1o  e.  { 1o }
5 opelxpi 4781 . . . . 5  |-  ( ( 1o  e.  { 1o }  /\  C  e.  B
)  ->  <. 1o ,  C >.  e.  ( { 1o }  X.  B
) )
64, 5mpan 424 . . . 4  |-  ( C  e.  B  ->  <. 1o ,  C >.  e.  ( { 1o }  X.  B
) )
7 opeq2 3884 . . . . 5  |-  ( x  =  C  ->  <. 1o ,  x >.  =  <. 1o ,  C >. )
8 df-inr 7339 . . . . 5  |- inr  =  ( x  e.  _V  |->  <. 1o ,  x >. )
97, 8fvmptg 5753 . . . 4  |-  ( ( C  e.  _V  /\  <. 1o ,  C >.  e.  ( { 1o }  X.  B ) )  -> 
(inr `  C )  =  <. 1o ,  C >. )
102, 6, 9syl2anc 411 . . 3  |-  ( C  e.  B  ->  (inr `  C )  =  <. 1o ,  C >. )
11 elun2 3387 . . . . 5  |-  ( <. 1o ,  C >.  e.  ( { 1o }  X.  B )  ->  <. 1o ,  C >.  e.  ( ( { (/) }  X.  A
)  u.  ( { 1o }  X.  B
) ) )
126, 11syl 14 . . . 4  |-  ( C  e.  B  ->  <. 1o ,  C >.  e.  ( ( { (/) }  X.  A
)  u.  ( { 1o }  X.  B
) ) )
13 df-dju 7329 . . . 4  |-  ( A B )  =  ( ( { (/) }  X.  A )  u.  ( { 1o }  X.  B
) )
1412, 13eleqtrrdi 2326 . . 3  |-  ( C  e.  B  ->  <. 1o ,  C >.  e.  ( A B ) )
1510, 14eqeltrd 2309 . 2  |-  ( C  e.  B  ->  (inr `  C )  e.  ( A B ) )
161, 15eqeltrd 2309 1  |-  ( C  e.  B  ->  (
(inr  |`  B ) `  C )  e.  ( A B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1398    e. wcel 2203   _Vcvv 2813    u. cun 3209   (/)c0 3508   {csn 3689   <.cop 3692    X. cxp 4747    |` cres 4751   ` cfv 5352   1oc1o 6640   ⊔ cdju 7328  inrcinr 7337
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-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-ral 2525  df-rex 2526  df-v 2815  df-sbc 3043  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  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-res 4761  df-iota 5312  df-fun 5354  df-fv 5360  df-1o 6647  df-dju 7329  df-inr 7339
This theorem is referenced by:  inrresf1  7353
  Copyright terms: Public domain W3C validator