Theorem undifdc 6994

Description: Union of complementary parts into whole. This is a case where we can strengthen undifss 3532 from subset to equality. (Contributed by Jim Kingdon, 17-Jun-2022.)

Assertion

Ref	Expression
undifdc	⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) → 𝐴 = (𝐵 ∪ (𝐴 ∖ 𝐵)))

Distinct variable groups:   𝑥,𝐴,𝑦   𝑦,𝐵

Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem undifdc

Dummy variables 𝑣 𝑤 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		id 19	. . . 4 ⊢ (𝑤 = ∅ → 𝑤 = ∅)
2		difeq2 3276	. . . 4 ⊢ (𝑤 = ∅ → (𝐴 ∖ 𝑤) = (𝐴 ∖ ∅))
3	1, 2	uneq12d 3319	. . 3 ⊢ (𝑤 = ∅ → (𝑤 ∪ (𝐴 ∖ 𝑤)) = (∅ ∪ (𝐴 ∖ ∅)))
4	3	eqeq2d 2208	. 2 ⊢ (𝑤 = ∅ → (𝐴 = (𝑤 ∪ (𝐴 ∖ 𝑤)) ↔ 𝐴 = (∅ ∪ (𝐴 ∖ ∅))))
5		id 19	. . . 4 ⊢ (𝑤 = 𝑣 → 𝑤 = 𝑣)
6		difeq2 3276	. . . 4 ⊢ (𝑤 = 𝑣 → (𝐴 ∖ 𝑤) = (𝐴 ∖ 𝑣))
7	5, 6	uneq12d 3319	. . 3 ⊢ (𝑤 = 𝑣 → (𝑤 ∪ (𝐴 ∖ 𝑤)) = (𝑣 ∪ (𝐴 ∖ 𝑣)))
8	7	eqeq2d 2208	. 2 ⊢ (𝑤 = 𝑣 → (𝐴 = (𝑤 ∪ (𝐴 ∖ 𝑤)) ↔ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))))
9		id 19	. . . 4 ⊢ (𝑤 = (𝑣 ∪ {𝑧}) → 𝑤 = (𝑣 ∪ {𝑧}))
10		difeq2 3276	. . . 4 ⊢ (𝑤 = (𝑣 ∪ {𝑧}) → (𝐴 ∖ 𝑤) = (𝐴 ∖ (𝑣 ∪ {𝑧})))
11	9, 10	uneq12d 3319	. . 3 ⊢ (𝑤 = (𝑣 ∪ {𝑧}) → (𝑤 ∪ (𝐴 ∖ 𝑤)) = ((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ (𝑣 ∪ {𝑧}))))
12	11	eqeq2d 2208	. 2 ⊢ (𝑤 = (𝑣 ∪ {𝑧}) → (𝐴 = (𝑤 ∪ (𝐴 ∖ 𝑤)) ↔ 𝐴 = ((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ (𝑣 ∪ {𝑧})))))
13		id 19	. . . 4 ⊢ (𝑤 = 𝐵 → 𝑤 = 𝐵)
14		difeq2 3276	. . . 4 ⊢ (𝑤 = 𝐵 → (𝐴 ∖ 𝑤) = (𝐴 ∖ 𝐵))
15	13, 14	uneq12d 3319	. . 3 ⊢ (𝑤 = 𝐵 → (𝑤 ∪ (𝐴 ∖ 𝑤)) = (𝐵 ∪ (𝐴 ∖ 𝐵)))
16	15	eqeq2d 2208	. 2 ⊢ (𝑤 = 𝐵 → (𝐴 = (𝑤 ∪ (𝐴 ∖ 𝑤)) ↔ 𝐴 = (𝐵 ∪ (𝐴 ∖ 𝐵))))
17		un0 3485	. . . 4 ⊢ ((𝐴 ∖ ∅) ∪ ∅) = (𝐴 ∖ ∅)
18		uncom 3308	. . . 4 ⊢ ((𝐴 ∖ ∅) ∪ ∅) = (∅ ∪ (𝐴 ∖ ∅))
19		dif0 3522	. . . 4 ⊢ (𝐴 ∖ ∅) = 𝐴
20	17, 18, 19	3eqtr3ri 2226	. . 3 ⊢ 𝐴 = (∅ ∪ (𝐴 ∖ ∅))
21	20	a1i 9	. 2 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) → 𝐴 = (∅ ∪ (𝐴 ∖ ∅)))
22		difundi 3416	. . . . . . 7 ⊢ (𝐴 ∖ (𝑣 ∪ {𝑧})) = ((𝐴 ∖ 𝑣) ∩ (𝐴 ∖ {𝑧}))
23	22	uneq2i 3315	. . . . . 6 ⊢ ((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ (𝑣 ∪ {𝑧}))) = ((𝑣 ∪ {𝑧}) ∪ ((𝐴 ∖ 𝑣) ∩ (𝐴 ∖ {𝑧})))
24		undi 3412	. . . . . 6 ⊢ ((𝑣 ∪ {𝑧}) ∪ ((𝐴 ∖ 𝑣) ∩ (𝐴 ∖ {𝑧}))) = (((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ 𝑣)) ∩ ((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ {𝑧})))
25	23, 24	eqtri 2217	. . . . 5 ⊢ ((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ (𝑣 ∪ {𝑧}))) = (((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ 𝑣)) ∩ ((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ {𝑧})))
26		uncom 3308	. . . . . . . . 9 ⊢ (𝑣 ∪ {𝑧}) = ({𝑧} ∪ 𝑣)
27	26	uneq1i 3314	. . . . . . . 8 ⊢ ((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ 𝑣)) = (({𝑧} ∪ 𝑣) ∪ (𝐴 ∖ 𝑣))
28		unass 3321	. . . . . . . 8 ⊢ (({𝑧} ∪ 𝑣) ∪ (𝐴 ∖ 𝑣)) = ({𝑧} ∪ (𝑣 ∪ (𝐴 ∖ 𝑣)))
29	27, 28	eqtri 2217	. . . . . . 7 ⊢ ((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ 𝑣)) = ({𝑧} ∪ (𝑣 ∪ (𝐴 ∖ 𝑣)))
30		simp3 1001	. . . . . . . . . . . 12 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) → 𝐵 ⊆ 𝐴)
31	30	ad3antrrr 492	. . . . . . . . . . 11 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → 𝐵 ⊆ 𝐴)
32		simplrr 536	. . . . . . . . . . . 12 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → 𝑧 ∈ (𝐵 ∖ 𝑣))
33	32	eldifad 3168	. . . . . . . . . . 11 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → 𝑧 ∈ 𝐵)
34	31, 33	sseldd 3185	. . . . . . . . . 10 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → 𝑧 ∈ 𝐴)
35	34	snssd 3768	. . . . . . . . 9 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → {𝑧} ⊆ 𝐴)
36		ssequn1 3334	. . . . . . . . 9 ⊢ ({𝑧} ⊆ 𝐴 ↔ ({𝑧} ∪ 𝐴) = 𝐴)
37	35, 36	sylib 122	. . . . . . . 8 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → ({𝑧} ∪ 𝐴) = 𝐴)
38		simpr 110	. . . . . . . . 9 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣)))
39	38	uneq2d 3318	. . . . . . . 8 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → ({𝑧} ∪ 𝐴) = ({𝑧} ∪ (𝑣 ∪ (𝐴 ∖ 𝑣))))
40	37, 39	eqtr3d 2231	. . . . . . 7 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → 𝐴 = ({𝑧} ∪ (𝑣 ∪ (𝐴 ∖ 𝑣))))
41	29, 40	eqtr4id 2248	. . . . . 6 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → ((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ 𝑣)) = 𝐴)
42		unass 3321	. . . . . . . 8 ⊢ ((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ {𝑧})) = (𝑣 ∪ ({𝑧} ∪ (𝐴 ∖ {𝑧})))
43		uncom 3308	. . . . . . . . . 10 ⊢ ({𝑧} ∪ (𝐴 ∖ {𝑧})) = ((𝐴 ∖ {𝑧}) ∪ {𝑧})
44		simp1 999	. . . . . . . . . . . 12 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
45	44	ad3antrrr 492	. . . . . . . . . . 11 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
46		dcdifsnid 6571	. . . . . . . . . . 11 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝑧 ∈ 𝐴) → ((𝐴 ∖ {𝑧}) ∪ {𝑧}) = 𝐴)
47	45, 34, 46	syl2anc 411	. . . . . . . . . 10 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → ((𝐴 ∖ {𝑧}) ∪ {𝑧}) = 𝐴)
48	43, 47	eqtrid 2241	. . . . . . . . 9 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → ({𝑧} ∪ (𝐴 ∖ {𝑧})) = 𝐴)
49	48	uneq2d 3318	. . . . . . . 8 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → (𝑣 ∪ ({𝑧} ∪ (𝐴 ∖ {𝑧}))) = (𝑣 ∪ 𝐴))
50	42, 49	eqtrid 2241	. . . . . . 7 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → ((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ {𝑧})) = (𝑣 ∪ 𝐴))
51		simplrl 535	. . . . . . . . 9 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → 𝑣 ⊆ 𝐵)
52	51, 31	sstrd 3194	. . . . . . . 8 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → 𝑣 ⊆ 𝐴)
53		ssequn1 3334	. . . . . . . 8 ⊢ (𝑣 ⊆ 𝐴 ↔ (𝑣 ∪ 𝐴) = 𝐴)
54	52, 53	sylib 122	. . . . . . 7 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → (𝑣 ∪ 𝐴) = 𝐴)
55	50, 54	eqtrd 2229	. . . . . 6 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → ((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ {𝑧})) = 𝐴)
56	41, 55	ineq12d 3366	. . . . 5 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → (((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ 𝑣)) ∩ ((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ {𝑧}))) = (𝐴 ∩ 𝐴))
57	25, 56	eqtrid 2241	. . . 4 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → ((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ (𝑣 ∪ {𝑧}))) = (𝐴 ∩ 𝐴))
58		inidm 3373	. . . 4 ⊢ (𝐴 ∩ 𝐴) = 𝐴
59	57, 58	eqtr2di 2246	. . 3 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → 𝐴 = ((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ (𝑣 ∪ {𝑧}))))
60	59	ex 115	. 2 ⊢ ((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) → (𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣)) → 𝐴 = ((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ (𝑣 ∪ {𝑧})))))
61		simp2 1000	. 2 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) → 𝐵 ∈ Fin)
62	4, 8, 12, 16, 21, 60, 61	findcard2sd 6962	1 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) → 𝐴 = (𝐵 ∪ (𝐴 ∖ 𝐵)))

Syntax hints:   → wi 4   ∧ wa 104  DECID wdc 835   ∧ w3a 980   = wceq 1364   ∈ wcel 2167  ∀wral 2475   ∖ cdif 3154   ∪ cun 3155   ∩ cin 3156   ⊆ wss 3157  ∅c0 3451  {csn 3623  Fincfn 6808

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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-nul 4160  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-iinf 4625

This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-if 3563  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-tr 4133  df-id 4329  df-iord 4402  df-on 4404  df-suc 4407  df-iom 4628  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-er 6601  df-en 6809  df-fin 6811

This theorem is referenced by:  undiffi  6995