| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cbvdisjv | Structured version Visualization version GIF version | ||
| Description: Change bound variables in a disjoint collection. (Contributed by Mario Carneiro, 11-Dec-2016.) |
| Ref | Expression |
|---|---|
| cbvdisjv.1 | ⊢ (𝑥 = 𝑦 → 𝐵 = 𝐶) |
| Ref | Expression |
|---|---|
| cbvdisjv | ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 ↔ Disj 𝑦 ∈ 𝐴 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cbvdisjv.1 | . . . . 5 ⊢ (𝑥 = 𝑦 → 𝐵 = 𝐶) | |
| 2 | 1 | eleq2d 2823 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝑧 ∈ 𝐵 ↔ 𝑧 ∈ 𝐶)) |
| 3 | 2 | cbvrmovw 3373 | . . 3 ⊢ (∃*𝑥 ∈ 𝐴 𝑧 ∈ 𝐵 ↔ ∃*𝑦 ∈ 𝐴 𝑧 ∈ 𝐶) |
| 4 | 3 | albii 1821 | . 2 ⊢ (∀𝑧∃*𝑥 ∈ 𝐴 𝑧 ∈ 𝐵 ↔ ∀𝑧∃*𝑦 ∈ 𝐴 𝑧 ∈ 𝐶) |
| 5 | df-disj 5068 | . 2 ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑧∃*𝑥 ∈ 𝐴 𝑧 ∈ 𝐵) | |
| 6 | df-disj 5068 | . 2 ⊢ (Disj 𝑦 ∈ 𝐴 𝐶 ↔ ∀𝑧∃*𝑦 ∈ 𝐴 𝑧 ∈ 𝐶) | |
| 7 | 4, 5, 6 | 3bitr4i 303 | 1 ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 ↔ Disj 𝑦 ∈ 𝐴 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∀wal 1540 = wceq 1542 ∈ wcel 2114 ∃*wrmo 3351 Disj wdisj 5067 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1782 df-mo 2540 df-cleq 2729 df-clel 2812 df-rmo 3352 df-disj 5068 |
| This theorem is referenced by: uniioombllem4 25555 hashunif 32897 tocyccntz 33238 totprob 34605 disjrnmpt2 45547 ismeannd 46825 psmeasure 46829 volmea 46832 meaiuninclem 46838 caratheodorylem1 46884 caratheodory 46886 |
| Copyright terms: Public domain | W3C validator |