| Mathbox for Andrew Salmon |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > iotain | Structured version Visualization version GIF version | ||
| Description: Equivalence between two different forms of ℩. (Contributed by Andrew Salmon, 15-Jul-2011.) |
| Ref | Expression |
|---|---|
| iotain | ⊢ (∃!𝑥𝜑 → ∩ {𝑥 ∣ 𝜑} = (℩𝑥𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eu6 2604 | . 2 ⊢ (∃!𝑥𝜑 ↔ ∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦)) | |
| 2 | vex 3461 | . . . . 5 ⊢ 𝑦 ∈ V | |
| 3 | 2 | intsn 4945 | . . . 4 ⊢ ∩ {𝑦} = 𝑦 |
| 4 | abbi 2830 | . . . . . 6 ⊢ (∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → {𝑥 ∣ 𝜑} = {𝑥 ∣ 𝑥 = 𝑦}) | |
| 5 | df-sn 4586 | . . . . . 6 ⊢ {𝑦} = {𝑥 ∣ 𝑥 = 𝑦} | |
| 6 | 4, 5 | eqtr4di 2818 | . . . . 5 ⊢ (∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → {𝑥 ∣ 𝜑} = {𝑦}) |
| 7 | 6 | inteqd 4913 | . . . 4 ⊢ (∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → ∩ {𝑥 ∣ 𝜑} = ∩ {𝑦}) |
| 8 | iotaval 6499 | . . . 4 ⊢ (∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → (℩𝑥𝜑) = 𝑦) | |
| 9 | 3, 7, 8 | 3eqtr4a 2826 | . . 3 ⊢ (∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → ∩ {𝑥 ∣ 𝜑} = (℩𝑥𝜑)) |
| 10 | 9 | exlimiv 1953 | . 2 ⊢ (∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → ∩ {𝑥 ∣ 𝜑} = (℩𝑥𝜑)) |
| 11 | 1, 10 | sylbi 220 | 1 ⊢ (∃!𝑥𝜑 → ∩ {𝑥 ∣ 𝜑} = (℩𝑥𝜑)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∀wal 1561 = wceq 1563 ∃wex 1802 ∃!weu 2598 {cab 2743 {csn 4585 ∩ cint 4908 ℩cio 6479 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-12 2215 ax-ext 2737 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1566 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-ral 3080 df-rex 3090 df-v 3459 df-un 3912 df-in 3914 df-ss 3924 df-sn 4586 df-pr 4588 df-uni 4869 df-int 4909 df-iota 6481 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |