| 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 2906 | . . . 4 ⊢ Ⅎ𝑦 𝑧 ∈ 𝐵 |
| 3 | cbvdisj.2 | . . . . 5 ⊢ Ⅎ𝑥𝐶 | |
| 4 | 3 | nfcri 2906 | . . . 4 ⊢ Ⅎ𝑥 𝑧 ∈ 𝐶 |
| 5 | cbvdisj.3 | . . . . 5 ⊢ (𝑥 = 𝑦 → 𝐵 = 𝐶) | |
| 6 | 5 | eleq2d 2838 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝑧 ∈ 𝐵 ↔ 𝑧 ∈ 𝐶)) |
| 7 | 2, 4, 6 | cbvrmow 3382 | . . 3 ⊢ (∃*𝑥 ∈ 𝐴 𝑧 ∈ 𝐵 ↔ ∃*𝑦 ∈ 𝐴 𝑧 ∈ 𝐶) |
| 8 | 7 | albii 1829 | . 2 ⊢ (∀𝑧∃*𝑥 ∈ 𝐴 𝑧 ∈ 𝐵 ↔ ∀𝑧∃*𝑦 ∈ 𝐴 𝑧 ∈ 𝐶) |
| 9 | df-disj 5058 | . 2 ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑧∃*𝑥 ∈ 𝐴 𝑧 ∈ 𝐵) | |
| 10 | df-disj 5058 | . 2 ⊢ (Disj 𝑦 ∈ 𝐴 𝐶 ↔ ∀𝑧∃*𝑦 ∈ 𝐴 𝑧 ∈ 𝐶) | |
| 11 | 8, 9, 10 | 3bitr4i 305 | 1 ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 ↔ Disj 𝑦 ∈ 𝐴 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∀wal 1548 = wceq 1550 ∈ wcel 2132 Ⅎwnfc 2899 ∃*wrmo 3356 Disj wdisj 5057 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1805 ax-4 1819 ax-5 1920 ax-6 1977 ax-7 2018 ax-8 2134 ax-9 2142 ax-11 2181 ax-12 2202 ax-ext 2724 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-tru 1553 df-ex 1790 df-nf 1794 df-mo 2556 df-cleq 2744 df-clel 2827 df-nfc 2901 df-rmo 3357 df-disj 5058 |
| This theorem is referenced by: disjors 5073 disjxiun 5087 volfiniun 25578 voliun 25585 carsggect 34559 omsmeas 34564 disjf1 45699 disjrnmpt2 45704 fsumiunss 46089 sge0iunmpt 46930 iundjiun 46972 meadjiun 46978 |
| Copyright terms: Public domain | W3C validator |