MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cbvdisjv Structured version   Visualization version   GIF version

Theorem cbvdisjv 5078
Description: Change bound variables in a disjoint collection. (Contributed by Mario Carneiro, 11-Dec-2016.)
Hypothesis
Ref Expression
cbvdisjv.1 (𝑥 = 𝑦𝐵 = 𝐶)
Assertion
Ref Expression
cbvdisjv (Disj 𝑥𝐴 𝐵Disj 𝑦𝐴 𝐶)
Distinct variable groups:   𝑥,𝑦,𝐴   𝑦,𝐵   𝑥,𝐶
Allowed substitution hints:   𝐵(𝑥)   𝐶(𝑦)

Proof of Theorem cbvdisjv
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 cbvdisjv.1 . . . . 5 (𝑥 = 𝑦𝐵 = 𝐶)
21eleq2d 2848 . . . 4 (𝑥 = 𝑦 → (𝑧𝐵𝑧𝐶))
32cbvrmovw 3388 . . 3 (∃*𝑥𝐴 𝑧𝐵 ↔ ∃*𝑦𝐴 𝑧𝐶)
43albii 1839 . 2 (∀𝑧∃*𝑥𝐴 𝑧𝐵 ↔ ∀𝑧∃*𝑦𝐴 𝑧𝐶)
5 df-disj 5068 . 2 (Disj 𝑥𝐴 𝐵 ↔ ∀𝑧∃*𝑥𝐴 𝑧𝐵)
6 df-disj 5068 . 2 (Disj 𝑦𝐴 𝐶 ↔ ∀𝑧∃*𝑦𝐴 𝑧𝐶)
74, 5, 63bitr4i 305 1 (Disj 𝑥𝐴 𝐵Disj 𝑦𝐴 𝐶)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wal 1558   = wceq 1560  wcel 2142  ∃*wrmo 3366  Disj wdisj 5067
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-ext 2734
This theorem depends on definitions:  df-bi 209  df-an 400  df-ex 1800  df-mo 2566  df-cleq 2754  df-clel 2837  df-rmo 3367  df-disj 5068
This theorem is referenced by:  uniioombllem4  25648  hashunif  33008  tocyccntz  33324  totprob  34724  disjrnmpt2  45766  ismeannd  47041  psmeasure  47045  volmea  47048  meaiuninclem  47054  caratheodorylem1  47100  caratheodory  47102
  Copyright terms: Public domain W3C validator