Theorem undifrOLD

Description: Obsolete version of undifr as of 11-Mar-2025. (Contributed by Thierry Arnoux, 21-Nov-2023) (Proof modification is discouraged.) (New usage is discouraged.)

	Ref	Expression
Assertion	undifrOLD	$$⊢A\subseteq B\leftrightarrow \left(B\setminus A\right)\cup A=B$$

Proof

Step	Hyp	Ref	Expression
1		undif	$$⊢A\subseteq B\leftrightarrow A\cup \left(B\setminus A\right)=B$$
2		uncom	$$⊢A\cup \left(B\setminus A\right)=\left(B\setminus A\right)\cup A$$
3	2	eqeq1i	$$⊢A\cup \left(B\setminus A\right)=B\leftrightarrow \left(B\setminus A\right)\cup A=B$$
4	1 3	bitri	$$⊢A\subseteq B\leftrightarrow \left(B\setminus A\right)\cup A=B$$