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

Theorem fodjuomnilemres 7488
Description: Lemma for fodjuomni 7489. The final result with  P expressed as a local definition. (Contributed by Jim Kingdon, 29-Jul-2022.)
Hypotheses
Ref Expression
fodjuomni.o  |-  ( ph  ->  O  e. Omni )
fodjuomni.fo  |-  ( ph  ->  F : O -onto-> ( A B ) )
fodjuomni.p  |-  P  =  ( y  e.  O  |->  if ( E. z  e.  A  ( F `  y )  =  (inl
`  z ) ,  (/) ,  1o ) )
Assertion
Ref Expression
fodjuomnilemres  |-  ( ph  ->  ( E. x  x  e.  A  \/  A  =  (/) ) )
Distinct variable groups:    ph, y, z   
y, O, 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)    O( x)

Proof of Theorem fodjuomnilemres
Dummy variables  v  f  w are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fveq1 5694 . . . . . 6  |-  ( f  =  P  ->  (
f `  w )  =  ( P `  w ) )
21eqeq1d 2247 . . . . 5  |-  ( f  =  P  ->  (
( f `  w
)  =  (/)  <->  ( P `  w )  =  (/) ) )
32rexbidv 2551 . . . 4  |-  ( f  =  P  ->  ( E. w  e.  O  ( f `  w
)  =  (/)  <->  E. w  e.  O  ( P `  w )  =  (/) ) )
41eqeq1d 2247 . . . . 5  |-  ( f  =  P  ->  (
( f `  w
)  =  1o  <->  ( P `  w )  =  1o ) )
54ralbidv 2550 . . . 4  |-  ( f  =  P  ->  ( A. w  e.  O  ( f `  w
)  =  1o  <->  A. w  e.  O  ( P `  w )  =  1o ) )
63, 5orbi12d 805 . . 3  |-  ( f  =  P  ->  (
( E. w  e.  O  ( f `  w )  =  (/)  \/ 
A. w  e.  O  ( f `  w
)  =  1o )  <-> 
( E. w  e.  O  ( P `  w )  =  (/)  \/ 
A. w  e.  O  ( P `  w )  =  1o ) ) )
7 fodjuomni.o . . . 4  |-  ( ph  ->  O  e. Omni )
8 isomnimap 7477 . . . . 5  |-  ( O  e. Omni  ->  ( O  e. Omni  <->  A. f  e.  ( 2o 
^m  O ) ( E. w  e.  O  ( f `  w
)  =  (/)  \/  A. w  e.  O  (
f `  w )  =  1o ) ) )
97, 8syl 14 . . . 4  |-  ( ph  ->  ( O  e. Omni  <->  A. f  e.  ( 2o  ^m  O
) ( E. w  e.  O  ( f `  w )  =  (/)  \/ 
A. w  e.  O  ( f `  w
)  =  1o ) ) )
107, 9mpbid 147 . . 3  |-  ( ph  ->  A. f  e.  ( 2o  ^m  O ) ( E. w  e.  O  ( f `  w )  =  (/)  \/ 
A. w  e.  O  ( f `  w
)  =  1o ) )
11 fodjuomni.fo . . . 4  |-  ( ph  ->  F : O -onto-> ( A B ) )
12 fodjuomni.p . . . 4  |-  P  =  ( y  e.  O  |->  if ( E. z  e.  A  ( F `  y )  =  (inl
`  z ) ,  (/) ,  1o ) )
1311, 12, 7fodjuf 7485 . . 3  |-  ( ph  ->  P  e.  ( 2o 
^m  O ) )
146, 10, 13rspcdva 2934 . 2  |-  ( ph  ->  ( E. w  e.  O  ( P `  w )  =  (/)  \/ 
A. w  e.  O  ( P `  w )  =  1o ) )
1511adantr 276 . . . . 5  |-  ( (
ph  /\  E. w  e.  O  ( P `  w )  =  (/) )  ->  F : O -onto->
( A B )
)
16 simpr 110 . . . . . 6  |-  ( (
ph  /\  E. w  e.  O  ( P `  w )  =  (/) )  ->  E. w  e.  O  ( P `  w )  =  (/) )
17 fveqeq2 5704 . . . . . . 7  |-  ( w  =  v  ->  (
( P `  w
)  =  (/)  <->  ( P `  v )  =  (/) ) )
1817cbvrexv 2787 . . . . . 6  |-  ( E. w  e.  O  ( P `  w )  =  (/)  <->  E. v  e.  O  ( P `  v )  =  (/) )
1916, 18sylib 122 . . . . 5  |-  ( (
ph  /\  E. w  e.  O  ( P `  w )  =  (/) )  ->  E. v  e.  O  ( P `  v )  =  (/) )
2015, 12, 19fodjum 7486 . . . 4  |-  ( (
ph  /\  E. w  e.  O  ( P `  w )  =  (/) )  ->  E. x  x  e.  A )
2120ex 115 . . 3  |-  ( ph  ->  ( E. w  e.  O  ( P `  w )  =  (/)  ->  E. x  x  e.  A ) )
2211adantr 276 . . . . 5  |-  ( (
ph  /\  A. w  e.  O  ( P `  w )  =  1o )  ->  F : O -onto-> ( A B ) )
23 simpr 110 . . . . 5  |-  ( (
ph  /\  A. w  e.  O  ( P `  w )  =  1o )  ->  A. w  e.  O  ( P `  w )  =  1o )
2422, 12, 23fodju0 7487 . . . 4  |-  ( (
ph  /\  A. w  e.  O  ( P `  w )  =  1o )  ->  A  =  (/) )
2524ex 115 . . 3  |-  ( ph  ->  ( A. w  e.  O  ( P `  w )  =  1o 
->  A  =  (/) ) )
2621, 25orim12d 798 . 2  |-  ( ph  ->  ( ( E. w  e.  O  ( P `  w )  =  (/)  \/ 
A. w  e.  O  ( P `  w )  =  1o )  -> 
( E. x  x  e.  A  \/  A  =  (/) ) ) )
2714, 26mpd 13 1  |-  ( ph  ->  ( E. x  x  e.  A  \/  A  =  (/) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 720    = wceq 1402   E.wex 1545    e. wcel 2209   A.wral 2528   E.wrex 2529   (/)c0 3520   ifcif 3638    |-> cmpt 4192   -onto->wfo 5375   ` cfv 5377  (class class class)co 6085   1oc1o 6680   2oc2o 6681    ^m cmap 6922   ⊔ cdju 7377  inlcinl 7385  Omnicomni 7474
This proof depends on 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 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684
This proof depends on definitions:  df-bi 117  df-dc 847  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-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-1o 6687  df-2o 6688  df-map 6924  df-dju 7378  df-inl 7387  df-inr 7388  df-omni 7475
This theorem is used by:  fodjuomni  7489
  Copyright terms: Public domain W3C validator