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

Theorem ismkvmap 7229
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 7228 . . 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 6588 . . . . . 6  |-  2o  e.  om
3 elmapg 6729 . . . . . 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 1838 . . 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 2480 . 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 1362    = wceq 1364    e. wcel 2167   A.wral 2475   E.wrex 2476   (/)c0 3451   omcom 4627   -->wf 5255   ` cfv 5259  (class class class)co 5925   1oc1o 6476   2oc2o 6477    ^m cmap 6716  Markovcmarkov 7226
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-nul 4160  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-ral 2480  df-rex 2481  df-v 2765  df-sbc 2990  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-br 4035  df-opab 4096  df-id 4329  df-suc 4407  df-iom 4628  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-fv 5267  df-ov 5928  df-oprab 5929  df-mpo 5930  df-1o 6483  df-2o 6484  df-map 6718  df-markov 7227
This theorem is referenced by:  ismkvnex  7230  fodjumkvlemres  7234  enmkvlem  7236  ismkvnnlem  15783
  Copyright terms: Public domain W3C validator