Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > mobidv | GIF version |
Description: Formula-building rule for "at most one" quantifier (deduction form). (Contributed by Mario Carneiro, 7-Oct-2016.) |
Ref | Expression |
---|---|
mobidv.1 | ⊢ (𝜑 → (𝜓 ↔ 𝜒)) |
Ref | Expression |
---|---|
mobidv | ⊢ (𝜑 → (∃*𝑥𝜓 ↔ ∃*𝑥𝜒)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfv 1508 | . 2 ⊢ Ⅎ𝑥𝜑 | |
2 | mobidv.1 | . 2 ⊢ (𝜑 → (𝜓 ↔ 𝜒)) | |
3 | 1, 2 | mobid 2032 | 1 ⊢ (𝜑 → (∃*𝑥𝜓 ↔ ∃*𝑥𝜒)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 104 ∃*wmo 1998 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-5 1423 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-4 1487 ax-17 1506 ax-ial 1514 |
This theorem depends on definitions: df-bi 116 df-nf 1437 df-eu 2000 df-mo 2001 |
This theorem is referenced by: mobii 2034 mosubopt 4599 dffun6f 5131 funmo 5133 1stconst 6111 2ndconst 6112 dvfgg 12815 |
Copyright terms: Public domain | W3C validator |