Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > iotaeq | GIF version |
Description: Equality theorem for descriptions. (Contributed by Andrew Salmon, 30-Jun-2011.) |
Ref | Expression |
---|---|
iotaeq | ⊢ (∀𝑥 𝑥 = 𝑦 → (℩𝑥𝜑) = (℩𝑦𝜑)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | drsb1 1787 | . . . . . . 7 ⊢ (∀𝑥 𝑥 = 𝑦 → ([𝑧 / 𝑥]𝜑 ↔ [𝑧 / 𝑦]𝜑)) | |
2 | df-clab 2152 | . . . . . . 7 ⊢ (𝑧 ∈ {𝑥 ∣ 𝜑} ↔ [𝑧 / 𝑥]𝜑) | |
3 | df-clab 2152 | . . . . . . 7 ⊢ (𝑧 ∈ {𝑦 ∣ 𝜑} ↔ [𝑧 / 𝑦]𝜑) | |
4 | 1, 2, 3 | 3bitr4g 222 | . . . . . 6 ⊢ (∀𝑥 𝑥 = 𝑦 → (𝑧 ∈ {𝑥 ∣ 𝜑} ↔ 𝑧 ∈ {𝑦 ∣ 𝜑})) |
5 | 4 | eqrdv 2163 | . . . . 5 ⊢ (∀𝑥 𝑥 = 𝑦 → {𝑥 ∣ 𝜑} = {𝑦 ∣ 𝜑}) |
6 | 5 | eqeq1d 2174 | . . . 4 ⊢ (∀𝑥 𝑥 = 𝑦 → ({𝑥 ∣ 𝜑} = {𝑧} ↔ {𝑦 ∣ 𝜑} = {𝑧})) |
7 | 6 | abbidv 2284 | . . 3 ⊢ (∀𝑥 𝑥 = 𝑦 → {𝑧 ∣ {𝑥 ∣ 𝜑} = {𝑧}} = {𝑧 ∣ {𝑦 ∣ 𝜑} = {𝑧}}) |
8 | 7 | unieqd 3800 | . 2 ⊢ (∀𝑥 𝑥 = 𝑦 → ∪ {𝑧 ∣ {𝑥 ∣ 𝜑} = {𝑧}} = ∪ {𝑧 ∣ {𝑦 ∣ 𝜑} = {𝑧}}) |
9 | df-iota 5153 | . 2 ⊢ (℩𝑥𝜑) = ∪ {𝑧 ∣ {𝑥 ∣ 𝜑} = {𝑧}} | |
10 | df-iota 5153 | . 2 ⊢ (℩𝑦𝜑) = ∪ {𝑧 ∣ {𝑦 ∣ 𝜑} = {𝑧}} | |
11 | 8, 9, 10 | 3eqtr4g 2224 | 1 ⊢ (∀𝑥 𝑥 = 𝑦 → (℩𝑥𝜑) = (℩𝑦𝜑)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∀wal 1341 = wceq 1343 [wsb 1750 ∈ wcel 2136 {cab 2151 {csn 3576 ∪ cuni 3789 ℩cio 5151 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-ext 2147 |
This theorem depends on definitions: df-bi 116 df-tru 1346 df-nf 1449 df-sb 1751 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-rex 2450 df-uni 3790 df-iota 5153 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |