Theorem diftpsn3 3721

Description: Removal of a singleton from an unordered triple. (Contributed by Alexander van der Vekens, 5-Oct-2017.)

Assertion

Ref	Expression
diftpsn3	|- ( ( A =/= C /\ B =/= C ) -> ( { A , B , C } \ { C } ) = { A , B } )

Proof of Theorem diftpsn3

Step	Hyp	Ref	Expression
1		df-tp 3591	. . . 4 |- { A , B , C } = ( { A , B } u. { C } )
2	1	a1i 9	. . 3 |- ( ( A =/= C /\ B =/= C ) -> { A , B , C } = ( { A , B } u. { C } ) )
3	2	difeq1d 3244	. 2 |- ( ( A =/= C /\ B =/= C ) -> ( { A , B , C } \ { C } ) = ( ( { A , B } u. { C } ) \ { C } ) )
4		difundir 3380	. . 3 |- ( ( { A , B } u. { C } ) \ { C } ) = ( ( { A , B } \ { C } ) u. ( { C } \ { C } ) )
5	4	a1i 9	. 2 |- ( ( A =/= C /\ B =/= C ) -> ( ( { A , B } u. { C } ) \ { C } ) = ( ( { A , B } \ { C } ) u. ( { C } \ { C } ) ) )
6		df-pr 3590	. . . . . . . . 9 |- { A , B } = ( { A } u. { B } )
7	6	a1i 9	. . . . . . . 8 |- ( ( A =/= C /\ B =/= C ) -> { A , B } = ( { A } u. { B } ) )
8	7	ineq1d 3327	. . . . . . 7 |- ( ( A =/= C /\ B =/= C ) -> ( { A , B } i^i { C } ) = ( ( { A } u. { B } ) i^i { C } ) )
9		incom 3319	. . . . . . . . 9 |- ( ( { A } u. { B } ) i^i { C } ) = ( { C } i^i ( { A } u. { B } ) )
10		indi 3374	. . . . . . . . 9 |- ( { C } i^i ( { A } u. { B } ) ) = ( ( { C } i^i { A } ) u. ( { C } i^i { B } ) )
11	9, 10	eqtri 2191	. . . . . . . 8 |- ( ( { A } u. { B } ) i^i { C } ) = ( ( { C } i^i { A } ) u. ( { C } i^i { B } ) )
12	11	a1i 9	. . . . . . 7 |- ( ( A =/= C /\ B =/= C ) -> ( ( { A } u. { B } ) i^i { C } ) = ( ( { C } i^i { A } ) u. ( { C } i^i { B } ) ) )
13		necom 2424	. . . . . . . . . . 11 |- ( A =/= C <-> C =/= A )
14		disjsn2 3646	. . . . . . . . . . 11 |- ( C =/= A -> ( { C } i^i { A } ) = (/) )
15	13, 14	sylbi 120	. . . . . . . . . 10 |- ( A =/= C -> ( { C } i^i { A } ) = (/) )
16	15	adantr 274	. . . . . . . . 9 |- ( ( A =/= C /\ B =/= C ) -> ( { C } i^i { A } ) = (/) )
17		necom 2424	. . . . . . . . . . 11 |- ( B =/= C <-> C =/= B )
18		disjsn2 3646	. . . . . . . . . . 11 |- ( C =/= B -> ( { C } i^i { B } ) = (/) )
19	17, 18	sylbi 120	. . . . . . . . . 10 |- ( B =/= C -> ( { C } i^i { B } ) = (/) )
20	19	adantl 275	. . . . . . . . 9 |- ( ( A =/= C /\ B =/= C ) -> ( { C } i^i { B } ) = (/) )
21	16, 20	uneq12d 3282	. . . . . . . 8 |- ( ( A =/= C /\ B =/= C ) -> ( ( { C } i^i { A } ) u. ( { C } i^i { B } ) ) = ( (/) u. (/) ) )
22		unidm 3270	. . . . . . . 8 |- ( (/) u. (/) ) = (/)
23	21, 22	eqtrdi 2219	. . . . . . 7 |- ( ( A =/= C /\ B =/= C ) -> ( ( { C } i^i { A } ) u. ( { C } i^i { B } ) ) = (/) )
24	8, 12, 23	3eqtrd 2207	. . . . . 6 |- ( ( A =/= C /\ B =/= C ) -> ( { A , B } i^i { C } ) = (/) )
25		disj3 3467	. . . . . 6 |- ( ( { A , B } i^i { C } ) = (/) <-> { A , B } = ( { A , B } \ { C } ) )
26	24, 25	sylib 121	. . . . 5 |- ( ( A =/= C /\ B =/= C ) -> { A , B } = ( { A , B } \ { C } ) )
27	26	eqcomd 2176	. . . 4 |- ( ( A =/= C /\ B =/= C ) -> ( { A , B } \ { C } ) = { A , B } )
28		difid 3483	. . . . 5 |- ( { C } \ { C } ) = (/)
29	28	a1i 9	. . . 4 |- ( ( A =/= C /\ B =/= C ) -> ( { C } \ { C } ) = (/) )
30	27, 29	uneq12d 3282	. . 3 |- ( ( A =/= C /\ B =/= C ) -> ( ( { A , B } \ { C } ) u. ( { C } \ { C } ) ) = ( { A , B } u. (/) ) )
31		un0 3448	. . 3 |- ( { A , B } u. (/) ) = { A , B }
32	30, 31	eqtrdi 2219	. 2 |- ( ( A =/= C /\ B =/= C ) -> ( ( { A , B } \ { C } ) u. ( { C } \ { C } ) ) = { A , B } )
33	3, 5, 32	3eqtrd 2207	1 |- ( ( A =/= C /\ B =/= C ) -> ( { A , B , C } \ { C } ) = { A , B } )

Syntax hints:   -> wi 4   /\ wa 103   = wceq 1348   =/= wne 2340   \ cdif 3118   u. cun 3119   i^i cin 3120   (/)c0 3414   {csn 3583   {cpr 3584   {ctp 3585

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152

This theorem depends on definitions:  df-bi 116  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-ral 2453  df-rab 2457  df-v 2732  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-nul 3415  df-sn 3589  df-pr 3590  df-tp 3591

This theorem is referenced by: (None)