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 2574 | . 2 ⊢ (∃!𝑥𝜑 ↔ ∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦)) | |
2 | vex 3426 | . . . . 5 ⊢ 𝑦 ∈ V | |
3 | 2 | intsn 4914 | . . . 4 ⊢ ∩ {𝑦} = 𝑦 |
4 | abbi1 2807 | . . . . . 6 ⊢ (∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → {𝑥 ∣ 𝜑} = {𝑥 ∣ 𝑥 = 𝑦}) | |
5 | df-sn 4559 | . . . . . 6 ⊢ {𝑦} = {𝑥 ∣ 𝑥 = 𝑦} | |
6 | 4, 5 | eqtr4di 2797 | . . . . 5 ⊢ (∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → {𝑥 ∣ 𝜑} = {𝑦}) |
7 | 6 | inteqd 4881 | . . . 4 ⊢ (∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → ∩ {𝑥 ∣ 𝜑} = ∩ {𝑦}) |
8 | iotaval 6392 | . . . 4 ⊢ (∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → (℩𝑥𝜑) = 𝑦) | |
9 | 3, 7, 8 | 3eqtr4a 2805 | . . 3 ⊢ (∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → ∩ {𝑥 ∣ 𝜑} = (℩𝑥𝜑)) |
10 | 9 | exlimiv 1934 | . 2 ⊢ (∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → ∩ {𝑥 ∣ 𝜑} = (℩𝑥𝜑)) |
11 | 1, 10 | sylbi 216 | 1 ⊢ (∃!𝑥𝜑 → ∩ {𝑥 ∣ 𝜑} = (℩𝑥𝜑)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∀wal 1537 = wceq 1539 ∃wex 1783 ∃!weu 2568 {cab 2715 {csn 4558 ∩ cint 4876 ℩cio 6374 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-tru 1542 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-ral 3068 df-v 3424 df-un 3888 df-in 3890 df-ss 3900 df-sn 4559 df-pr 4561 df-uni 4837 df-int 4877 df-iota 6376 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |