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

Theorem bj-charfunr 13692
Description: If a class  A has a "weak" characteristic function on a class 
X, then negated membership in 
A is decidable (in other words, membership in  A is testable) in  X.

The hypothesis imposes that 
X be a set. As usual, it could be formulated as  |-  ( ph  ->  ( F : X --> om  /\  ... ) ) to deal with general classes, but that extra generality would not make the theorem much more useful.

The theorem would still hold if the codomain of  f were any class with testable equality to the point where  ( X  \  A ) is sent. (Contributed by BJ, 6-Aug-2024.)

Hypothesis
Ref Expression
bj-charfunr.1  |-  ( ph  ->  E. f  e.  ( om  ^m  X ) ( A. x  e.  ( X  i^i  A
) ( f `  x )  =/=  (/)  /\  A. x  e.  ( X  \  A ) ( f `
 x )  =  (/) ) )
Assertion
Ref Expression
bj-charfunr  |-  ( ph  ->  A. x  e.  X DECID  -.  x  e.  A )
Distinct variable groups:    A, f    f, X    ph, f, x
Allowed substitution hints:    A( x)    X( x)

Proof of Theorem bj-charfunr
StepHypRef Expression
1 bj-charfunr.1 . . . . 5  |-  ( ph  ->  E. f  e.  ( om  ^m  X ) ( A. x  e.  ( X  i^i  A
) ( f `  x )  =/=  (/)  /\  A. x  e.  ( X  \  A ) ( f `
 x )  =  (/) ) )
