| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cbvdisj | Structured version Visualization version 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 2887 | . . . 4 ⊢ Ⅎ𝑦 𝑧 ∈ 𝐵 |
| 3 | cbvdisj.2 | . . . . 5 ⊢ Ⅎ𝑥𝐶 | |
| 4 | 3 | nfcri 2887 | . . . 4 ⊢ Ⅎ𝑥 𝑧 ∈ 𝐶 |
| 5 | cbvdisj.3 | . . . . 5 ⊢ (𝑥 = 𝑦 → 𝐵 = 𝐶) | |
| 6 | 5 | eleq2d 2819 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝑧 ∈ 𝐵 ↔ 𝑧 ∈ 𝐶)) |
| 7 | 2, 4, 6 | cbvrmow 3372 | . . 3 ⊢ (∃*𝑥 ∈ 𝐴 𝑧 ∈ 𝐵 ↔ ∃*𝑦 ∈ 𝐴 𝑧 ∈ 𝐶) |
| 8 | 7 | albii 1820 | . 2 ⊢ (∀𝑧∃*𝑥 ∈ 𝐴 𝑧 ∈ 𝐵 ↔ ∀𝑧∃*𝑦 ∈ 𝐴 𝑧 ∈ 𝐶) |
| 9 | df-disj 5063 | . 2 ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑧∃*𝑥 ∈ 𝐴 𝑧 ∈ 𝐵) | |
| 10 | df-disj 5063 | . 2 ⊢ (Disj 𝑦 ∈ 𝐴 𝐶 ↔ ∀𝑧∃*𝑦 ∈ 𝐴 𝑧 ∈ 𝐶) | |
| 11 | 8, 9, 10 | 3bitr4i 303 | 1 ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 ↔ Disj 𝑦 ∈ 𝐴 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∀wal 1539 = wceq 1541 ∈ wcel 2113 Ⅎwnfc 2880 ∃*wrmo 3346 Disj wdisj 5062 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-11 2162 ax-12 2182 ax-ext 2705 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1544 df-ex 1781 df-nf 1785 df-mo 2537 df-cleq 2725 df-clel 2808 df-nfc 2882 df-rmo 3347 df-disj 5063 |
| This theorem is referenced by: disjors 5078 disjxiun 5092 volfiniun 25478 voliun 25485 carsggect 34354 omsmeas 34359 disjf1 45307 disjrnmpt2 45312 fsumiunss 45702 sge0iunmpt 46543 iundjiun 46585 meadjiun 46591 |
| Copyright terms: Public domain | W3C validator |