Theorem disjpss 2319

Description: A class is a proper subset of its union with a disjoint nonempty class.

Assertion

Ref	Expression
disjpss	|- (((A i^i B) = (/) /\ B =/= (/)) -> A (. (A u. B))

Proof of Theorem disjpss

Step	Hyp	Ref	Expression
1		sseq2 2083	. . . . . 6 |- ((A i^i B) = (/) -> (B (_ (A i^i B) <-> B (_ (/)))
2		ssid 2080	. . . . . . . 8 |- B (_ B
3	2	biantru 724	. . . . . . 7 |- (B (_ A <-> (B (_ A /\ B (_ B))
4		ssin 2232	. . . . . . 7 |- ((B (_ A /\ B (_ B) <-> B (_ (A i^i B))
5	3, 4	bitr 173	. . . . . 6 |- (B (_ A <-> B (_ (A i^i B))
6	1, 5	syl5bb 532	. . . . 5 |- ((A i^i B) = (/) -> (B (_ A <-> B (_ (/)))
7		ss0 2303	. . . . 5 |- (B (_ (/) -> B = (/))
8	6, 7	syl6bi 214	. . . 4 |- ((A i^i B) = (/) -> (B (_ A -> B = (/)))
9	8	necon3ad 1602	. . 3 |- ((A i^i B) = (/) -> (B =/= (/) -> -. B (_ A))
10	9	imp 350	. 2 |- (((A i^i B) = (/) /\ B =/= (/)) -> -. B (_ A)
11		nsspssun 2241	. . 3 |- (-. B (_ A <-> A (. (B u. A))
12		uncom 2176	. . . 4 |- (B u. A) = (A u. B)
13	12	psseq2i 2138	. . 3 |- (A (. (B u. A) <-> A (. (A u. B))
14	11, 13	bitr 173	. 2 |- (-. B (_ A <-> A (. (A u. B))
15	10, 14	sylib 198	1 |- (((A i^i B) = (/) /\ B =/= (/)) -> A (. (A u. B))

Syntax hints:  -. wn 2   -> wi 3   /\ wa 223   = wceq 956   =/= wne 1585   u. cun 2045   i^i cin 2046   (_ wss 2047   (. wpss 2048  (/)c0 2280

This theorem is referenced by:  infxpidmlem11 7562

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-12 968  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459

This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 981  df-sb 1172  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  df-v 1812  df-dif 2049  df-un 2050  df-in 2051  df-ss 2053  df-pss 2055  df-nul 2281

Copyright terms: Public domain