Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > mobid | Structured version Visualization version GIF version |
Description: Formula-building rule for the at-most-one quantifier (deduction form). (Contributed by NM, 8-Mar-1995.) Remove dependency on ax-10 2145, ax-11 2161, ax-13 2390. (Revised by BJ, 14-Oct-2022.) (Proof shortened by Wolf Lammen, 18-Feb-2023.) |
Ref | Expression |
---|---|
mobid.1 | ⊢ Ⅎ𝑥𝜑 |
mobid.2 | ⊢ (𝜑 → (𝜓 ↔ 𝜒)) |
Ref | Expression |
---|---|
mobid | ⊢ (𝜑 → (∃*𝑥𝜓 ↔ ∃*𝑥𝜒)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mobid.1 | . . 3 ⊢ Ⅎ𝑥𝜑 | |
2 | mobid.2 | . . 3 ⊢ (𝜑 → (𝜓 ↔ 𝜒)) | |
3 | 1, 2 | alrimi 2213 | . 2 ⊢ (𝜑 → ∀𝑥(𝜓 ↔ 𝜒)) |
4 | mobi 2630 | . 2 ⊢ (∀𝑥(𝜓 ↔ 𝜒) → (∃*𝑥𝜓 ↔ ∃*𝑥𝜒)) | |
5 | 3, 4 | syl 17 | 1 ⊢ (𝜑 → (∃*𝑥𝜓 ↔ ∃*𝑥𝜒)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∀wal 1535 Ⅎwnf 1784 ∃*wmo 2620 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-12 2177 |
This theorem depends on definitions: df-bi 209 df-an 399 df-ex 1781 df-nf 1785 df-mo 2622 |
This theorem is referenced by: moanim 2705 rmobida 3392 rmoeq1f 3400 funcnvmpt 30412 |
Copyright terms: Public domain | W3C validator |