Metamath Proof Explorer


Theorem cbvdisjf

Description: Change bound variables in a disjoint collection. (Contributed by Thierry Arnoux, 6-Apr-2017)

Ref Expression
Hypotheses cbvdisjf.1 _xA
cbvdisjf.2 _yB
cbvdisjf.3 _xC
cbvdisjf.4 x=yB=C
Assertion cbvdisjf DisjxABDisjyAC

Proof

Step Hyp Ref Expression
1 cbvdisjf.1 _xA
2 cbvdisjf.2 _yB
3 cbvdisjf.3 _xC
4 cbvdisjf.4 x=yB=C
5 nfv yxA
6 2 nfcri yzB
7 5 6 nfan yxAzB
8 1 nfcri xyA
9 3 nfcri xzC
10 8 9 nfan xyAzC
11 eleq1w x=yxAyA
12 4 eleq2d x=yzBzC
13 11 12 anbi12d x=yxAzByAzC
14 7 10 13 cbvmow *xxAzB*yyAzC
15 df-rmo *xAzB*xxAzB
16 df-rmo *yAzC*yyAzC
17 14 15 16 3bitr4i *xAzB*yAzC
18 17 albii z*xAzBz*yAzC
19 df-disj DisjxABz*xAzB
20 df-disj DisjyACz*yAzC
21 18 19 20 3bitr4i DisjxABDisjyAC