![]() |
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 7364 | . 2 ⊢ (℩𝑥 ∈ 𝐴 𝜑) = (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
2 | df-reu 3377 | . . 3 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
3 | iotanul 6521 | . . 3 ⊢ (¬ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) → (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) = ∅) | |
4 | 2, 3 | sylnbi 329 | . 2 ⊢ (¬ ∃!𝑥 ∈ 𝐴 𝜑 → (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) = ∅) |
5 | 1, 4 | eqtrid 2784 | 1 ⊢ (¬ ∃!𝑥 ∈ 𝐴 𝜑 → (℩𝑥 ∈ 𝐴 𝜑) = ∅) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ∃!weu 2562 ∃!wreu 3374 ∅c0 4322 ℩cio 6493 ℩crio 7363 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-ral 3062 df-rex 3071 df-reu 3377 df-v 3476 df-dif 3951 df-in 3955 df-ss 3965 df-nul 4323 df-sn 4629 df-uni 4909 df-iota 6495 df-riota 7364 |
This theorem is referenced by: riotassuni 7405 riotaclb 7406 supval2 9449 lubval 18308 glbval 18321 grpinvfval 18862 finxpreclem4 36270 |
Copyright terms: Public domain | W3C validator |