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

Theorem ismkvmap 7344
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 7343 . . 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 6684 . . . . . 6  |-  2o  e.  om
3 elmapg 6825 . . . . . 6  |-  ( ( 2o  e.  om  /\  A  e.  V )  ->  ( f  e.  ( 2o  ^m  A )  <-> 
f : A --> 2o ) )
42, 3mpan 424 . . . . 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 1870 . . 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 2513 . 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 1393    = wceq 1395    e. wcel 2200   A.wral 2508   E.wrex 2509   (/)c0 3492   omcom 4686   -->wf 5320   ` cfv 5324  (class class class)co 6013   1oc1o 6570   2oc2o 6571    ^m cmap 6812  Markovcmarkov 7341
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  ax-setind 4633
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  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-ne 2401  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-int 3927  df-br 4087  df-opab 4149  df-id 4388  df-suc 4466  df-iom 4687  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-fv 5332  df-ov 6016  df-oprab 6017  df-mpo 6018  df-1o 6577  df-2o 6578  df-map 6814  df-markov 7342
This theorem is referenced by:  ismkvnex  7345  fodjumkvlemres  7349  enmkvlem  7351  ismkvnnlem  16592
  Copyright terms: Public domain W3C validator