![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > reusv3i | Structured version Visualization version GIF version |
Description: Two ways of expressing existential uniqueness via an indirect equality. (Contributed by NM, 23-Dec-2012.) |
Ref | Expression |
---|---|
reusv3.1 | ⊢ (𝑦 = 𝑧 → (𝜑 ↔ 𝜓)) |
reusv3.2 | ⊢ (𝑦 = 𝑧 → 𝐶 = 𝐷) |
Ref | Expression |
---|---|
reusv3i | ⊢ (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶) → ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | reusv3.1 | . . . . . 6 ⊢ (𝑦 = 𝑧 → (𝜑 ↔ 𝜓)) | |
2 | reusv3.2 | . . . . . . 7 ⊢ (𝑦 = 𝑧 → 𝐶 = 𝐷) | |
3 | 2 | eqeq2d 2770 | . . . . . 6 ⊢ (𝑦 = 𝑧 → (𝑥 = 𝐶 ↔ 𝑥 = 𝐷)) |
4 | 1, 3 | imbi12d 333 | . . . . 5 ⊢ (𝑦 = 𝑧 → ((𝜑 → 𝑥 = 𝐶) ↔ (𝜓 → 𝑥 = 𝐷))) |
5 | 4 | cbvralv 3310 | . . . 4 ⊢ (∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶) ↔ ∀𝑧 ∈ 𝐵 (𝜓 → 𝑥 = 𝐷)) |
6 | 5 | biimpi 206 | . . 3 ⊢ (∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶) → ∀𝑧 ∈ 𝐵 (𝜓 → 𝑥 = 𝐷)) |
7 | raaanv 4227 | . . . 4 ⊢ (∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 → 𝑥 = 𝐶) ∧ (𝜓 → 𝑥 = 𝐷)) ↔ (∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶) ∧ ∀𝑧 ∈ 𝐵 (𝜓 → 𝑥 = 𝐷))) | |
8 | prth 596 | . . . . . 6 ⊢ (((𝜑 → 𝑥 = 𝐶) ∧ (𝜓 → 𝑥 = 𝐷)) → ((𝜑 ∧ 𝜓) → (𝑥 = 𝐶 ∧ 𝑥 = 𝐷))) | |
9 | eqtr2 2780 | . . . . . 6 ⊢ ((𝑥 = 𝐶 ∧ 𝑥 = 𝐷) → 𝐶 = 𝐷) | |
10 | 8, 9 | syl6 35 | . . . . 5 ⊢ (((𝜑 → 𝑥 = 𝐶) ∧ (𝜓 → 𝑥 = 𝐷)) → ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷)) |
11 | 10 | 2ralimi 3091 | . . . 4 ⊢ (∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 → 𝑥 = 𝐶) ∧ (𝜓 → 𝑥 = 𝐷)) → ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷)) |
12 | 7, 11 | sylbir 225 | . . 3 ⊢ ((∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶) ∧ ∀𝑧 ∈ 𝐵 (𝜓 → 𝑥 = 𝐷)) → ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷)) |
13 | 6, 12 | mpdan 705 | . 2 ⊢ (∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶) → ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷)) |
14 | 13 | rexlimivw 3167 | 1 ⊢ (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶) → ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝜑 ∧ 𝜓) → 𝐶 = 𝐷)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∧ wa 383 = wceq 1632 ∀wral 3050 ∃wrex 3051 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1871 ax-4 1886 ax-5 1988 ax-6 2054 ax-7 2090 ax-9 2148 ax-10 2168 ax-11 2183 ax-12 2196 ax-13 2391 ax-ext 2740 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-tru 1635 df-ex 1854 df-nf 1859 df-sb 2047 df-clab 2747 df-cleq 2753 df-clel 2756 df-nfc 2891 df-ne 2933 df-ral 3055 df-rex 3056 df-v 3342 df-dif 3718 df-nul 4059 |
This theorem is referenced by: reusv3 5025 |
Copyright terms: Public domain | W3C validator |