Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > reupick2 | GIF version |
Description: Restricted uniqueness "picks" a member of a subclass. (Contributed by Mario Carneiro, 15-Dec-2013.) (Proof shortened by Mario Carneiro, 19-Nov-2016.) |
Ref | Expression |
---|---|
reupick2 | ⊢ (((∀𝑥 ∈ 𝐴 (𝜓 → 𝜑) ∧ ∃𝑥 ∈ 𝐴 𝜓 ∧ ∃!𝑥 ∈ 𝐴 𝜑) ∧ 𝑥 ∈ 𝐴) → (𝜑 ↔ 𝜓)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ancr 304 | . . . . . 6 ⊢ ((𝜓 → 𝜑) → (𝜓 → (𝜑 ∧ 𝜓))) | |
2 | 1 | ralimi 2384 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 (𝜓 → 𝜑) → ∀𝑥 ∈ 𝐴 (𝜓 → (𝜑 ∧ 𝜓))) |
3 | rexim 2413 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 (𝜓 → (𝜑 ∧ 𝜓)) → (∃𝑥 ∈ 𝐴 𝜓 → ∃𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓))) | |
4 | 2, 3 | syl 14 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 (𝜓 → 𝜑) → (∃𝑥 ∈ 𝐴 𝜓 → ∃𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓))) |
5 | reupick3 3222 | . . . . . 6 ⊢ ((∃!𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) ∧ 𝑥 ∈ 𝐴) → (𝜑 → 𝜓)) | |
6 | 5 | 3exp 1103 | . . . . 5 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 → (∃𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) → (𝑥 ∈ 𝐴 → (𝜑 → 𝜓)))) |
7 | 6 | com12 27 | . . . 4 ⊢ (∃𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) → (∃!𝑥 ∈ 𝐴 𝜑 → (𝑥 ∈ 𝐴 → (𝜑 → 𝜓)))) |
8 | 4, 7 | syl6 29 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 (𝜓 → 𝜑) → (∃𝑥 ∈ 𝐴 𝜓 → (∃!𝑥 ∈ 𝐴 𝜑 → (𝑥 ∈ 𝐴 → (𝜑 → 𝜓))))) |
9 | 8 | 3imp1 1117 | . 2 ⊢ (((∀𝑥 ∈ 𝐴 (𝜓 → 𝜑) ∧ ∃𝑥 ∈ 𝐴 𝜓 ∧ ∃!𝑥 ∈ 𝐴 𝜑) ∧ 𝑥 ∈ 𝐴) → (𝜑 → 𝜓)) |
10 | rsp 2369 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 (𝜓 → 𝜑) → (𝑥 ∈ 𝐴 → (𝜓 → 𝜑))) | |
11 | 10 | 3ad2ant1 925 | . . 3 ⊢ ((∀𝑥 ∈ 𝐴 (𝜓 → 𝜑) ∧ ∃𝑥 ∈ 𝐴 𝜓 ∧ ∃!𝑥 ∈ 𝐴 𝜑) → (𝑥 ∈ 𝐴 → (𝜓 → 𝜑))) |
12 | 11 | imp 115 | . 2 ⊢ (((∀𝑥 ∈ 𝐴 (𝜓 → 𝜑) ∧ ∃𝑥 ∈ 𝐴 𝜓 ∧ ∃!𝑥 ∈ 𝐴 𝜑) ∧ 𝑥 ∈ 𝐴) → (𝜓 → 𝜑)) |
13 | 9, 12 | impbid 120 | 1 ⊢ (((∀𝑥 ∈ 𝐴 (𝜓 → 𝜑) ∧ ∃𝑥 ∈ 𝐴 𝜓 ∧ ∃!𝑥 ∈ 𝐴 𝜑) ∧ 𝑥 ∈ 𝐴) → (𝜑 ↔ 𝜓)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 97 ↔ wb 98 ∧ w3a 885 ∈ wcel 1393 ∀wral 2306 ∃wrex 2307 ∃!wreu 2308 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 |
This theorem depends on definitions: df-bi 110 df-3an 887 df-nf 1350 df-sb 1646 df-eu 1903 df-mo 1904 df-ral 2311 df-rex 2312 df-reu 2313 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |