| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cbvdisj | GIF version | ||
| Description: Change bound variables in a disjoint collection. (Contributed by Mario Carneiro, 14-Nov-2016.) |
| Ref | Expression |
|---|---|
| cbvdisj.1 | ⊢ Ⅎ𝑦𝐵 |
| cbvdisj.2 | ⊢ Ⅎ𝑥𝐶 |
| cbvdisj.3 | ⊢ (𝑥 = 𝑦 → 𝐵 = 𝐶) |
| Ref | Expression |
|---|---|
| cbvdisj | ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 ↔ Disj 𝑦 ∈ 𝐴 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cbvdisj.1 | . . . . 5 ⊢ Ⅎ𝑦𝐵 | |
| 2 | 1 | nfcri 2369 | . . . 4 ⊢ Ⅎ𝑦 𝑧 ∈ 𝐵 |
| 3 | cbvdisj.2 | . . . . 5 ⊢ Ⅎ𝑥𝐶 | |
| 4 | 3 | nfcri 2369 | . . . 4 ⊢ Ⅎ𝑥 𝑧 ∈ 𝐶 |
| 5 | cbvdisj.3 | . . . . 5 ⊢ (𝑥 = 𝑦 → 𝐵 = 𝐶) | |
| 6 | 5 | eleq2d 2301 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝑧 ∈ 𝐵 ↔ 𝑧 ∈ 𝐶)) |
| 7 | 2, 4, 6 | cbvrmo 2767 | . . 3 ⊢ (∃*𝑥 ∈ 𝐴 𝑧 ∈ 𝐵 ↔ ∃*𝑦 ∈ 𝐴 𝑧 ∈ 𝐶) |
| 8 | 7 | albii 1519 | . 2 ⊢ (∀𝑧∃*𝑥 ∈ 𝐴 𝑧 ∈ 𝐵 ↔ ∀𝑧∃*𝑦 ∈ 𝐴 𝑧 ∈ 𝐶) |
| 9 | df-disj 4070 | . 2 ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑧∃*𝑥 ∈ 𝐴 𝑧 ∈ 𝐵) | |
| 10 | df-disj 4070 | . 2 ⊢ (Disj 𝑦 ∈ 𝐴 𝐶 ↔ ∀𝑧∃*𝑦 ∈ 𝐴 𝑧 ∈ 𝐶) | |
| 11 | 8, 9, 10 | 3bitr4i 212 | 1 ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 ↔ Disj 𝑦 ∈ 𝐴 𝐶) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 ∀wal 1396 = wceq 1398 ∈ wcel 2202 Ⅎwnfc 2362 ∃*wrmo 2514 Disj wdisj 4069 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-tru 1401 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-cleq 2224 df-clel 2227 df-nfc 2364 df-rex 2517 df-reu 2518 df-rmo 2519 df-disj 4070 |
| This theorem is referenced by: cbvdisjv 4080 disjnims 4084 |
| Copyright terms: Public domain | W3C validator |