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

Theorem rexbid 2437
 Description: Formula-building rule for restricted existential quantifier (deduction form). (Contributed by NM, 27-Jun-1998.)
Hypotheses
Ref Expression
ralbid.1 𝑥𝜑
ralbid.2 (𝜑 → (𝜓𝜒))
Assertion
Ref Expression
rexbid (𝜑 → (∃𝑥𝐴 𝜓 ↔ ∃𝑥𝐴 𝜒))

Proof of Theorem rexbid
StepHypRef Expression
1 ralbid.1 . 2 𝑥𝜑
2 ralbid.2 . . 3 (𝜑 → (𝜓𝜒))
32adantr 274 . 2 ((𝜑𝑥𝐴) → (𝜓𝜒))
41, 3rexbida 2433 1 (𝜑 → (∃𝑥𝐴 𝜓 ↔ ∃𝑥𝐴 𝜒))
 Colors of variables: wff set class Syntax hints:   → wi 4   ↔ wb 104  Ⅎwnf 1437   ∈ wcel 1481  ∃wrex 2418 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1424  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-4 1488  ax-ial 1515 This theorem depends on definitions:  df-bi 116  df-nf 1438  df-rex 2423 This theorem is referenced by:  rexbidv  2439  sbcrext  2989  mkvprop  7038  caucvgsrlemgt1  7625  bezout  11728
 Copyright terms: Public domain W3C validator