Theorem disjpr2 3737

Description: The intersection of distinct unordered pairs is disjoint. (Contributed by Alexander van der Vekens, 11-Nov-2017.)

Assertion

Ref	Expression
disjpr2	|- ( ( ( A =/= C /\ B =/= C ) /\ ( A =/= D /\ B =/= D ) ) -> ( { A , B } i^i { C , D } ) = (/) )

Proof of Theorem disjpr2

Step	Hyp	Ref	Expression
1		df-pr 3680	. . . 4 |- { C , D } = ( { C } u. { D } )
2	1	a1i 9	. . 3 |- ( ( ( A =/= C /\ B =/= C ) /\ ( A =/= D /\ B =/= D ) ) -> { C , D } = ( { C } u. { D } ) )
3	2	ineq2d 3410	. 2 |- ( ( ( A =/= C /\ B =/= C ) /\ ( A =/= D /\ B =/= D ) ) -> ( { A , B } i^i { C , D } ) = ( { A , B } i^i ( { C } u. { D } ) ) )
4		indi 3456	. . 3 |- ( { A , B } i^i ( { C } u. { D } ) ) = ( ( { A , B } i^i { C } ) u. ( { A , B } i^i { D } ) )
5		df-pr 3680	. . . . . . . 8 |- { A , B } = ( { A } u. { B } )
6	5	ineq1i 3406	. . . . . . 7 |- ( { A , B } i^i { C } ) = ( ( { A } u. { B } ) i^i { C } )
7		indir 3458	. . . . . . 7 |- ( ( { A } u. { B } ) i^i { C } ) = ( ( { A } i^i { C } ) u. ( { B } i^i { C } ) )
8	6, 7	eqtri 2252	. . . . . 6 |- ( { A , B } i^i { C } ) = ( ( { A } i^i { C } ) u. ( { B } i^i { C } ) )
9		disjsn2 3736	. . . . . . . . . 10 |- ( A =/= C -> ( { A } i^i { C } ) = (/) )
10	9	adantr 276	. . . . . . . . 9 |- ( ( A =/= C /\ B =/= C ) -> ( { A } i^i { C } ) = (/) )
11	10	adantr 276	. . . . . . . 8 |- ( ( ( A =/= C /\ B =/= C ) /\ ( A =/= D /\ B =/= D ) ) -> ( { A } i^i { C } ) = (/) )
12		disjsn2 3736	. . . . . . . . . 10 |- ( B =/= C -> ( { B } i^i { C } ) = (/) )
13	12	adantl 277	. . . . . . . . 9 |- ( ( A =/= C /\ B =/= C ) -> ( { B } i^i { C } ) = (/) )
14	13	adantr 276	. . . . . . . 8 |- ( ( ( A =/= C /\ B =/= C ) /\ ( A =/= D /\ B =/= D ) ) -> ( { B } i^i { C } ) = (/) )
15	11, 14	jca 306	. . . . . . 7 |- ( ( ( A =/= C /\ B =/= C ) /\ ( A =/= D /\ B =/= D ) ) -> ( ( { A } i^i { C } ) = (/) /\ ( { B } i^i { C } ) = (/) ) )
16		un00 3543	. . . . . . 7 |- ( ( ( { A } i^i { C } ) = (/) /\ ( { B } i^i { C } ) = (/) ) <-> ( ( { A } i^i { C } ) u. ( { B } i^i { C } ) ) = (/) )
17	15, 16	sylib 122	. . . . . 6 |- ( ( ( A =/= C /\ B =/= C ) /\ ( A =/= D /\ B =/= D ) ) -> ( ( { A } i^i { C } ) u. ( { B } i^i { C } ) ) = (/) )
18	8, 17	eqtrid 2276	. . . . 5 |- ( ( ( A =/= C /\ B =/= C ) /\ ( A =/= D /\ B =/= D ) ) -> ( { A , B } i^i { C } ) = (/) )
19	5	ineq1i 3406	. . . . . . 7 |- ( { A , B } i^i { D } ) = ( ( { A } u. { B } ) i^i { D } )
20		indir 3458	. . . . . . 7 |- ( ( { A } u. { B } ) i^i { D } ) = ( ( { A } i^i { D } ) u. ( { B } i^i { D } ) )
21	19, 20	eqtri 2252	. . . . . 6 |- ( { A , B } i^i { D } ) = ( ( { A } i^i { D } ) u. ( { B } i^i { D } ) )
22		disjsn2 3736	. . . . . . . . . 10 |- ( A =/= D -> ( { A } i^i { D } ) = (/) )
23	22	adantr 276	. . . . . . . . 9 |- ( ( A =/= D /\ B =/= D ) -> ( { A } i^i { D } ) = (/) )
24	23	adantl 277	. . . . . . . 8 |- ( ( ( A =/= C /\ B =/= C ) /\ ( A =/= D /\ B =/= D ) ) -> ( { A } i^i { D } ) = (/) )
25		disjsn2 3736	. . . . . . . . . 10 |- ( B =/= D -> ( { B } i^i { D } ) = (/) )
26	25	adantl 277	. . . . . . . . 9 |- ( ( A =/= D /\ B =/= D ) -> ( { B } i^i { D } ) = (/) )
27	26	adantl 277	. . . . . . . 8 |- ( ( ( A =/= C /\ B =/= C ) /\ ( A =/= D /\ B =/= D ) ) -> ( { B } i^i { D } ) = (/) )
28	24, 27	jca 306	. . . . . . 7 |- ( ( ( A =/= C /\ B =/= C ) /\ ( A =/= D /\ B =/= D ) ) -> ( ( { A } i^i { D } ) = (/) /\ ( { B } i^i { D } ) = (/) ) )
29		un00 3543	. . . . . . 7 |- ( ( ( { A } i^i { D } ) = (/) /\ ( { B } i^i { D } ) = (/) ) <-> ( ( { A } i^i { D } ) u. ( { B } i^i { D } ) ) = (/) )
30	28, 29	sylib 122	. . . . . 6 |- ( ( ( A =/= C /\ B =/= C ) /\ ( A =/= D /\ B =/= D ) ) -> ( ( { A } i^i { D } ) u. ( { B } i^i { D } ) ) = (/) )
31	21, 30	eqtrid 2276	. . . . 5 |- ( ( ( A =/= C /\ B =/= C ) /\ ( A =/= D /\ B =/= D ) ) -> ( { A , B } i^i { D } ) = (/) )
32	18, 31	uneq12d 3364	. . . 4 |- ( ( ( A =/= C /\ B =/= C ) /\ ( A =/= D /\ B =/= D ) ) -> ( ( { A , B } i^i { C } ) u. ( { A , B } i^i { D } ) ) = ( (/) u. (/) ) )
33		un0 3530	. . . 4 |- ( (/) u. (/) ) = (/)
34	32, 33	eqtrdi 2280	. . 3 |- ( ( ( A =/= C /\ B =/= C ) /\ ( A =/= D /\ B =/= D ) ) -> ( ( { A , B } i^i { C } ) u. ( { A , B } i^i { D } ) ) = (/) )
35	4, 34	eqtrid 2276	. 2 |- ( ( ( A =/= C /\ B =/= C ) /\ ( A =/= D /\ B =/= D ) ) -> ( { A , B } i^i ( { C } u. { D } ) ) = (/) )
36	3, 35	eqtrd 2264	1 |- ( ( ( A =/= C /\ B =/= C ) /\ ( A =/= D /\ B =/= D ) ) -> ( { A , B } i^i { C , D } ) = (/) )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1398   =/= wne 2403   u. cun 3199   i^i cin 3200   (/)c0 3496   {csn 3673   {cpr 3674

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2213

This theorem depends on definitions:  df-bi 117  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-v 2805  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-sn 3679  df-pr 3680

This theorem is referenced by:  hashtpgim  11155