| Intuitionistic Logic Explorer | 
      
      
      < Previous  
      Next >
      
       Nearby theorems  | 
  ||
| Mirrors > Home > ILE Home > Th. List > rspce | GIF version | ||
| Description: Restricted existential specialization, using implicit substitution. (Contributed by NM, 26-May-1998.) (Revised by Mario Carneiro, 11-Oct-2016.) | 
| Ref | Expression | 
|---|---|
| rspc.1 | ⊢ Ⅎ𝑥𝜓 | 
| rspc.2 | ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) | 
| Ref | Expression | 
|---|---|
| rspce | ⊢ ((𝐴 ∈ 𝐵 ∧ 𝜓) → ∃𝑥 ∈ 𝐵 𝜑) | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | nfcv 2339 | . . . 4 ⊢ Ⅎ𝑥𝐴 | |
| 2 | nfv 1542 | . . . . 5 ⊢ Ⅎ𝑥 𝐴 ∈ 𝐵 | |
| 3 | rspc.1 | . . . . 5 ⊢ Ⅎ𝑥𝜓 | |
| 4 | 2, 3 | nfan 1579 | . . . 4 ⊢ Ⅎ𝑥(𝐴 ∈ 𝐵 ∧ 𝜓) | 
| 5 | eleq1 2259 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ 𝐵 ↔ 𝐴 ∈ 𝐵)) | |
| 6 | rspc.2 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) | |
| 7 | 5, 6 | anbi12d 473 | . . . 4 ⊢ (𝑥 = 𝐴 → ((𝑥 ∈ 𝐵 ∧ 𝜑) ↔ (𝐴 ∈ 𝐵 ∧ 𝜓))) | 
| 8 | 1, 4, 7 | spcegf 2847 | . . 3 ⊢ (𝐴 ∈ 𝐵 → ((𝐴 ∈ 𝐵 ∧ 𝜓) → ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝜑))) | 
| 9 | 8 | anabsi5 579 | . 2 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝜓) → ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝜑)) | 
| 10 | df-rex 2481 | . 2 ⊢ (∃𝑥 ∈ 𝐵 𝜑 ↔ ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝜑)) | |
| 11 | 9, 10 | sylibr 134 | 1 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝜓) → ∃𝑥 ∈ 𝐵 𝜑) | 
| Colors of variables: wff set class | 
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1364 Ⅎwnf 1474 ∃wex 1506 ∈ wcel 2167 ∃wrex 2476 | 
| 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-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-ext 2178 | 
| This theorem depends on definitions: df-bi 117 df-tru 1367 df-nf 1475 df-sb 1777 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-rex 2481 df-v 2765 | 
| This theorem is referenced by: rspcev 2868 bezoutlemmain 12165 | 
| Copyright terms: Public domain | W3C validator |