![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > 2moex | GIF version |
Description: Double quantification with "at most one". (Contributed by NM, 3-Dec-2001.) |
Ref | Expression |
---|---|
2moex | ⊢ (∃*𝑥∃𝑦𝜑 → ∀𝑦∃*𝑥𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | hbe1 1495 | . . 3 ⊢ (∃𝑦𝜑 → ∀𝑦∃𝑦𝜑) | |
2 | 1 | hbmo 2065 | . 2 ⊢ (∃*𝑥∃𝑦𝜑 → ∀𝑦∃*𝑥∃𝑦𝜑) |
3 | 19.8a 1590 | . . 3 ⊢ (𝜑 → ∃𝑦𝜑) | |
4 | 3 | moimi 2091 | . 2 ⊢ (∃*𝑥∃𝑦𝜑 → ∃*𝑥𝜑) |
5 | 2, 4 | alrimih 1469 | 1 ⊢ (∃*𝑥∃𝑦𝜑 → ∀𝑦∃*𝑥𝜑) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∀wal 1351 ∃wex 1492 ∃*wmo 2027 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 |
This theorem depends on definitions: df-bi 117 df-tru 1356 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 |
This theorem is referenced by: 2rmorex 2943 |
Copyright terms: Public domain | W3C validator |