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

Theorem cbvdisj 5125
Description: Change bound variables in a disjoint collection. (Contributed by Mario Carneiro, 14-Nov-2016.)
Hypotheses
Ref Expression
cbvdisj.1 𝑦𝐵
cbvdisj.2 𝑥𝐶
cbvdisj.3 (𝑥 = 𝑦𝐵 = 𝐶)
Assertion
Ref Expression
cbvdisj (Disj 𝑥𝐴 𝐵Disj 𝑦𝐴 𝐶)
Distinct variable group:   𝑥,𝑦,𝐴
Allowed substitution hints:   𝐵(𝑥,𝑦)   𝐶(𝑥,𝑦)

Proof of Theorem cbvdisj
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 cbvdisj.1 . . . . 5 𝑦𝐵
21nfcri 2895 . . . 4 𝑦 𝑧𝐵
3 cbvdisj.2 . . . . 5 𝑥𝐶
43nfcri 2895 . . . 4 𝑥 𝑧𝐶
5 cbvdisj.3 . . . . 5 (𝑥 = 𝑦𝐵 = 𝐶)
65eleq2d 2825 . . . 4 (𝑥 = 𝑦 → (𝑧𝐵𝑧𝐶))
72, 4, 6cbvrmow 3407 . . 3 (∃*𝑥𝐴 𝑧𝐵 ↔ ∃*𝑦𝐴 𝑧𝐶)
87albii 1816 . 2 (∀𝑧∃*𝑥𝐴 𝑧𝐵 ↔ ∀𝑧∃*𝑦𝐴 𝑧𝐶)
9 df-disj 5116 . 2 (Disj 𝑥𝐴 𝐵 ↔ ∀𝑧∃*𝑥𝐴 𝑧𝐵)
10 df-disj 5116 . 2 (Disj 𝑦𝐴 𝐶 ↔ ∀𝑧∃*𝑦𝐴 𝑧𝐶)
118, 9, 103bitr4i 303 1 (Disj 𝑥𝐴 𝐵Disj 𝑦𝐴 𝐶)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wal 1535   = wceq 1537  wcel 2106  wnfc 2888  ∃*wrmo 3377  Disj wdisj 5115
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-11 2155  ax-12 2175  ax-ext 2706
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1540  df-ex 1777  df-nf 1781  df-mo 2538  df-cleq 2727  df-clel 2814  df-nfc 2890  df-rmo 3378  df-disj 5116
This theorem is referenced by:  disjors  5131  disjxiun  5145  volfiniun  25596  voliun  25603  carsggect  34300  omsmeas  34305  disjf1  45126  disjrnmpt2  45131  fsumiunss  45531  sge0iunmpt  46374  iundjiun  46416  meadjiun  46422
  Copyright terms: Public domain W3C validator