2 elmapi 6636 . . . . . . . . . 10  |-  ( f  e.  ( om  ^m  X )  ->  f : X --> om )
3 ffvelrn 5618 . . . . . . . . . . 11  |-  ( ( f : X --> om  /\  x  e.  X )  ->  ( f `  x
)  e.  om )
43ex 114 . . . . . . . . . 10  |-  ( f : X --> om  ->  ( x  e.  X  -> 
( f `  x
)  e.  om )
)
52, 4syl 14 . . . . . . . . 9  |-  ( f  e.  ( om  ^m  X )  ->  (
x  e.  X  -> 
( f `  x
)  e.  om )
)
6 0elnn 4596 . . . . . . . . . 10  |-  ( ( f `  x )  e.  om  ->  (
( f `  x
)  =  (/)  \/  (/)  e.  ( f `  x ) ) )
7 nn0eln0 4597 . . . . . . . . . . 11  |-  ( ( f `  x )  e.  om  ->  ( (/) 
e.  ( f `  x )  <->  ( f `  x )  =/=  (/) ) )
87orbi2d 780 . . . . . . . . . 10  |-  ( ( f `  x )  e.  om  ->  (
( ( f `  x )  =  (/)  \/  (/)  e.  ( f `  x ) )  <->  ( (
f `  x )  =  (/)  \/  ( f `
 x )  =/=  (/) ) ) )
96, 8mpbid 146 . . . . . . . . 9  |-  ( ( f `  x )  e.  om  ->  (
( f `  x
)  =  (/)  \/  (
f `  x )  =/=  (/) ) )
105, 9syl6 33 . . . . . . . 8  |-  ( f  e.  ( om  ^m  X )  ->  (
x  e.  X  -> 
( ( f `  x )  =  (/)  \/  ( f `  x
)  =/=  (/) ) ) )
1110adantr 274 . . . . . . 7  |-  ( ( f  e.  ( om 
^m  X )  /\  ( A. x  e.  ( X  i^i  A ) ( f `  x
)  =/=  (/)  /\  A. x  e.  ( X  \  A ) ( f `
 x )  =  (/) ) )  ->  (
x  e.  X  -> 
( ( f `  x )  =  (/)  \/  ( f `  x
)  =/=  (/) ) ) )
12 elin 3305 . . . . . . . . . . . . . . 15  |-  ( x  e.  ( X  i^i  A )  <->  ( x  e.  X  /\  x  e.  A ) )
13 rsp 2513 . . . . . . . . . . . . . . 15  |-  ( A. x  e.  ( X  i^i  A ) ( f `
 x )  =/=  (/)  ->  ( x  e.  ( X  i^i  A
)  ->  ( f `  x )  =/=  (/) ) )
1412, 13syl5bir 152 . . . . . . . . . . . . . 14  |-  ( A. x  e.  ( X  i^i  A ) ( f `
 x )  =/=  (/)  ->  ( ( x  e.  X  /\  x  e.  A )  ->  (
f `  x )  =/=  (/) ) )
1514expd 256 . . . . . . . . . . . . 13  |-  ( A. x  e.  ( X  i^i  A ) ( f `
 x )  =/=  (/)  ->  ( x  e.  X  ->  ( x  e.  A  ->  ( f `
 x )  =/=  (/) ) ) )
1615adantr 274 . . . . . . . . . . . 12  |-  ( ( A. x  e.  ( X  i^i  A ) ( f `  x
)  =/=  (/)  /\  A. x  e.  ( X  \  A ) ( f `
 x )  =  (/) )  ->  ( x  e.  X  ->  (
x  e.  A  -> 
( f `  x
)  =/=  (/) ) ) )
1716imp 123 . . . . . . . . . . 11  |-  ( ( ( A. x  e.  ( X  i^i  A
) ( f `  x )  =/=  (/)  /\  A. x  e.  ( X  \  A ) ( f `
 x )  =  (/) )  /\  x  e.  X )  ->  (
x  e.  A  -> 
( f `  x
)  =/=  (/) ) )
1817necon2bd 2394 . . . . . . . . . 10  |-  ( ( ( A. x  e.  ( X  i^i  A
) ( f `  x )  =/=  (/)  /\  A. x  e.  ( X  \  A ) ( f `
 x )  =  (/) )  /\  x  e.  X )  ->  (
( f `  x
)  =  (/)  ->  -.  x  e.  A )
)
19 eldif 3125 . . . . . . . . . . . . . . 15  |-  ( x  e.  ( X  \  A )  <->  ( x  e.  X  /\  -.  x  e.  A ) )
20 rsp 2513 . . . . . . . . . . . . . . 15  |-  ( A. x  e.  ( X  \  A ) ( f `
 x )  =  (/)  ->  ( x  e.  ( X  \  A
)  ->  ( f `  x )  =  (/) ) )
2119, 20syl5bir 152 . . . . . . . . . . . . . 14  |-  ( A. x  e.  ( X  \  A ) ( f `
 x )  =  (/)  ->  ( ( x  e.  X  /\  -.  x  e.  A )  ->  ( f `  x
)  =  (/) ) )
2221expd 256 . . . . . . . . . . . . 13  |-  ( A. x  e.  ( X  \  A ) ( f `
 x )  =  (/)  ->  ( x  e.  X  ->  ( -.  x  e.  A  ->  ( f `  x )  =  (/) ) ) )
