| 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 2820 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝑧 ∈ 𝐵 ↔ 𝑧 ∈ 𝐶)) |
| 3 | 2 | cbvrmovw 3369 | . . 3 ⊢ (∃*𝑥 ∈ 𝐴 𝑧 ∈ 𝐵 ↔ ∃*𝑦 ∈ 𝐴 𝑧 ∈ 𝐶) |
| 4 | 3 | albii 1820 | . 2 ⊢ (∀𝑧∃*𝑥 ∈ 𝐴 𝑧 ∈ 𝐵 ↔ ∀𝑧∃*𝑦 ∈ 𝐴 𝑧 ∈ 𝐶) |
| 5 | df-disj 5064 | . 2 ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑧∃*𝑥 ∈ 𝐴 𝑧 ∈ 𝐵) | |
| 6 | df-disj 5064 | . 2 ⊢ (Disj 𝑦 ∈ 𝐴 𝐶 ↔ ∀𝑧∃*𝑦 ∈ 𝐴 𝑧 ∈ 𝐶) | |
| 7 | 4, 5, 6 | 3bitr4i 303 | 1 ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 ↔ Disj 𝑦 ∈ 𝐴 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∀wal 1539 = wceq 1541 ∈ wcel 2113 ∃*wrmo 3347 Disj wdisj 5063 |
| 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-ext 2706 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1781 df-mo 2537 df-cleq 2726 df-clel 2809 df-rmo 3348 df-disj 5064 |
| This theorem is referenced by: uniioombllem4 25541 hashunif 32835 tocyccntz 33175 totprob 34533 disjrnmpt2 45374 ismeannd 46653 psmeasure 46657 volmea 46660 meaiuninclem 46666 caratheodorylem1 46712 caratheodory 46714 |
| Copyright terms: Public domain | W3C validator |