![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > iotabi | GIF version |
Description: Equivalence theorem for descriptions. (Contributed by Andrew Salmon, 30-Jun-2011.) |
Ref | Expression |
---|---|
iotabi | ⊢ (∀𝑥(𝜑 ↔ 𝜓) → (℩𝑥𝜑) = (℩𝑥𝜓)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | abbi 2291 | . . . . . 6 ⊢ (∀𝑥(𝜑 ↔ 𝜓) ↔ {𝑥 ∣ 𝜑} = {𝑥 ∣ 𝜓}) | |
2 | 1 | biimpi 120 | . . . . 5 ⊢ (∀𝑥(𝜑 ↔ 𝜓) → {𝑥 ∣ 𝜑} = {𝑥 ∣ 𝜓}) |
3 | 2 | eqeq1d 2186 | . . . 4 ⊢ (∀𝑥(𝜑 ↔ 𝜓) → ({𝑥 ∣ 𝜑} = {𝑧} ↔ {𝑥 ∣ 𝜓} = {𝑧})) |
4 | 3 | abbidv 2295 | . . 3 ⊢ (∀𝑥(𝜑 ↔ 𝜓) → {𝑧 ∣ {𝑥 ∣ 𝜑} = {𝑧}} = {𝑧 ∣ {𝑥 ∣ 𝜓} = {𝑧}}) |
5 | 4 | unieqd 3822 | . 2 ⊢ (∀𝑥(𝜑 ↔ 𝜓) → ∪ {𝑧 ∣ {𝑥 ∣ 𝜑} = {𝑧}} = ∪ {𝑧 ∣ {𝑥 ∣ 𝜓} = {𝑧}}) |
6 | df-iota 5180 | . 2 ⊢ (℩𝑥𝜑) = ∪ {𝑧 ∣ {𝑥 ∣ 𝜑} = {𝑧}} | |
7 | df-iota 5180 | . 2 ⊢ (℩𝑥𝜓) = ∪ {𝑧 ∣ {𝑥 ∣ 𝜓} = {𝑧}} | |
8 | 5, 6, 7 | 3eqtr4g 2235 | 1 ⊢ (∀𝑥(𝜑 ↔ 𝜓) → (℩𝑥𝜑) = (℩𝑥𝜓)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 105 ∀wal 1351 = wceq 1353 {cab 2163 {csn 3594 ∪ cuni 3811 ℩cio 5178 |
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-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-ext 2159 |
This theorem depends on definitions: df-bi 117 df-tru 1356 df-nf 1461 df-sb 1763 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-rex 2461 df-uni 3812 df-iota 5180 |
This theorem is referenced by: iotabidv 5201 iotabii 5202 eusvobj1 5864 |
Copyright terms: Public domain | W3C validator |