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

Theorem ismkvmap 7484
Description: The predicate of being Markov stated in terms of set exponentiation. (Contributed by Jim Kingdon, 18-Mar-2023.)
Assertion
Ref Expression
ismkvmap  |-  ( A  e.  V  ->  ( A  e. Markov  <->  A. f  e.  ( 2o  ^m  A ) ( -.  A. x  e.  A  ( f `  x )  =  1o 
->  E. x  e.  A  ( f `  x
)  =  (/) ) ) )
Distinct variable groups:    A, f, x   
f, V
Allowed substitution hint:    V( x)

Proof of Theorem ismkvmap
StepHypRef Expression
1 ismkv 7483 . . 3  |-  ( A  e.  V  ->  ( A  e. Markov  <->  A. f ( f : A --> 2o  ->  ( -.  A. x  e.  A  ( f `  x )  =  1o 
->  E. x  e.  A  ( f `  x
)  =  (/) ) ) ) )
2 2onn 6784 . . . . . 6  |-  2o  e.  om
3 elmapg 6925 . . . . . 6  |-  ( ( 2o  e.  om  /\  A  e.  V )  ->  ( f  e.  ( 2o  ^m  A )  <-> 
f : A --> 2o ) )
42, 3mpan 428 . . . . 5  |-  ( A  e.  V  ->  (
f  e.  ( 2o 
^m  A )  <->  f : A
--> 2o ) )
54imbi1d 231 . . . 4  |-  ( A  e.  V  ->  (
( f  e.  ( 2o  ^m  A )  ->  ( -.  A. x  e.  A  (
f `  x )  =  1o  ->  E. x  e.  A  ( f `  x )  =  (/) ) )  <->  ( f : A --> 2o  ->  ( -.  A. x  e.  A  ( f `  x
)  =  1o  ->  E. x  e.  A  ( f `  x )  =  (/) ) ) ) )
65albidv 1877 . . 3  |-  ( A  e.  V  ->  ( A. f ( f  e.  ( 2o  ^m  A
)  ->  ( -.  A. x  e.  A  ( f `  x )  =  1o  ->  E. x  e.  A  ( f `  x )  =  (/) ) )  <->  A. f
( f : A --> 2o  ->  ( -.  A. x  e.  A  (
f `  x )  =  1o  ->  E. x  e.  A  ( f `  x )  =  (/) ) ) ) )
71, 6bitr4d 191 . 2  |-  ( A  e.  V  ->  ( A  e. Markov  <->  A. f ( f  e.  ( 2o  ^m  A )  ->  ( -.  A. x  e.  A  ( f `  x
)  =  1o  ->  E. x  e.  A  ( f `  x )  =  (/) ) ) ) )
8 df-ral 2533 . 2  |-  ( A. f  e.  ( 2o  ^m  A ) ( -. 
A. x  e.  A  ( f `  x
)  =  1o  ->  E. x  e.  A  ( f `  x )  =  (/) )  <->  A. f
( f  e.  ( 2o  ^m  A )  ->  ( -.  A. x  e.  A  (
f `  x )  =  1o  ->  E. x  e.  A  ( f `  x )  =  (/) ) ) )
97, 8bitr4di 198 1  |-  ( A  e.  V  ->  ( A  e. Markov  <->  A. f  e.  ( 2o  ^m  A ) ( -.  A. x  e.  A  ( f `  x )  =  1o 
->  E. x  e.  A  ( f `  x
)  =  (/) ) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 105   A.wal 1400    = wceq 1402    e. wcel 2209   A.wral 2528   E.wrex 2529   (/)c0 3520   omcom 4732   -->wf 5368   ` cfv 5372  (class class class)co 6075   1oc1o 6670   2oc2o 6671    ^m cmap 6912  Markovcmarkov 7481
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 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 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  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-ne 2421  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 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-br 4126  df-opab 4188  df-id 4433  df-suc 4511  df-iom 4733  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-fv 5380  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1o 6677  df-2o 6678  df-map 6914  df-markov 7482
This theorem is referenced by:  ismkvnex  7485  fodjumkvlemres  7489  enmkvlem  7491  ismkvnnlem  17007
  Copyright terms: Public domain W3C validator