| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > riotaund | Structured version Visualization version GIF version | ||
| Description: Restricted iota equals the empty set when not meaningful. (Contributed by NM, 16-Jan-2012.) (Revised by Mario Carneiro, 15-Oct-2016.) (Revised by NM, 13-Sep-2018.) |
| Ref | Expression |
|---|---|
| riotaund | ⊢ (¬ ∃!𝑥 ∈ 𝐴 𝜑 → (℩𝑥 ∈ 𝐴 𝜑) = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-riota 7315 | . 2 ⊢ (℩𝑥 ∈ 𝐴 𝜑) = (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
| 2 | df-reu 3351 | . . 3 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
| 3 | iotanul 6472 | . . 3 ⊢ (¬ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) → (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) = ∅) | |
| 4 | 2, 3 | sylnbi 330 | . 2 ⊢ (¬ ∃!𝑥 ∈ 𝐴 𝜑 → (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) = ∅) |
| 5 | 1, 4 | eqtrid 2783 | 1 ⊢ (¬ ∃!𝑥 ∈ 𝐴 𝜑 → (℩𝑥 ∈ 𝐴 𝜑) = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∃!weu 2568 ∃!wreu 3348 ∅c0 4285 ℩cio 6446 ℩crio 7314 |
| 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 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-reu 3351 df-v 3442 df-dif 3904 df-ss 3918 df-nul 4286 df-sn 4581 df-uni 4864 df-iota 6448 df-riota 7315 |
| This theorem is referenced by: riotassuni 7355 riotaclb 7356 supval2 9358 lubval 18277 glbval 18290 grpinvfval 18908 finxpreclem4 37599 |
| Copyright terms: Public domain | W3C validator |