Theorem riotaund 5933

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.)

Assertion

Ref	Expression
riotaund	⊢ (¬ ∃!𝑥 ∈ 𝐴 𝜑 → (℩𝑥 ∈ 𝐴 𝜑) = ∅)

Distinct variable group:   𝑥,𝐴

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem riotaund

Step	Hyp	Ref	Expression
1		df-riota 5898	. 2 ⊢ (℩𝑥 ∈ 𝐴 𝜑) = (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
2		df-reu 2490	. . 3 ⊢ (∃!𝑥 ∈ 𝐴 𝜑 ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
3		iotanul 5246	. . 3 ⊢ (¬ ∃!𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) → (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) = ∅)
4	2, 3	sylnbi 679	. 2 ⊢ (¬ ∃!𝑥 ∈ 𝐴 𝜑 → (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) = ∅)
5	1, 4	eqtrid 2249	1 ⊢ (¬ ∃!𝑥 ∈ 𝐴 𝜑 → (℩𝑥 ∈ 𝐴 𝜑) = ∅)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   = wceq 1372  ∃!weu 2053   ∈ wcel 2175  ∃!wreu 2485  ∅c0 3459  ℩cio 5229  ℩crio 5897

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-in1 615  ax-in2 616  ax-io 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-ext 2186

This theorem depends on definitions:  df-bi 117  df-tru 1375  df-fal 1378  df-nf 1483  df-sb 1785  df-eu 2056  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ral 2488  df-rex 2489  df-reu 2490  df-v 2773  df-dif 3167  df-in 3171  df-ss 3178  df-nul 3460  df-sn 3638  df-uni 3850  df-iota 5231  df-riota 5898

This theorem is referenced by: (None)