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

Theorem fodjumkvlemres 7418
Description: Lemma for fodjumkv 7419. The final result with  P expressed as a local definition. (Contributed by Jim Kingdon, 25-Mar-2023.)
Hypotheses
Ref Expression
fodjumkv.o  |-  ( ph  ->  M  e. Markov )
fodjumkv.fo  |-  ( ph  ->  F : M -onto-> ( A B ) )
fodjumkv.p  |-  P  =  ( y  e.  M  |->  if ( E. z  e.  A  ( F `  y )  =  (inl
`  z ) ,  (/) ,  1o ) )
Assertion
Ref Expression
fodjumkvlemres  |-  ( ph  ->  ( A  =/=  (/)  ->  E. x  x  e.  A )
)
Distinct variable groups:    ph, y, z   
y, M, z    z, A    z, B    z, F    x, A, z    y, A   
y, F    y, P, z
Allowed substitution hints:    ph( x)    B( x, y)    P( x)    F( x)    M( x)

Proof of Theorem fodjumkvlemres
Dummy variables  v  f  w are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fodjumkv.fo . . . . . 6  |-  ( ph  ->  F : M -onto-> ( A B ) )
21adantr 276 . . . . 5  |-  ( (
ph  /\  A. w  e.  M  ( P `  w )  =  1o )  ->  F : M -onto-> ( A B ) )
3 fodjumkv.p . . . . 5  |-  P  =  ( y  e.  M  |->  if ( E. z  e.  A  ( F `  y )  =  (inl
`  z ) ,  (/) ,  1o ) )
4 simpr 110 . . . . 5  |-  ( (
ph  /\  A. w  e.  M  ( P `  w )  =  1o )  ->  A. w  e.  M  ( P `  w )  =  1o )
52, 3, 4fodju0 7406 . . . 4  |-  ( (
ph  /\  A. w  e.  M  ( P `  w )  =  1o )  ->  A  =  (/) )
65ex 115 . . 3  |-  ( ph  ->  ( A. w  e.  M  ( P `  w )  =  1o 
->  A  =  (/) ) )
76necon3ad 2445 . 2  |-  ( ph  ->  ( A  =/=  (/)  ->  -.  A. w  e.  M  ( P `  w )  =  1o ) )
8 fveq1 5647 . . . . . . 7  |-  ( f  =  P  ->  (
f `  w )  =  ( P `  w ) )
98eqeq1d 2240 . . . . . 6  |-  ( f  =  P  ->  (
( f `  w
)  =  1o  <->  ( P `  w )  =  1o ) )
109ralbidv 2533 . . . . 5  |-  ( f  =  P  ->  ( A. w  e.  M  ( f `  w
)  =  1o  <->  A. w  e.  M  ( P `  w )  =  1o ) )
1110notbid 673 . . . 4  |-  ( f  =  P  ->  ( -.  A. w  e.  M  ( f `  w
)  =  1o  <->  -.  A. w  e.  M  ( P `  w )  =  1o ) )
128eqeq1d 2240 . . . . 5  |-  ( f  =  P  ->  (
( f `  w
)  =  (/)  <->  ( P `  w )  =  (/) ) )
1312rexbidv 2534 . . . 4  |-  ( f  =  P  ->  ( E. w  e.  M  ( f `  w
)  =  (/)  <->  E. w  e.  M  ( P `  w )  =  (/) ) )
1411, 13imbi12d 234 . . 3  |-  ( f  =  P  ->  (
( -.  A. w  e.  M  ( f `  w )  =  1o 
->  E. w  e.  M  ( f `  w
)  =  (/) )  <->  ( -.  A. w  e.  M  ( P `  w )  =  1o  ->  E. w  e.  M  ( P `  w )  =  (/) ) ) )
15 fodjumkv.o . . . 4  |-  ( ph  ->  M  e. Markov )
16 ismkvmap 7413 . . . . 5  |-  ( M  e. Markov  ->  ( M  e. Markov  <->  A. f  e.  ( 2o 
^m  M ) ( -.  A. w  e.  M  ( f `  w )  =  1o 
->  E. w  e.  M  ( f `  w
)  =  (/) ) ) )
1716ibi 176 . . . 4  |-  ( M  e. Markov  ->  A. f  e.  ( 2o  ^m  M ) ( -.  A. w  e.  M  ( f `  w )  =  1o 
->  E. w  e.  M  ( f `  w
)  =  (/) ) )
1815, 17syl 14 . . 3  |-  ( ph  ->  A. f  e.  ( 2o  ^m  M ) ( -.  A. w  e.  M  ( f `  w )  =  1o 
->  E. w  e.  M  ( f `  w
)  =  (/) ) )
191, 3, 15fodjuf 7404 . . 3  |-  ( ph  ->  P  e.  ( 2o 
^m  M ) )
2014, 18, 19rspcdva 2916 . 2  |-  ( ph  ->  ( -.  A. w  e.  M  ( P `  w )  =  1o 
->  E. w  e.  M  ( P `  w )  =  (/) ) )
211adantr 276 . . . 4  |-  ( (
ph  /\  E. w  e.  M  ( P `  w )  =  (/) )  ->  F : M -onto->
( A B )
)
22 simpr 110 . . . . 5  |-  ( (
ph  /\  E. w  e.  M  ( P `  w )  =  (/) )  ->  E. w  e.  M  ( P `  w )  =  (/) )
23 fveqeq2 5657 . . . . . 6  |-  ( w  =  v  ->  (
( P `  w
)  =  (/)  <->  ( P `  v )  =  (/) ) )
2423cbvrexv 2769 . . . . 5  |-  ( E. w  e.  M  ( P `  w )  =  (/)  <->  E. v  e.  M  ( P `  v )  =  (/) )
2522, 24sylib 122 . . . 4  |-  ( (
ph  /\  E. w  e.  M  ( P `  w )  =  (/) )  ->  E. v  e.  M  ( P `  v )  =  (/) )
2621, 3, 25fodjum 7405 . . 3  |-  ( (
ph  /\  E. w  e.  M  ( P `  w )  =  (/) )  ->  E. x  x  e.  A )
2726ex 115 . 2  |-  ( ph  ->  ( E. w  e.  M  ( P `  w )  =  (/)  ->  E. x  x  e.  A ) )
287, 20, 273syld 57 1  |-  ( ph  ->  ( A  =/=  (/)  ->  E. x  x  e.  A )
)
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    = wceq 1398   E.wex 1541    e. wcel 2202    =/= wne 2403   A.wral 2511   E.wrex 2512   (/)c0 3496   ifcif 3607    |-> cmpt 4155   -onto->wfo 5331   ` cfv 5333  (class class class)co 6028   1oc1o 6618   2oc2o 6619    ^m cmap 6860   ⊔ cdju 7296  inlcinl 7304  Markovcmarkov 7410
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-if 3608  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-id 4396  df-iord 4469  df-on 4471  df-suc 4474  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-1o 6625  df-2o 6626  df-map 6862  df-dju 7297  df-inl 7306  df-inr 7307  df-markov 7411
This theorem is referenced by:  fodjumkv  7419
  Copyright terms: Public domain W3C validator