Metamath Proof Explorer


Theorem unrab

Description: Union of two restricted class abstractions. (Contributed by NM, 25-Mar-2004)

Ref Expression
Assertion unrab xA|φxA|ψ=xA|φψ

Proof

Step Hyp Ref Expression
1 df-rab xA|φ=x|xAφ
2 df-rab xA|ψ=x|xAψ
3 1 2 uneq12i xA|φxA|ψ=x|xAφx|xAψ
4 df-rab xA|φψ=x|xAφψ
5 unab x|xAφx|xAψ=x|xAφxAψ
6 andi xAφψxAφxAψ
7 6 abbii x|xAφψ=x|xAφxAψ
8 5 7 eqtr4i x|xAφx|xAψ=x|xAφψ
9 4 8 eqtr4i xA|φψ=x|xAφx|xAψ
10 3 9 eqtr4i xA|φxA|ψ=xA|φψ