| 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 7367 | . 2 ⊢ (℩𝑥 ∈ 𝐴 𝜑) = (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
| 2 | df-reu 3370 | . . 3 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
| 3 | iotanul 6516 | . . 3 ⊢ (¬ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) → (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) = ∅) | |
| 4 | 2, 3 | sylnbi 333 | . 2 ⊢ (¬ ∃!𝑥 ∈ 𝐴 𝜑 → (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) = ∅) |
| 5 | 1, 4 | eqtrid 2810 | 1 ⊢ (¬ ∃!𝑥 ∈ 𝐴 𝜑 → (℩𝑥 ∈ 𝐴 𝜑) = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ∃!weu 2596 ∃!wreu 3367 ∅c0 4286 ℩cio 6490 ℩crio 7366 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-reu 3370 df-v 3457 df-dif 3908 df-ss 3922 df-nul 4287 df-sn 4590 df-uni 4873 df-iota 6492 df-riota 7367 |
| This theorem is referenced by: riotassuni 7407 riotaclb 7408 supval2 9411 lubval 18405 glbval 18418 grpinvfval 19040 finxpreclem4 38040 |
| Copyright terms: Public domain | W3C validator |