| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 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 2602 | . 2 ⊢ (∃!𝑥𝜑 ↔ ∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦)) | |
| 2 | vex 3458 | . . . . 5 ⊢ 𝑦 ∈ V | |
| 3 | 2 | intsn 4947 | . . . 4 ⊢ ∩ {𝑦} = 𝑦 |
| 4 | abbi 2828 | . . . . . 6 ⊢ (∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → {𝑥 ∣ 𝜑} = {𝑥 ∣ 𝑥 = 𝑦}) | |
| 5 | df-sn 4589 | . . . . . 6 ⊢ {𝑦} = {𝑥 ∣ 𝑥 = 𝑦} | |
| 6 | 4, 5 | eqtr4di 2816 | . . . . 5 ⊢ (∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → {𝑥 ∣ 𝜑} = {𝑦}) |
| 7 | 6 | inteqd 4915 | . . . 4 ⊢ (∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → ∩ {𝑥 ∣ 𝜑} = ∩ {𝑦}) |
| 8 | iotaval 6533 | . . . 4 ⊢ (∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → (℩𝑥𝜑) = 𝑦) | |
| 9 | 3, 7, 8 | 3eqtr4a 2824 | . . 3 ⊢ (∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → ∩ {𝑥 ∣ 𝜑} = (℩𝑥𝜑)) |
| 10 | 9 | exlimiv 1965 | . 2 ⊢ (∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → ∩ {𝑥 ∣ 𝜑} = (℩𝑥𝜑)) |
| 11 | 1, 10 | sylbi 220 | 1 ⊢ (∃!𝑥𝜑 → ∩ {𝑥 ∣ 𝜑} = (℩𝑥𝜑)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∀wal 1568 = wceq 1570 ∃wex 1812 ∃!weu 2596 {cab 2741 {csn 4588 ∩ cint 4910 ℩cio 6513 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-12 2216 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1573 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-ral 3081 df-rex 3091 df-v 3456 df-ss 3901 df-in 4094 df-un 4154 df-sn 4589 df-pr 4591 df-uni 4871 df-int 4911 df-iota 6515 |
| This theorem is used by: aiotaexim 48383 |
| Copyright terms: Public domain | W3C validator |