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

Theorem djurcl 7392
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 2833 . . 3  |-  ( C  e.  B  ->  C  e.  _V )
2 1oex 6695 . . . . 5  |-  1o  e.  _V
32snid 3740 . . . 4  |-  1o  e.  { 1o }
4 opelxpi 4806 . . . 4  |-  ( ( 1o  e.  { 1o }  /\  C  e.  B
)  ->  <. 1o ,  C >.  e.  ( { 1o }  X.  B
) )
53, 4mpan 428 . . 3  |-  ( C  e.  B  ->  <. 1o ,  C >.  e.  ( { 1o }  X.  B
) )
6 opeq2 3905 . . . 4  |-  ( x  =  C  ->  <. 1o ,  x >.  =  <. 1o ,  C >. )
7 df-inr 7388 . . . 4  |- inr  =  ( x  e.  _V  |->  <. 1o ,  x >. )
86, 7fvmptg 5781 . . 3  |-  ( ( C  e.  _V  /\  <. 1o ,  C >.  e.  ( { 1o }  X.  B ) )  -> 
(inr `  C )  =  <. 1o ,  C >. )
91, 5, 8syl2anc 415 . 2  |-  ( C  e.  B  ->  (inr `  C )  =  <. 1o ,  C >. )
10 elun2 3397 . . . 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 7378 . . 3  |-  ( A B )  =  ( ( { (/) }  X.  A )  u.  ( { 1o }  X.  B
) )
1311, 12eleqtrrdi 2332 . 2  |-  ( C  e.  B  ->  <. 1o ,  C >.  e.  ( A B ) )
149, 13eqeltrd 2315 1  |-  ( C  e.  B  ->  (inr `  C )  e.  ( A B ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    = wceq 1402    e. wcel 2209   _Vcvv 2821    u. cun 3218   (/)c0 3520   {csn 3709   <.cop 3712    X. cxp 4772   ` cfv 5377   1oc1o 6680   ⊔ cdju 7377  inrcinr 7386
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-suc 4516  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fv 5385  df-1o 6687  df-dju 7378  df-inr 7388
This theorem is used by:  updjudhcoinrg  7421  omp1eomlem  7434  difinfsnlem  7439  difinfsn  7440  0ct  7447  ctmlemr  7448  ctssdclemn0  7450  exmidfodomrlemr  7554  exmidfodomrlemrALT  7555
  Copyright terms: Public domain W3C validator