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

Theorem djurcl 7127
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 2774 . . 3  |-  ( C  e.  B  ->  C  e.  _V )
2 1oex 6491 . . . . 5  |-  1o  e.  _V
32snid 3654 . . . 4  |-  1o  e.  { 1o }
4 opelxpi 4696 . . . 4  |-  ( ( 1o  e.  { 1o }  /\  C  e.  B
)  ->  <. 1o ,  C >.  e.  ( { 1o }  X.  B
) )
53, 4mpan 424 . . 3  |-  ( C  e.  B  ->  <. 1o ,  C >.  e.  ( { 1o }  X.  B
) )
6 opeq2 3810 . . . 4  |-  ( x  =  C  ->  <. 1o ,  x >.  =  <. 1o ,  C >. )
7 df-inr 7123 . . . 4  |- inr  =  ( x  e.  _V  |->  <. 1o ,  x >. )
86, 7fvmptg 5640 . . 3  |-  ( ( C  e.  _V  /\  <. 1o ,  C >.  e.  ( { 1o }  X.  B ) )  -> 
(inr `  C )  =  <. 1o ,  C >. )
91, 5, 8syl2anc 411 . 2  |-  ( C  e.  B  ->  (inr `  C )  =  <. 1o ,  C >. )
10 elun2 3332 . . . 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 7113 . . 3  |-  ( A B )  =  ( ( { (/) }  X.  A )  u.  ( { 1o }  X.  B
) )
1311, 12eleqtrrdi 2290 . 2  |-  ( C  e.  B  ->  <. 1o ,  C >.  e.  ( A B ) )
149, 13eqeltrd 2273 1  |-  ( C  e.  B  ->  (inr `  C )  e.  ( A B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1364    e. wcel 2167   _Vcvv 2763    u. cun 3155   (/)c0 3451   {csn 3623   <.cop 3626    X. cxp 4662   ` cfv 5259   1oc1o 6476   ⊔ cdju 7112  inrcinr 7121
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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-nul 4160  ax-pow 4208  ax-pr 4243  ax-un 4469
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-sbc 2990  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-br 4035  df-opab 4096  df-mpt 4097  df-tr 4133  df-id 4329  df-iord 4402  df-on 4404  df-suc 4407  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-iota 5220  df-fun 5261  df-fv 5267  df-1o 6483  df-dju 7113  df-inr 7123
This theorem is referenced by:  updjudhcoinrg  7156  omp1eomlem  7169  difinfsnlem  7174  difinfsn  7175  0ct  7182  ctmlemr  7183  ctssdclemn0  7185  exmidfodomrlemr  7281  exmidfodomrlemrALT  7282
  Copyright terms: Public domain W3C validator