Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > rmoi | Structured version Visualization version GIF version |
Description: Consequence of "at most one", using implicit substitution. (Contributed by NM, 4-Nov-2012.) (Revised by NM, 16-Jun-2017.) |
Ref | Expression |
---|---|
rmoi.b | ⊢ (𝑥 = 𝐵 → (𝜑 ↔ 𝜓)) |
rmoi.c | ⊢ (𝑥 = 𝐶 → (𝜑 ↔ 𝜒)) |
Ref | Expression |
---|---|
rmoi | ⊢ ((∃*𝑥 ∈ 𝐴 𝜑 ∧ (𝐵 ∈ 𝐴 ∧ 𝜓) ∧ (𝐶 ∈ 𝐴 ∧ 𝜒)) → 𝐵 = 𝐶) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rmoi.b | . . 3 ⊢ (𝑥 = 𝐵 → (𝜑 ↔ 𝜓)) | |
2 | rmoi.c | . . 3 ⊢ (𝑥 = 𝐶 → (𝜑 ↔ 𝜒)) | |
3 | 1, 2 | rmob 3873 | . 2 ⊢ ((∃*𝑥 ∈ 𝐴 𝜑 ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) → (𝐵 = 𝐶 ↔ (𝐶 ∈ 𝐴 ∧ 𝜒))) |
4 | 3 | biimp3ar 1466 | 1 ⊢ ((∃*𝑥 ∈ 𝐴 𝜑 ∧ (𝐵 ∈ 𝐴 ∧ 𝜓) ∧ (𝐶 ∈ 𝐴 ∧ 𝜒)) → 𝐵 = 𝐶) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1083 = wceq 1533 ∈ wcel 2110 ∃*wrmo 3141 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-clab 2800 df-cleq 2814 df-clel 2893 df-rmo 3146 df-v 3496 |
This theorem is referenced by: eqsqrtd 14721 efgred2 18873 0frgp 18899 frgpnabllem2 18988 frgpcyg 20714 cdleme0moN 37355 proot1mul 39792 |
Copyright terms: Public domain | W3C validator |