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 3823 | . 2 ⊢ ((∃*𝑥 ∈ 𝐴 𝜑 ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) → (𝐵 = 𝐶 ↔ (𝐶 ∈ 𝐴 ∧ 𝜒))) |
4 | 3 | biimp3ar 1469 | 1 ⊢ ((∃*𝑥 ∈ 𝐴 𝜑 ∧ (𝐵 ∈ 𝐴 ∧ 𝜓) ∧ (𝐶 ∈ 𝐴 ∧ 𝜒)) → 𝐵 = 𝐶) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1086 = wceq 1539 ∈ wcel 2106 ∃*wrmo 3067 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-clab 2716 df-cleq 2730 df-clel 2816 df-rmo 3071 df-v 3434 |
This theorem is referenced by: eqsqrtd 15079 efgred2 19359 0frgp 19385 frgpnabllem2 19475 frgpcyg 20781 cdleme0moN 38239 proot1mul 41024 |
Copyright terms: Public domain | W3C validator |