Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > eqreu | Structured version Visualization version GIF version |
Description: A condition which implies existential uniqueness. (Contributed by Mario Carneiro, 2-Oct-2015.) |
Ref | Expression |
---|---|
eqreu.1 | ⊢ (𝑥 = 𝐵 → (𝜑 ↔ 𝜓)) |
Ref | Expression |
---|---|
eqreu | ⊢ ((𝐵 ∈ 𝐴 ∧ 𝜓 ∧ ∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝐵)) → ∃!𝑥 ∈ 𝐴 𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ralbiim 3171 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 ↔ 𝑥 = 𝐵) ↔ (∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝐵) ∧ ∀𝑥 ∈ 𝐴 (𝑥 = 𝐵 → 𝜑))) | |
2 | eqreu.1 | . . . . . . 7 ⊢ (𝑥 = 𝐵 → (𝜑 ↔ 𝜓)) | |
3 | 2 | ceqsralv 3531 | . . . . . 6 ⊢ (𝐵 ∈ 𝐴 → (∀𝑥 ∈ 𝐴 (𝑥 = 𝐵 → 𝜑) ↔ 𝜓)) |
4 | 3 | anbi2d 628 | . . . . 5 ⊢ (𝐵 ∈ 𝐴 → ((∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝐵) ∧ ∀𝑥 ∈ 𝐴 (𝑥 = 𝐵 → 𝜑)) ↔ (∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝐵) ∧ 𝜓))) |
5 | 1, 4 | syl5bb 284 | . . . 4 ⊢ (𝐵 ∈ 𝐴 → (∀𝑥 ∈ 𝐴 (𝜑 ↔ 𝑥 = 𝐵) ↔ (∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝐵) ∧ 𝜓))) |
6 | reu6i 3716 | . . . . 5 ⊢ ((𝐵 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝜑 ↔ 𝑥 = 𝐵)) → ∃!𝑥 ∈ 𝐴 𝜑) | |
7 | 6 | ex 413 | . . . 4 ⊢ (𝐵 ∈ 𝐴 → (∀𝑥 ∈ 𝐴 (𝜑 ↔ 𝑥 = 𝐵) → ∃!𝑥 ∈ 𝐴 𝜑)) |
8 | 5, 7 | sylbird 261 | . . 3 ⊢ (𝐵 ∈ 𝐴 → ((∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝐵) ∧ 𝜓) → ∃!𝑥 ∈ 𝐴 𝜑)) |
9 | 8 | 3impib 1108 | . 2 ⊢ ((𝐵 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝐵) ∧ 𝜓) → ∃!𝑥 ∈ 𝐴 𝜑) |
10 | 9 | 3com23 1118 | 1 ⊢ ((𝐵 ∈ 𝐴 ∧ 𝜓 ∧ ∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝐵)) → ∃!𝑥 ∈ 𝐴 𝜑) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 ∧ w3a 1079 = wceq 1528 ∈ wcel 2105 ∀wral 3135 ∃!wreu 3137 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-12 2167 ax-ext 2790 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3an 1081 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-cleq 2811 df-clel 2890 df-ral 3140 df-rex 3141 df-reu 3142 |
This theorem is referenced by: uzwo3 12331 frmdup3 18020 frgpup3 18833 neiptopreu 21669 ufileu 22455 mirreu 26377 lmireu 26503 opreu2reuALT 30167 symgfcoeu 30653 |
Copyright terms: Public domain | W3C validator |