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

Theorem djurcl 7029
Description: Right closure of disjoint union. (Contributed by Jim Kingdon, 21-Jun-2022.)
Assertion
Ref Expression
djurcl  |-  ( C  e.  B  ->  (inr `  C )  e.  ( A B ) )

Proof of Theorem djurcl
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 elex 2741 . . 3  |-  ( C  e.  B  ->  C  e.  _V )
2 1oex 6403 . . . . 5  |-  1o  e.  _V
32snid 3614 . . . 4  |-  1o  e.  { 1o }
4 opelxpi 4643 . . . 4  |-  ( ( 1o  e.  { 1o }  /\  C  e.  B
)  ->  <. 1o ,  C >.  e.  ( { 1o }  X.  B
) )
53, 4mpan 422 . . 3  |-  ( C  e.  B  ->  <. 1o ,  C >.  e.  ( { 1o }  X.  B
) )
6 opeq2 3766 . . . 4  |-  ( x  =  C  ->  <. 1o ,  x >.  =  <. 1o ,  C >. )
7 df-inr 7025 . . . 4  |- inr  =  ( x  e.  _V  |->  <. 1o ,  x >. )
86, 7fvmptg 5572 . . 3  |-  ( ( C  e.  _V  /\  <. 1o ,  C >.  e.  ( { 1o }  X.  B ) )  -> 
(inr `  C )  =  <. 1o ,  C >. )
91, 5, 8syl2anc 409 . 2  |-  ( C  e.  B  ->  (inr `  C )  =  <. 1o ,  C >. )
10 elun2 3295 . . . 4  |-  ( <. 1o ,  C >.  e.  ( { 1o }  X.  B )  ->  <. 1o ,  C >.  e.  ( ( { (/) }  X.  A
)  u.  ( { 1o }  X.  B
) ) )
115, 10syl 14 . . 3  |-  ( C  e.  B  ->  <. 1o ,  C >.  e.  ( ( { (/) }  X.  A
)  u.  ( { 1o }  X.  B
) ) )
12 df-dju 7015 . . 3  |-  ( A B )  =  ( ( { (/) }  X.  A )  u.  ( { 1o }  X.  B
) )
1311, 12eleqtrrdi 2264 . 2  |-  ( C  e.  B  ->  <. 1o ,  C >.  e.  ( A B ) )
149, 13eqeltrd 2247 1  |-  ( C  e.  B  ->  (inr `  C )  e.  ( A B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1348    e. wcel 2141   _Vcvv 2730    u. cun 3119   (/)c0 3414   {csn 3583   <.cop 3586    X. cxp 4609   ` cfv 5198   1oc1o 6388   ⊔ cdju 7014  inrcinr 7023
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 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-nul 4115  ax-pow 4160  ax-pr 4194  ax-un 4418
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-v 2732  df-sbc 2956  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-nul 3415  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-br 3990  df-opab 4051  df-mpt 4052  df-tr 4088  df-id 4278  df-iord 4351  df-on 4353  df-suc 4356  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-iota 5160  df-fun 5200  df-fv 5206  df-1o 6395  df-dju 7015  df-inr 7025
This theorem is referenced by:  updjudhcoinrg  7058  omp1eomlem  7071  difinfsnlem  7076  difinfsn  7077  0ct  7084  ctmlemr  7085  ctssdclemn0  7087  exmidfodomrlemr  7179  exmidfodomrlemrALT  7180
  Copyright terms: Public domain W3C validator