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

Theorem djur 7259
Description: A member of a disjoint union can be mapped from one of the classes which produced it. (Contributed by Jim Kingdon, 23-Jun-2022.) Upgrade implication to biconditional and shorten proof. (Revised by BJ, 14-Jul-2023.)
Assertion
Ref Expression
djur  |-  ( C  e.  ( A B )  <-> 
( E. x  e.  A  C  =  (inl
`  x )  \/ 
E. x  e.  B  C  =  (inr `  x
) ) )
Distinct variable groups:    x, A    x, B    x, C

Proof of Theorem djur
StepHypRef Expression
1 eldju 7258 . 2  |-  ( C  e.  ( A B )  <-> 
( E. x  e.  A  C  =  ( (inl  |`  A ) `  x )  \/  E. x  e.  B  C  =  ( (inr  |`  B ) `
 x ) ) )
2 fvres 5659 . . . . 5  |-  ( x  e.  A  ->  (
(inl  |`  A ) `  x )  =  (inl
`  x ) )
32eqeq2d 2241 . . . 4  |-  ( x  e.  A  ->  ( C  =  ( (inl  |`  A ) `  x
)  <->  C  =  (inl `  x ) ) )
43rexbiia 2545 . . 3  |-  ( E. x  e.  A  C  =  ( (inl  |`  A ) `
 x )  <->  E. x  e.  A  C  =  (inl `  x ) )
5 fvres 5659 . . . . 5  |-  ( x  e.  B  ->  (
(inr  |`  B ) `  x )  =  (inr
`  x ) )
65eqeq2d 2241 . . . 4  |-  ( x  e.  B  ->  ( C  =  ( (inr  |`  B ) `  x
)  <->  C  =  (inr `  x ) ) )
76rexbiia 2545 . . 3  |-  ( E. x  e.  B  C  =  ( (inr  |`  B ) `
 x )  <->  E. x  e.  B  C  =  (inr `  x ) )
84, 7orbi12i 769 . 2  |-  ( ( E. x  e.  A  C  =  ( (inl  |`  A ) `  x
)  \/  E. x  e.  B  C  =  ( (inr  |`  B ) `
 x ) )  <-> 
( E. x  e.  A  C  =  (inl
`  x )  \/ 
E. x  e.  B  C  =  (inr `  x
) ) )
91, 8bitri 184 1  |-  ( C  e.  ( A B )  <-> 
( E. x  e.  A  C  =  (inl
`  x )  \/ 
E. x  e.  B  C  =  (inr `  x
) ) )
Colors of variables: wff set class
Syntax hints:    <-> wb 105    \/ wo 713    = wceq 1395    e. wcel 2200   E.wrex 2509    |` cres 4725   ` cfv 5324   ⊔ cdju 7227  inlcinl 7235  inrcinr 7236
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-nul 4213  ax-pow 4262  ax-pr 4297  ax-un 4528
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2802  df-sbc 3030  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-br 4087  df-opab 4149  df-mpt 4150  df-tr 4186  df-id 4388  df-iord 4461  df-on 4463  df-suc 4466  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-1st 6298  df-2nd 6299  df-1o 6577  df-dju 7228  df-inl 7237  df-inr 7238
This theorem is referenced by:  djuss  7260  updjud  7272  omp1eomlem  7284  0ct  7297  ctmlemr  7298  ctssdclemn0  7300  fodjuomnilemdc  7334  exmidfodomrlemeldju  7400
  Copyright terms: Public domain W3C validator