| Intuitionistic Logic Explorer | 
      
      
      < Previous  
      Next >
      
       Nearby theorems  | 
  ||
| Mirrors > Home > ILE Home > Th. List > reupick3 | GIF version | ||
| Description: Restricted uniqueness "picks" a member of a subclass. (Contributed by Mario Carneiro, 19-Nov-2016.) | 
| Ref | Expression | 
|---|---|
| reupick3 | ⊢ ((∃!𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) ∧ 𝑥 ∈ 𝐴) → (𝜑 → 𝜓)) | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | df-reu 2482 | . . . 4 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
| 2 | df-rex 2481 | . . . . 5 ⊢ (∃𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ (𝜑 ∧ 𝜓))) | |
| 3 | anass 401 | . . . . . 6 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ 𝜓) ↔ (𝑥 ∈ 𝐴 ∧ (𝜑 ∧ 𝜓))) | |
| 4 | 3 | exbii 1619 | . . . . 5 ⊢ (∃𝑥((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ 𝜓) ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ (𝜑 ∧ 𝜓))) | 
| 5 | 2, 4 | bitr4i 187 | . . . 4 ⊢ (∃𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ ∃𝑥((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ 𝜓)) | 
| 6 | eupick 2124 | . . . 4 ⊢ ((∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ ∃𝑥((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ 𝜓)) → ((𝑥 ∈ 𝐴 ∧ 𝜑) → 𝜓)) | |
| 7 | 1, 5, 6 | syl2anb 291 | . . 3 ⊢ ((∃!𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓)) → ((𝑥 ∈ 𝐴 ∧ 𝜑) → 𝜓)) | 
| 8 | 7 | expd 258 | . 2 ⊢ ((∃!𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓)) → (𝑥 ∈ 𝐴 → (𝜑 → 𝜓))) | 
| 9 | 8 | 3impia 1202 | 1 ⊢ ((∃!𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) ∧ 𝑥 ∈ 𝐴) → (𝜑 → 𝜓)) | 
| Colors of variables: wff set class | 
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 980 ∃wex 1506 ∃!weu 2045 ∈ wcel 2167 ∃wrex 2476 ∃!wreu 2477 | 
| 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 | 
| This theorem depends on definitions: df-bi 117 df-3an 982 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-rex 2481 df-reu 2482 | 
| This theorem is referenced by: reupick2 3449 | 
| Copyright terms: Public domain | W3C validator |