Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >   Mathboxes  >  bj-charfundcALT Unicode version

Theorem bj-charfundcALT 15782
Description: Alternate proof of bj-charfundc 15781. It was expected to be much shorter since it uses bj-charfun 15780 for the main part of the proof and the rest is basic computations, but these turn out to be lengthy, maybe because of the limited library of available lemmas. (Contributed by BJ, 15-Aug-2024.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypotheses
Ref Expression
bj-charfundc.1  |-  ( ph  ->  F  =  ( x  e.  X  |->  if ( x  e.  A ,  1o ,  (/) ) ) )
bj-charfundc.dc  |-  ( ph  ->  A. x  e.  X DECID  x  e.  A )
Assertion
Ref Expression
bj-charfundcALT  |-  ( ph  ->  ( F : X --> 2o  /\  ( A. x  e.  ( X  i^i  A
) ( F `  x )  =  1o 
/\  A. x  e.  ( X  \  A ) ( F `  x
)  =  (/) ) ) )
Distinct variable groups:    ph, x    x, X    x, A    x, F

Proof of Theorem bj-charfundcALT
StepHypRef Expression
1 bj-charfundc.1 . . 3  |-  ( ph  ->  F  =  ( x  e.  X  |->  if ( x  e.  A ,  1o ,  (/) ) ) )
21bj-charfun 15780 . 2  |-  ( ph  ->  ( ( F : X
--> ~P 1o  /\  ( F  |`  ( ( X  i^i  A )  u.  ( X  \  A
) ) ) : ( ( X  i^i  A )  u.  ( X 
\  A ) ) --> 2o )  /\  ( A. x  e.  ( X  i^i  A ) ( F `  x )  =  1o  /\  A. x  e.  ( X  \  A ) ( F `
 x )  =  (/) ) ) )
3 difin 3410 . . . . . . . . . . . 12  |-  ( X 
\  ( X  i^i  A ) )  =  ( X  \  A )
43eqcomi 2209 . . . . . . . . . . 11  |-  ( X 
\  A )  =  ( X  \  ( X  i^i  A ) )
54a1i 9 . . . . . . . . . 10  |-  ( ph  ->  ( X  \  A
)  =  ( X 
\  ( X  i^i  A ) ) )
65uneq2d 3327 . . . . . . . . 9  |-  ( ph  ->  ( ( X  i^i  A )  u.  ( X 
\  A ) )  =  ( ( X  i^i  A )  u.  ( X  \  ( X  i^i  A ) ) ) )
7 inss1 3393 . . . . . . . . . . 11  |-  ( X  i^i  A )  C_  X
87a1i 9 . . . . . . . . . 10  |-  ( ph  ->  ( X  i^i  A
)  C_  X )
9 bj-charfundc.dc . . . . . . . . . . 11  |-  ( ph  ->  A. x  e.  X DECID  x  e.  A )
10 elin 3356 . . . . . . . . . . . . . 14  |-  ( x  e.  ( X  i^i  A )  <->  ( x  e.  X  /\  x  e.  A ) )
1110baibr 922 . . . . . . . . . . . . 13  |-  ( x  e.  X  ->  (
x  e.  A  <->  x  e.  ( X  i^i  A ) ) )
1211dcbid 840 . . . . . . . . . . . 12  |-  ( x  e.  X  ->  (DECID  x  e.  A  <-> DECID  x  e.  ( X  i^i  A ) ) )
1312ralbiia 2520 . . . . . . . . . . 11  |-  ( A. x  e.  X DECID  x  e.  A 
<-> 
A. x  e.  X DECID  x  e.  ( X  i^i  A
) )
149, 13sylib 122 . . . . . . . . . 10  |-  ( ph  ->  A. x  e.  X DECID  x  e.  ( X  i^i  A
) )
15 undifdcss 7022 . . . . . . . . . 10  |-  ( X  =  ( ( X  i^i  A )  u.  ( X  \  ( X  i^i  A ) ) )  <->  ( ( X  i^i  A )  C_  X  /\  A. x  e.  X DECID  x  e.  ( X  i^i  A ) ) )
168, 14, 15sylanbrc 417 . . . . . . . . 9  |-  ( ph  ->  X  =  ( ( X  i^i  A )  u.  ( X  \ 
( X  i^i  A
) ) ) )
176, 16eqtr4d 2241 . . . . . . . 8  |-  ( ph  ->  ( ( X  i^i  A )  u.  ( X 
\  A ) )  =  X )
1817reseq2d 4960 . . . . . . 7  |-  ( ph  ->  ( F  |`  (
( X  i^i  A
)  u.  ( X 
\  A ) ) )  =  ( F  |`  X ) )
19 ssidd 3214 . . . . . . . . 9  |-  ( ph  ->  X  C_  X )
2019resmptd 5011 . . . . . . . 8  |-  ( ph  ->  ( ( x  e.  X  |->  if ( x  e.  A ,  1o ,  (/) ) )  |`  X )  =  ( x  e.  X  |->  if ( x  e.  A ,  1o ,  (/) ) ) )
211reseq1d 4959 . . . . . . . 8  |-  ( ph  ->  ( F  |`  X )  =  ( ( x  e.  X  |->  if ( x  e.  A ,  1o ,  (/) ) )  |`  X ) )
2220, 21, 13eqtr4d 2248 . . . . . . 7  |-  ( ph  ->  ( F  |`  X )  =  F )
2318, 22eqtrd 2238 . . . . . 6  |-  ( ph  ->  ( F  |`  (
( X  i^i  A
)  u.  ( X 
\  A ) ) )  =  F )
2423, 17feq12d 5417 . . . . 5  |-  ( ph  ->  ( ( F  |`  ( ( X  i^i  A )  u.  ( X 
\  A ) ) ) : ( ( X  i^i  A )  u.  ( X  \  A ) ) --> 2o  <->  F : X --> 2o ) )
2524biimpd 144 . . . 4  |-  ( ph  ->  ( ( F  |`  ( ( X  i^i  A )  u.  ( X 
\  A ) ) ) : ( ( X  i^i  A )  u.  ( X  \  A ) ) --> 2o 
->  F : X --> 2o ) )
2625adantld 278 . . 3  |-  ( ph  ->  ( ( F : X
--> ~P 1o  /\  ( F  |`  ( ( X  i^i  A )  u.  ( X  \  A
) ) ) : ( ( X  i^i  A )  u.  ( X 
\  A ) ) --> 2o )  ->  F : X --> 2o ) )
2726anim1d 336 . 2  |-  ( ph  ->  ( ( ( F : X --> ~P 1o  /\  ( F  |`  (
( X  i^i  A
)  u.  ( X 
\  A ) ) ) : ( ( X  i^i  A )  u.  ( X  \  A ) ) --> 2o )  /\  ( A. x  e.  ( X  i^i  A ) ( F `
 x )  =  1o  /\  A. x  e.  ( X  \  A
) ( F `  x )  =  (/) ) )  ->  ( F : X --> 2o  /\  ( A. x  e.  ( X  i^i  A ) ( F `  x
)  =  1o  /\  A. x  e.  ( X 
\  A ) ( F `  x )  =  (/) ) ) ) )
282, 27mpd 13 1  |-  ( ph  ->  ( F : X --> 2o  /\  ( A. x  e.  ( X  i^i  A
) ( F `  x )  =  1o 
/\  A. x  e.  ( X  \  A ) ( F `  x
)  =  (/) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104  DECID wdc 836    = wceq 1373    e. wcel 2176   A.wral 2484    \ cdif 3163    u. cun 3164    i^i cin 3165    C_ wss 3166   (/)c0 3460   ifcif 3571   ~Pcpw 3616    |-> cmpt 4106    |` cres 4678   -->wf 5268   ` cfv 5272   1oc1o 6497   2oc2o 6498
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 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-13 2178  ax-14 2179  ax-ext 2187  ax-sep 4163  ax-nul 4171  ax-pow 4219  ax-pr 4254  ax-un 4481
This theorem depends on definitions:  df-bi 117  df-dc 837  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ral 2489  df-rex 2490  df-rab 2493  df-v 2774  df-sbc 2999  df-csb 3094  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3461  df-if 3572  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-br 4046  df-opab 4107  df-mpt 4108  df-tr 4144  df-id 4341  df-iord 4414  df-on 4416  df-suc 4419  df-xp 4682  df-rel 4683  df-cnv 4684  df-co 4685  df-dm 4686  df-rn 4687  df-res 4688  df-ima 4689  df-iota 5233  df-fun 5274  df-fn 5275  df-f 5276  df-fv 5280  df-1o 6504  df-2o 6505
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator