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

Theorem cbvdisj 5053
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 3374 . . 3 (∃*𝑥𝐴 𝑧𝐵 ↔ ∃*𝑦𝐴 𝑧𝐶)
87albii 1825 . 2 (∀𝑧∃*𝑥𝐴 𝑧𝐵 ↔ ∀𝑧∃*𝑦𝐴 𝑧𝐶)
9 df-disj 5044 . 2 (Disj 𝑥𝐴 𝐵 ↔ ∀𝑧∃*𝑥𝐴 𝑧𝐵)
10 df-disj 5044 . 2 (Disj 𝑦𝐴 𝐶 ↔ ∀𝑧∃*𝑦𝐴 𝑧𝐶)
118, 9, 103bitr4i 302 1 (Disj 𝑥𝐴 𝐵Disj 𝑦𝐴 𝐶)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wal 1539   = wceq 1541  wcel 2109  wnfc 2888  ∃*wrmo 3068  Disj wdisj 5043
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1801  ax-4 1815  ax-5 1916  ax-6 1974  ax-7 2014  ax-8 2111  ax-9 2119  ax-11 2157  ax-12 2174  ax-ext 2710
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-tru 1544  df-ex 1786  df-nf 1790  df-mo 2541  df-cleq 2731  df-clel 2817  df-nfc 2890  df-rmo 3073  df-disj 5044
This theorem is referenced by:  cbvdisjv  5054  disjors  5059  disjxiun  5075  volfiniun  24692  voliun  24699  carsggect  32264  omsmeas  32269  disjf1  42673  disjrnmpt2  42679  fsumiunss  43070  sge0iunmpt  43910  iundjiun  43952  meadjiun  43958
  Copyright terms: Public domain W3C validator