2322adantl 275 . . . . . . . . . . . 12  |-  ( ( A. x  e.  ( X  i^i  A ) ( f `  x
)  =/=  (/)  /\  A. x  e.  ( X  \  A ) ( f `
 x )  =  (/) )  ->  ( x  e.  X  ->  ( -.  x  e.  A  ->  ( f `  x
)  =  (/) ) ) )
2423imp 123 . . . . . . . . . . 11  |-  ( ( ( A. x  e.  ( X  i^i  A
) ( f `  x )  =/=  (/)  /\  A. x  e.  ( X  \  A ) ( f `
 x )  =  (/) )  /\  x  e.  X )  ->  ( -.  x  e.  A  ->  ( f `  x
)  =  (/) ) )
2524necon3ad 2378 . . . . . . . . . 10  |-  ( ( ( A. x  e.  ( X  i^i  A
) ( f `  x )  =/=  (/)  /\  A. x  e.  ( X  \  A ) ( f `
 x )  =  (/) )  /\  x  e.  X )  ->  (
( f `  x
)  =/=  (/)  ->  -.  -.  x  e.  A
) )
2618, 25orim12d 776 . . . . . . . . 9  |-  ( ( ( A. x  e.  ( X  i^i  A
) ( f `  x )  =/=  (/)  /\  A. x  e.  ( X  \  A ) ( f `
 x )  =  (/) )  /\  x  e.  X )  ->  (
( ( f `  x )  =  (/)  \/  ( f `  x
)  =/=  (/) )  -> 
( -.  x  e.  A  \/  -.  -.  x  e.  A )
) )
2726ex 114 . . . . . . . 8  |-  ( ( A. x  e.  ( X  i^i  A ) ( f `  x
)  =/=  (/)  /\  A. x  e.  ( X  \  A ) ( f `
 x )  =  (/) )  ->  ( x  e.  X  ->  (
( ( f `  x )  =  (/)  \/  ( f `  x
)  =/=  (/) )  -> 
( -.  x  e.  A  \/  -.  -.  x  e.  A )
) ) )
2827adantl 275 . . . . . . 7  |-  ( ( f  e.  ( om 
^m  X )  /\  ( A. x  e.  ( X  i^i  A ) ( f `  x
)  =/=  (/)  /\  A. x  e.  ( X  \  A ) ( f `
 x )  =  (/) ) )  ->  (
x  e.  X  -> 
( ( ( f `
 x )  =  (/)  \/  ( f `  x )  =/=  (/) )  -> 
( -.  x  e.  A  \/  -.  -.  x  e.  A )
) ) )
2911, 28mpdd 41 . . . . . 6  |-  ( ( f  e.  ( om 
^m  X )  /\  ( A. x  e.  ( X  i^i  A ) ( f `  x
)  =/=  (/)  /\  A. x  e.  ( X  \  A ) ( f `
 x )  =  (/) ) )  ->  (
x  e.  X  -> 
( -.  x  e.  A  \/  -.  -.  x  e.  A )
) )
3029adantl 275 . . . . 5  |-  ( (
ph  /\  ( f  e.  ( om  ^m  X
)  /\  ( A. x  e.  ( X  i^i  A ) ( f `
 x )  =/=  (/)  /\  A. x  e.  ( X  \  A
) ( f `  x )  =  (/) ) ) )  -> 
( x  e.  X  ->  ( -.  x  e.  A  \/  -.  -.  x  e.  A )
) )
311, 30rexlimddv 2588 . . . 4  |-  ( ph  ->  ( x  e.  X  ->  ( -.  x  e.  A  \/  -.  -.  x  e.  A )
) )
3231imp 123 . . 3  |-  ( (
ph  /\  x  e.  X )  ->  ( -.  x  e.  A  \/  -.  -.  x  e.  A ) )
33 df-dc 825 . . 3  |-  (DECID  -.  x  e.  A  <->  ( -.  x  e.  A  \/  -.  -.  x  e.  A
) )
3432, 33sylibr 133 . 2  |-  ( (
ph  /\  x  e.  X )  -> DECID  -.  x  e.  A
)
3534ralrimiva 2539 1  |-  ( ph  ->  A. x  e.  X DECID  -.  x  e.  A )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 103    \/ wo 698  DECID wdc 824    = wceq 1343    e. wcel 2136    =/= wne 2336   A.wral 2444   E.wrex 2445    \ cdif 3113    i^i cin 3115   (/)c0 3409   omcom 4567   -->wf 5184   ` cfv 5188  (class class class)co 5842    ^m cmap 6614
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 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-nul 4108  ax-pow 4153  ax-pr 4187  ax-un 4411  ax-setind 4514  ax-iinf 4565
This theorem depends on definitions:  df-bi 116  df-dc 825  df-3an 970  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ne 2337  df-ral 2449  df-rex 2450  df-v 2728  df-sbc 2952  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-nul 3410  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-int 3825  df-br 3983  df-opab 4044  df-id 4271  df-suc 4349  df-iom 4568  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-iota 5153  df-fun 5190  df-fn 5191  df-f 5192  df-fv 5196  df-ov 5845  df-oprab 5846  df-mpo 5847  df-map 6616
This theorem is referenced by:  bj-charfunbi  13693
  Copyright terms: Public domain W3C validator