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

Theorem dfrex2fin 7093
Description: Relationship between universal and existential quantifiers over a finite set. Remark in Section 2.2.1 of [Pierik], p. 8. Although Pierik does not mention the decidability condition explicitly, it does say "only finitely many x to check" which means there must be some way of checking each value of x. (Contributed by Jim Kingdon, 11-Jul-2022.)
Assertion
Ref Expression
dfrex2fin  |-  ( ( A  e.  Fin  /\  A. x  e.  A DECID  ph )  ->  ( E. x  e.  A  ph  <->  -.  A. x  e.  A  -.  ph )
)
Distinct variable group:    x, A
Allowed substitution hint:    ph( x)

Proof of Theorem dfrex2fin
StepHypRef Expression
1 finexdc 7092 . 2  |-  ( ( A  e.  Fin  /\  A. x  e.  A DECID  ph )  -> DECID  E. x  e.  A  ph )
2 dfrex2dc 2523 . 2  |-  (DECID  E. x  e.  A  ph  ->  ( E. x  e.  A  ph  <->  -. 
A. x  e.  A  -.  ph ) )
31, 2syl 14 1  |-  ( ( A  e.  Fin  /\  A. x  e.  A DECID  ph )  ->  ( E. x  e.  A  ph  <->  -.  A. x  e.  A  -.  ph )
)
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105  DECID wdc 841    e. wcel 2202   A.wral 2510   E.wrex 2511   Fincfn 6909
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686
This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-if 3606  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-id 4390  df-iord 4463  df-on 4465  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-er 6702  df-en 6910  df-fin 6912
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator