Theorem undifdc 7115

Description: Union of complementary parts into whole. This is a case where we can strengthen undifss 3575 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 3319	. . . 4 ⊢ (𝑤 = ∅ → (𝐴 ∖ 𝑤) = (𝐴 ∖ ∅))
3	1, 2	uneq12d 3362	. . 3 ⊢ (𝑤 = ∅ → (𝑤 ∪ (𝐴 ∖ 𝑤)) = (∅ ∪ (𝐴 ∖ ∅)))
4	3	eqeq2d 2243	. 2 ⊢ (𝑤 = ∅ → (𝐴 = (𝑤 ∪ (𝐴 ∖ 𝑤)) ↔ 𝐴 = (∅ ∪ (𝐴 ∖ ∅))))
5		id 19	. . . 4 ⊢ (𝑤 = 𝑣 → 𝑤 = 𝑣)
6		difeq2 3319	. . . 4 ⊢ (𝑤 = 𝑣 → (𝐴 ∖ 𝑤) = (𝐴 ∖ 𝑣))
7	5, 6	uneq12d 3362	. . 3 ⊢ (𝑤 = 𝑣 → (𝑤 ∪ (𝐴 ∖ 𝑤)) = (𝑣 ∪ (𝐴 ∖ 𝑣)))
8	7	eqeq2d 2243	. 2 ⊢ (𝑤 = 𝑣 → (𝐴 = (𝑤 ∪ (𝐴 ∖ 𝑤)) ↔ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))))
9		id 19	. . . 4 ⊢ (𝑤 = (𝑣 ∪ {𝑧}) → 𝑤 = (𝑣 ∪ {𝑧}))
10		difeq2 3319	. . . 4 ⊢ (𝑤 = (𝑣 ∪ {𝑧}) → (𝐴 ∖ 𝑤) = (𝐴 ∖ (𝑣 ∪ {𝑧})))
11	9, 10	uneq12d 3362	. . 3 ⊢ (𝑤 = (𝑣 ∪ {𝑧}) → (𝑤 ∪ (𝐴 ∖ 𝑤)) = ((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ (𝑣 ∪ {𝑧}))))
12	11	eqeq2d 2243	. 2 ⊢ (𝑤 = (𝑣 ∪ {𝑧}) → (𝐴 = (𝑤 ∪ (𝐴 ∖ 𝑤)) ↔ 𝐴 = ((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ (𝑣 ∪ {𝑧})))))
13		id 19	. . . 4 ⊢ (𝑤 = 𝐵 → 𝑤 = 𝐵)
14		difeq2 3319	. . . 4 ⊢ (𝑤 = 𝐵 → (𝐴 ∖ 𝑤) = (𝐴 ∖ 𝐵))
15	13, 14	uneq12d 3362	. . 3 ⊢ (𝑤 = 𝐵 → (𝑤 ∪ (𝐴 ∖ 𝑤)) = (𝐵 ∪ (𝐴 ∖ 𝐵)))
16	15	eqeq2d 2243	. 2 ⊢ (𝑤 = 𝐵 → (𝐴 = (𝑤 ∪ (𝐴 ∖ 𝑤)) ↔ 𝐴 = (𝐵 ∪ (𝐴 ∖ 𝐵))))
17		un0 3528	. . . 4 ⊢ ((𝐴 ∖ ∅) ∪ ∅) = (𝐴 ∖ ∅)
18		uncom 3351	. . . 4 ⊢ ((𝐴 ∖ ∅) ∪ ∅) = (∅ ∪ (𝐴 ∖ ∅))
19		dif0 3565	. . . 4 ⊢ (𝐴 ∖ ∅) = 𝐴
20	17, 18, 19	3eqtr3ri 2261	. . 3 ⊢ 𝐴 = (∅ ∪ (𝐴 ∖ ∅))
21	20	a1i 9	. 2 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) → 𝐴 = (∅ ∪ (𝐴 ∖ ∅)))
22		difundi 3459	. . . . . . 7 ⊢ (𝐴 ∖ (𝑣 ∪ {𝑧})) = ((𝐴 ∖ 𝑣) ∩ (𝐴 ∖ {𝑧}))
23	22	uneq2i 3358	. . . . . 6 ⊢ ((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ (𝑣 ∪ {𝑧}))) = ((𝑣 ∪ {𝑧}) ∪ ((𝐴 ∖ 𝑣) ∩ (𝐴 ∖ {𝑧})))
24		undi 3455	. . . . . 6 ⊢ ((𝑣 ∪ {𝑧}) ∪ ((𝐴 ∖ 𝑣) ∩ (𝐴 ∖ {𝑧}))) = (((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ 𝑣)) ∩ ((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ {𝑧})))
25	23, 24	eqtri 2252	. . . . 5 ⊢ ((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ (𝑣 ∪ {𝑧}))) = (((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ 𝑣)) ∩ ((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ {𝑧})))
26		uncom 3351	. . . . . . . . 9 ⊢ (𝑣 ∪ {𝑧}) = ({𝑧} ∪ 𝑣)
27	26	uneq1i 3357	. . . . . . . 8 ⊢ ((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ 𝑣)) = (({𝑧} ∪ 𝑣) ∪ (𝐴 ∖ 𝑣))
28		unass 3364	. . . . . . . 8 ⊢ (({𝑧} ∪ 𝑣) ∪ (𝐴 ∖ 𝑣)) = ({𝑧} ∪ (𝑣 ∪ (𝐴 ∖ 𝑣)))
29	27, 28	eqtri 2252	. . . . . . 7 ⊢ ((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ 𝑣)) = ({𝑧} ∪ (𝑣 ∪ (𝐴 ∖ 𝑣)))
30		simp3 1025	. . . . . . . . . . . 12 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) → 𝐵 ⊆ 𝐴)
31	30	ad3antrrr 492	. . . . . . . . . . 11 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → 𝐵 ⊆ 𝐴)
32		simplrr 538	. . . . . . . . . . . 12 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → 𝑧 ∈ (𝐵 ∖ 𝑣))
33	32	eldifad 3211	. . . . . . . . . . 11 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → 𝑧 ∈ 𝐵)
34	31, 33	sseldd 3228	. . . . . . . . . 10 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → 𝑧 ∈ 𝐴)
35	34	snssd 3818	. . . . . . . . 9 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → {𝑧} ⊆ 𝐴)
36		ssequn1 3377	. . . . . . . . 9 ⊢ ({𝑧} ⊆ 𝐴 ↔ ({𝑧} ∪ 𝐴) = 𝐴)
37	35, 36	sylib 122	. . . . . . . 8 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → ({𝑧} ∪ 𝐴) = 𝐴)
38		simpr 110	. . . . . . . . 9 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣)))
39	38	uneq2d 3361	. . . . . . . 8 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → ({𝑧} ∪ 𝐴) = ({𝑧} ∪ (𝑣 ∪ (𝐴 ∖ 𝑣))))
40	37, 39	eqtr3d 2266	. . . . . . 7 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → 𝐴 = ({𝑧} ∪ (𝑣 ∪ (𝐴 ∖ 𝑣))))
41	29, 40	eqtr4id 2283	. . . . . 6 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → ((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ 𝑣)) = 𝐴)
42		unass 3364	. . . . . . . 8 ⊢ ((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ {𝑧})) = (𝑣 ∪ ({𝑧} ∪ (𝐴 ∖ {𝑧})))
43		uncom 3351	. . . . . . . . . 10 ⊢ ({𝑧} ∪ (𝐴 ∖ {𝑧})) = ((𝐴 ∖ {𝑧}) ∪ {𝑧})
44		simp1 1023	. . . . . . . . . . . 12 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
45	44	ad3antrrr 492	. . . . . . . . . . 11 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
46		dcdifsnid 6671	. . . . . . . . . . 11 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝑧 ∈ 𝐴) → ((𝐴 ∖ {𝑧}) ∪ {𝑧}) = 𝐴)
47	45, 34, 46	syl2anc 411	. . . . . . . . . 10 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → ((𝐴 ∖ {𝑧}) ∪ {𝑧}) = 𝐴)
48	43, 47	eqtrid 2276	. . . . . . . . 9 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → ({𝑧} ∪ (𝐴 ∖ {𝑧})) = 𝐴)
49	48	uneq2d 3361	. . . . . . . 8 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → (𝑣 ∪ ({𝑧} ∪ (𝐴 ∖ {𝑧}))) = (𝑣 ∪ 𝐴))
50	42, 49	eqtrid 2276	. . . . . . 7 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → ((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ {𝑧})) = (𝑣 ∪ 𝐴))
51		simplrl 537	. . . . . . . . 9 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → 𝑣 ⊆ 𝐵)
52	51, 31	sstrd 3237	. . . . . . . 8 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → 𝑣 ⊆ 𝐴)
53		ssequn1 3377	. . . . . . . 8 ⊢ (𝑣 ⊆ 𝐴 ↔ (𝑣 ∪ 𝐴) = 𝐴)
54	52, 53	sylib 122	. . . . . . 7 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → (𝑣 ∪ 𝐴) = 𝐴)
55	50, 54	eqtrd 2264	. . . . . 6 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → ((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ {𝑧})) = 𝐴)
56	41, 55	ineq12d 3409	. . . . 5 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → (((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ 𝑣)) ∩ ((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ {𝑧}))) = (𝐴 ∩ 𝐴))
57	25, 56	eqtrid 2276	. . . 4 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → ((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ (𝑣 ∪ {𝑧}))) = (𝐴 ∩ 𝐴))
58		inidm 3416	. . . 4 ⊢ (𝐴 ∩ 𝐴) = 𝐴
59	57, 58	eqtr2di 2281	. . 3 ⊢ (((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) ∧ 𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣))) → 𝐴 = ((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ (𝑣 ∪ {𝑧}))))
60	59	ex 115	. 2 ⊢ ((((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) ∧ 𝑣 ∈ Fin) ∧ (𝑣 ⊆ 𝐵 ∧ 𝑧 ∈ (𝐵 ∖ 𝑣))) → (𝐴 = (𝑣 ∪ (𝐴 ∖ 𝑣)) → 𝐴 = ((𝑣 ∪ {𝑧}) ∪ (𝐴 ∖ (𝑣 ∪ {𝑧})))))
61		simp2 1024	. 2 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) → 𝐵 ∈ Fin)
62	4, 8, 12, 16, 21, 60, 61	findcard2sd 7080	1 ⊢ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦 ∧ 𝐵 ∈ Fin ∧ 𝐵 ⊆ 𝐴) → 𝐴 = (𝐵 ∪ (𝐴 ∖ 𝐵)))

Syntax hints:   → wi 4   ∧ wa 104  DECID wdc 841   ∧ w3a 1004   = wceq 1397   ∈ wcel 2202  ∀wral 2510   ∖ cdif 3197   ∪ cun 3198   ∩ cin 3199   ⊆ wss 3200  ∅c0 3494  {csn 3669  Fincfn 6908

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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686

This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-if 3606  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-id 4390  df-iord 4463  df-on 4465  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-er 6701  df-en 6909  df-fin 6911

This theorem is referenced by:  undiffi  7116