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

Theorem cbvdisjv 4631
Description: Change bound variables in a disjoint collection. (Contributed by Mario Carneiro, 11-Dec-2016.)
Hypothesis
Ref Expression
cbvdisjv.1  |-  ( x  =  y  ->  B  =  C )
Assertion
Ref Expression
cbvdisjv  |-  (Disj  x  e.  A  B  <-> Disj  y  e.  A  C )
Distinct variable groups:    x, y, A    y, B    x, C
Allowed substitution hints:    B( x)    C( y)

Proof of Theorem cbvdisjv
StepHypRef Expression
1 nfcv 2764 . 2  |-  F/_ y B
2 nfcv 2764 . 2  |-  F/_ x C
3 cbvdisjv.1 . 2  |-  ( x  =  y  ->  B  =  C )
41, 2, 3cbvdisj 4630 1  |-  (Disj  x  e.  A  B  <-> Disj  y  e.  A  C )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 196    = wceq 1483  Disj wdisj 4620
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  df-disj 4621
This theorem is referenced by:  uniioombllem4  23354  hashunif  29562  totprob  30489  disjrnmpt2  39375  ismeannd  40684  psmeasure  40688  volmea  40691  meaiuninclem  40697  caratheodorylem1  40740  caratheodory  40742
  Copyright terms: Public domain W3C validator