Theorem neiopne 10474

Description: If an intersection is not empty its operands are not empty.

Assertion

Ref	Expression
neiopne	|- ((A i^i B) =/= (/) -> (A =/= (/) /\ B =/= (/)))

Proof of Theorem neiopne

Step	Hyp	Ref	Expression
1		ineq1 2210	. . . . 5 |- (A = (/) -> (A i^i B) = ((/) i^i B))
2		incom 2208	. . . . . 6 |- ((/) i^i B) = (B i^i (/))
3		eqtrt 1492	. . . . . . 7 |- (((A i^i B) = ((/) i^i B) /\ ((/) i^i B) = (B i^i (/))) -> (A i^i B) = (B i^i (/)))
4		in0 2298	. . . . . . 7 |- (B i^i (/)) = (/)
5	3, 4	syl6eq 1523	. . . . . 6 |- (((A i^i B) = ((/) i^i B) /\ ((/) i^i B) = (B i^i (/))) -> (A i^i B) = (/))
6	2, 5	mpan2 696	. . . . 5 |- ((A i^i B) = ((/) i^i B) -> (A i^i B) = (/))
7	1, 6	syl 10	. . . 4 |- (A = (/) -> (A i^i B) = (/))
8		ineq2 2211	. . . . 5 |- (B = (/) -> (A i^i B) = (A i^i (/)))
9		in0 2298	. . . . 5 |- (A i^i (/)) = (/)
10	8, 9	syl6eq 1523	. . . 4 |- (B = (/) -> (A i^i B) = (/))
11	7, 10	jaoi 341	. . 3 |- ((A = (/) \/ B = (/)) -> (A i^i B) = (/))
12	11	con3i 98	. 2 |- (-. (A i^i B) = (/) -> -. (A = (/) \/ B = (/)))
13		df-ne 1587	. 2 |- ((A i^i B) =/= (/) <-> -. (A i^i B) = (/))
14		neanior 1639	. 2 |- ((A =/= (/) /\ B =/= (/)) <-> -. (A = (/) \/ B = (/)))
15	12, 13, 14	3imtr4 219	1 |- ((A i^i B) =/= (/) -> (A =/= (/) /\ B =/= (/)))

Syntax hints:  -. wn 2   -> wi 3   \/ wo 222   /\ wa 223   = wceq 956   =/= wne 1585   i^i cin 2046  (/)c0 2280

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-in 2051  df-nul 2281

Copyright terms: Public domain