Theorem fidifsnen 7124

Description: All decrements of a finite set are equinumerous. (Contributed by Jim Kingdon, 9-Sep-2021.)

Assertion

Ref	Expression
fidifsnen	⊢ ((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑋 ∖ {𝐴}) ≈ (𝑋 ∖ {𝐵}))

Proof of Theorem fidifsnen

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		difexg 4251	. . . . . 6 ⊢ (𝑋 ∈ Fin → (𝑋 ∖ {𝐴}) ∈ V)
2	1	3ad2ant1 1045	. . . . 5 ⊢ ((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑋 ∖ {𝐴}) ∈ V)
3	2	adantr 276	. . . 4 ⊢ (((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 = 𝐵) → (𝑋 ∖ {𝐴}) ∈ V)
4		enrefg 7002	. . . 4 ⊢ ((𝑋 ∖ {𝐴}) ∈ V → (𝑋 ∖ {𝐴}) ≈ (𝑋 ∖ {𝐴}))
5	3, 4	syl 14	. . 3 ⊢ (((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 = 𝐵) → (𝑋 ∖ {𝐴}) ≈ (𝑋 ∖ {𝐴}))
6		sneq 3699	. . . . 5 ⊢ (𝐴 = 𝐵 → {𝐴} = {𝐵})
7	6	difeq2d 3336	. . . 4 ⊢ (𝐴 = 𝐵 → (𝑋 ∖ {𝐴}) = (𝑋 ∖ {𝐵}))
8	7	adantl 277	. . 3 ⊢ (((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 = 𝐵) → (𝑋 ∖ {𝐴}) = (𝑋 ∖ {𝐵}))
9	5, 8	breqtrd 4134	. 2 ⊢ (((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 = 𝐵) → (𝑋 ∖ {𝐴}) ≈ (𝑋 ∖ {𝐵}))
10	2	adantr 276	. . 3 ⊢ (((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) → (𝑋 ∖ {𝐴}) ∈ V)
11		eqid 2232	. . . 4 ⊢ (𝑥 ∈ (𝑋 ∖ {𝐴}) ↦ if(𝑥 = 𝐵, 𝐴, 𝑥)) = (𝑥 ∈ (𝑋 ∖ {𝐴}) ↦ if(𝑥 = 𝐵, 𝐴, 𝑥))
12		iftrue 3626	. . . . . . . 8 ⊢ (𝑥 = 𝐵 → if(𝑥 = 𝐵, 𝐴, 𝑥) = 𝐴)
13	12	adantl 277	. . . . . . 7 ⊢ (((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑥 ∈ (𝑋 ∖ {𝐴})) ∧ 𝑥 = 𝐵) → if(𝑥 = 𝐵, 𝐴, 𝑥) = 𝐴)
14		simpll2 1064	. . . . . . . 8 ⊢ ((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑥 ∈ (𝑋 ∖ {𝐴})) → 𝐴 ∈ 𝑋)
15	14	adantr 276	. . . . . . 7 ⊢ (((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑥 ∈ (𝑋 ∖ {𝐴})) ∧ 𝑥 = 𝐵) → 𝐴 ∈ 𝑋)
16	13, 15	eqeltrd 2309	. . . . . 6 ⊢ (((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑥 ∈ (𝑋 ∖ {𝐴})) ∧ 𝑥 = 𝐵) → if(𝑥 = 𝐵, 𝐴, 𝑥) ∈ 𝑋)
17		simpllr 536	. . . . . . . 8 ⊢ (((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑥 ∈ (𝑋 ∖ {𝐴})) ∧ 𝑥 = 𝐵) → ¬ 𝐴 = 𝐵)
18	13	eqeq1d 2241	. . . . . . . 8 ⊢ (((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑥 ∈ (𝑋 ∖ {𝐴})) ∧ 𝑥 = 𝐵) → (if(𝑥 = 𝐵, 𝐴, 𝑥) = 𝐵 ↔ 𝐴 = 𝐵))
19	17, 18	mtbird 680	. . . . . . 7 ⊢ (((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑥 ∈ (𝑋 ∖ {𝐴})) ∧ 𝑥 = 𝐵) → ¬ if(𝑥 = 𝐵, 𝐴, 𝑥) = 𝐵)
20	19	neneqad 2491	. . . . . 6 ⊢ (((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑥 ∈ (𝑋 ∖ {𝐴})) ∧ 𝑥 = 𝐵) → if(𝑥 = 𝐵, 𝐴, 𝑥) ≠ 𝐵)
21		eldifsn 3819	. . . . . 6 ⊢ (if(𝑥 = 𝐵, 𝐴, 𝑥) ∈ (𝑋 ∖ {𝐵}) ↔ (if(𝑥 = 𝐵, 𝐴, 𝑥) ∈ 𝑋 ∧ if(𝑥 = 𝐵, 𝐴, 𝑥) ≠ 𝐵))
22	16, 20, 21	sylanbrc 417	. . . . 5 ⊢ (((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑥 ∈ (𝑋 ∖ {𝐴})) ∧ 𝑥 = 𝐵) → if(𝑥 = 𝐵, 𝐴, 𝑥) ∈ (𝑋 ∖ {𝐵}))
23		iffalse 3629	. . . . . . . 8 ⊢ (¬ 𝑥 = 𝐵 → if(𝑥 = 𝐵, 𝐴, 𝑥) = 𝑥)
24	23	adantl 277	. . . . . . 7 ⊢ (((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑥 ∈ (𝑋 ∖ {𝐴})) ∧ ¬ 𝑥 = 𝐵) → if(𝑥 = 𝐵, 𝐴, 𝑥) = 𝑥)
25		eldifi 3340	. . . . . . . 8 ⊢ (𝑥 ∈ (𝑋 ∖ {𝐴}) → 𝑥 ∈ 𝑋)
26	25	ad2antlr 489	. . . . . . 7 ⊢ (((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑥 ∈ (𝑋 ∖ {𝐴})) ∧ ¬ 𝑥 = 𝐵) → 𝑥 ∈ 𝑋)
27	24, 26	eqeltrd 2309	. . . . . 6 ⊢ (((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑥 ∈ (𝑋 ∖ {𝐴})) ∧ ¬ 𝑥 = 𝐵) → if(𝑥 = 𝐵, 𝐴, 𝑥) ∈ 𝑋)
28		simpr 110	. . . . . . . 8 ⊢ (((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑥 ∈ (𝑋 ∖ {𝐴})) ∧ ¬ 𝑥 = 𝐵) → ¬ 𝑥 = 𝐵)
29	24	eqeq1d 2241	. . . . . . . 8 ⊢ (((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑥 ∈ (𝑋 ∖ {𝐴})) ∧ ¬ 𝑥 = 𝐵) → (if(𝑥 = 𝐵, 𝐴, 𝑥) = 𝐵 ↔ 𝑥 = 𝐵))
30	28, 29	mtbird 680	. . . . . . 7 ⊢ (((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑥 ∈ (𝑋 ∖ {𝐴})) ∧ ¬ 𝑥 = 𝐵) → ¬ if(𝑥 = 𝐵, 𝐴, 𝑥) = 𝐵)
31	30	neneqad 2491	. . . . . 6 ⊢ (((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑥 ∈ (𝑋 ∖ {𝐴})) ∧ ¬ 𝑥 = 𝐵) → if(𝑥 = 𝐵, 𝐴, 𝑥) ≠ 𝐵)
32	27, 31, 21	sylanbrc 417	. . . . 5 ⊢ (((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑥 ∈ (𝑋 ∖ {𝐴})) ∧ ¬ 𝑥 = 𝐵) → if(𝑥 = 𝐵, 𝐴, 𝑥) ∈ (𝑋 ∖ {𝐵}))
33		simpll1 1063	. . . . . . 7 ⊢ ((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑥 ∈ (𝑋 ∖ {𝐴})) → 𝑋 ∈ Fin)
34	25	adantl 277	. . . . . . 7 ⊢ ((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑥 ∈ (𝑋 ∖ {𝐴})) → 𝑥 ∈ 𝑋)
35		simpll3 1065	. . . . . . 7 ⊢ ((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑥 ∈ (𝑋 ∖ {𝐴})) → 𝐵 ∈ 𝑋)
36		fidceq 7123	. . . . . . 7 ⊢ ((𝑋 ∈ Fin ∧ 𝑥 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → DECID 𝑥 = 𝐵)
37	33, 34, 35, 36	syl3anc 1274	. . . . . 6 ⊢ ((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑥 ∈ (𝑋 ∖ {𝐴})) → DECID 𝑥 = 𝐵)
38		exmiddc 844	. . . . . 6 ⊢ (DECID 𝑥 = 𝐵 → (𝑥 = 𝐵 ∨ ¬ 𝑥 = 𝐵))
39	37, 38	syl 14	. . . . 5 ⊢ ((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑥 ∈ (𝑋 ∖ {𝐴})) → (𝑥 = 𝐵 ∨ ¬ 𝑥 = 𝐵))
40	22, 32, 39	mpjaodan 806	. . . 4 ⊢ ((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑥 ∈ (𝑋 ∖ {𝐴})) → if(𝑥 = 𝐵, 𝐴, 𝑥) ∈ (𝑋 ∖ {𝐵}))
41		iftrue 3626	. . . . . . 7 ⊢ (𝑦 = 𝐴 → if(𝑦 = 𝐴, 𝐵, 𝑦) = 𝐵)
42	41	adantl 277	. . . . . 6 ⊢ (((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵})) ∧ 𝑦 = 𝐴) → if(𝑦 = 𝐴, 𝐵, 𝑦) = 𝐵)
43		simpl3 1029	. . . . . . . 8 ⊢ (((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) → 𝐵 ∈ 𝑋)
44		simpr 110	. . . . . . . . . 10 ⊢ (((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) → ¬ 𝐴 = 𝐵)
45	44	neneqad 2491	. . . . . . . . 9 ⊢ (((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) → 𝐴 ≠ 𝐵)
46	45	necomd 2498	. . . . . . . 8 ⊢ (((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) → 𝐵 ≠ 𝐴)
47		eldifsn 3819	. . . . . . . 8 ⊢ (𝐵 ∈ (𝑋 ∖ {𝐴}) ↔ (𝐵 ∈ 𝑋 ∧ 𝐵 ≠ 𝐴))
48	43, 46, 47	sylanbrc 417	. . . . . . 7 ⊢ (((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) → 𝐵 ∈ (𝑋 ∖ {𝐴}))
49	48	ad2antrr 488	. . . . . 6 ⊢ (((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵})) ∧ 𝑦 = 𝐴) → 𝐵 ∈ (𝑋 ∖ {𝐴}))
50	42, 49	eqeltrd 2309	. . . . 5 ⊢ (((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵})) ∧ 𝑦 = 𝐴) → if(𝑦 = 𝐴, 𝐵, 𝑦) ∈ (𝑋 ∖ {𝐴}))
51		iffalse 3629	. . . . . . 7 ⊢ (¬ 𝑦 = 𝐴 → if(𝑦 = 𝐴, 𝐵, 𝑦) = 𝑦)
52	51	adantl 277	. . . . . 6 ⊢ (((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵})) ∧ ¬ 𝑦 = 𝐴) → if(𝑦 = 𝐴, 𝐵, 𝑦) = 𝑦)
53		eldifi 3340	. . . . . . . 8 ⊢ (𝑦 ∈ (𝑋 ∖ {𝐵}) → 𝑦 ∈ 𝑋)
54	53	ad2antlr 489	. . . . . . 7 ⊢ (((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵})) ∧ ¬ 𝑦 = 𝐴) → 𝑦 ∈ 𝑋)
55		simpr 110	. . . . . . . 8 ⊢ (((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵})) ∧ ¬ 𝑦 = 𝐴) → ¬ 𝑦 = 𝐴)
56	55	neneqad 2491	. . . . . . 7 ⊢ (((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵})) ∧ ¬ 𝑦 = 𝐴) → 𝑦 ≠ 𝐴)
57		eldifsn 3819	. . . . . . 7 ⊢ (𝑦 ∈ (𝑋 ∖ {𝐴}) ↔ (𝑦 ∈ 𝑋 ∧ 𝑦 ≠ 𝐴))
58	54, 56, 57	sylanbrc 417	. . . . . 6 ⊢ (((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵})) ∧ ¬ 𝑦 = 𝐴) → 𝑦 ∈ (𝑋 ∖ {𝐴}))
59	52, 58	eqeltrd 2309	. . . . 5 ⊢ (((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵})) ∧ ¬ 𝑦 = 𝐴) → if(𝑦 = 𝐴, 𝐵, 𝑦) ∈ (𝑋 ∖ {𝐴}))
60		simpll1 1063	. . . . . . 7 ⊢ ((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵})) → 𝑋 ∈ Fin)
61	53	adantl 277	. . . . . . 7 ⊢ ((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵})) → 𝑦 ∈ 𝑋)
62		simpll2 1064	. . . . . . 7 ⊢ ((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵})) → 𝐴 ∈ 𝑋)
63		fidceq 7123	. . . . . . 7 ⊢ ((𝑋 ∈ Fin ∧ 𝑦 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → DECID 𝑦 = 𝐴)
64	60, 61, 62, 63	syl3anc 1274	. . . . . 6 ⊢ ((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵})) → DECID 𝑦 = 𝐴)
65		exmiddc 844	. . . . . 6 ⊢ (DECID 𝑦 = 𝐴 → (𝑦 = 𝐴 ∨ ¬ 𝑦 = 𝐴))
66	64, 65	syl 14	. . . . 5 ⊢ ((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵})) → (𝑦 = 𝐴 ∨ ¬ 𝑦 = 𝐴))
67	50, 59, 66	mpjaodan 806	. . . 4 ⊢ ((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵})) → if(𝑦 = 𝐴, 𝐵, 𝑦) ∈ (𝑋 ∖ {𝐴}))
68	12	adantl 277	. . . . . . . . . 10 ⊢ (((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ 𝑥 = 𝐵) → if(𝑥 = 𝐵, 𝐴, 𝑥) = 𝐴)
69	68	eqeq2d 2244	. . . . . . . . 9 ⊢ (((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ 𝑥 = 𝐵) → (𝑦 = if(𝑥 = 𝐵, 𝐴, 𝑥) ↔ 𝑦 = 𝐴))
70	69	biimpar 297	. . . . . . . 8 ⊢ ((((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ 𝑥 = 𝐵) ∧ 𝑦 = 𝐴) → 𝑦 = if(𝑥 = 𝐵, 𝐴, 𝑥))
71	70	a1d 22	. . . . . . 7 ⊢ ((((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ 𝑥 = 𝐵) ∧ 𝑦 = 𝐴) → (𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦) → 𝑦 = if(𝑥 = 𝐵, 𝐴, 𝑥)))
72		simpr 110	. . . . . . . . . . 11 ⊢ (((((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ 𝑥 = 𝐵) ∧ ¬ 𝑦 = 𝐴) ∧ 𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦)) → 𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦))
73	51	eqeq2d 2244	. . . . . . . . . . . 12 ⊢ (¬ 𝑦 = 𝐴 → (𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦) ↔ 𝑥 = 𝑦))
74	73	ad2antlr 489	. . . . . . . . . . 11 ⊢ (((((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ 𝑥 = 𝐵) ∧ ¬ 𝑦 = 𝐴) ∧ 𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦)) → (𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦) ↔ 𝑥 = 𝑦))
75	72, 74	mpbid 147	. . . . . . . . . 10 ⊢ (((((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ 𝑥 = 𝐵) ∧ ¬ 𝑦 = 𝐴) ∧ 𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦)) → 𝑥 = 𝑦)
76		simpllr 536	. . . . . . . . . 10 ⊢ (((((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ 𝑥 = 𝐵) ∧ ¬ 𝑦 = 𝐴) ∧ 𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦)) → 𝑥 = 𝐵)
77	75, 76	eqtr3d 2267	. . . . . . . . 9 ⊢ (((((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ 𝑥 = 𝐵) ∧ ¬ 𝑦 = 𝐴) ∧ 𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦)) → 𝑦 = 𝐵)
78		simprr 533	. . . . . . . . . . . . 13 ⊢ ((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) → 𝑦 ∈ (𝑋 ∖ {𝐵}))
79	78	ad2antrr 488	. . . . . . . . . . . 12 ⊢ ((((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ 𝑥 = 𝐵) ∧ ¬ 𝑦 = 𝐴) → 𝑦 ∈ (𝑋 ∖ {𝐵}))
80	79	eldifbd 3222	. . . . . . . . . . 11 ⊢ ((((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ 𝑥 = 𝐵) ∧ ¬ 𝑦 = 𝐴) → ¬ 𝑦 ∈ {𝐵})
81	80	adantr 276	. . . . . . . . . 10 ⊢ (((((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ 𝑥 = 𝐵) ∧ ¬ 𝑦 = 𝐴) ∧ 𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦)) → ¬ 𝑦 ∈ {𝐵})
82		velsn 3705	. . . . . . . . . 10 ⊢ (𝑦 ∈ {𝐵} ↔ 𝑦 = 𝐵)
83	81, 82	sylnib 683	. . . . . . . . 9 ⊢ (((((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ 𝑥 = 𝐵) ∧ ¬ 𝑦 = 𝐴) ∧ 𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦)) → ¬ 𝑦 = 𝐵)
84	77, 83	pm2.21dd 625	. . . . . . . 8 ⊢ (((((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ 𝑥 = 𝐵) ∧ ¬ 𝑦 = 𝐴) ∧ 𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦)) → 𝑦 = if(𝑥 = 𝐵, 𝐴, 𝑥))
85	84	ex 115	. . . . . . 7 ⊢ ((((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ 𝑥 = 𝐵) ∧ ¬ 𝑦 = 𝐴) → (𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦) → 𝑦 = if(𝑥 = 𝐵, 𝐴, 𝑥)))
86		simpll1 1063	. . . . . . . . . 10 ⊢ ((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) → 𝑋 ∈ Fin)
87	53	ad2antll 491	. . . . . . . . . 10 ⊢ ((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) → 𝑦 ∈ 𝑋)
88		simpll2 1064	. . . . . . . . . 10 ⊢ ((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) → 𝐴 ∈ 𝑋)
89	86, 87, 88, 63	syl3anc 1274	. . . . . . . . 9 ⊢ ((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) → DECID 𝑦 = 𝐴)
90	89, 65	syl 14	. . . . . . . 8 ⊢ ((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) → (𝑦 = 𝐴 ∨ ¬ 𝑦 = 𝐴))
91	90	adantr 276	. . . . . . 7 ⊢ (((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ 𝑥 = 𝐵) → (𝑦 = 𝐴 ∨ ¬ 𝑦 = 𝐴))
92	71, 85, 91	mpjaodan 806	. . . . . 6 ⊢ (((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ 𝑥 = 𝐵) → (𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦) → 𝑦 = if(𝑥 = 𝐵, 𝐴, 𝑥)))
93	41	eqeq2d 2244	. . . . . . . . 9 ⊢ (𝑦 = 𝐴 → (𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦) ↔ 𝑥 = 𝐵))
94	93	biimprcd 160	. . . . . . . 8 ⊢ (𝑥 = 𝐵 → (𝑦 = 𝐴 → 𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦)))
95	94	adantl 277	. . . . . . 7 ⊢ (((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ 𝑥 = 𝐵) → (𝑦 = 𝐴 → 𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦)))
96	69, 95	sylbid 150	. . . . . 6 ⊢ (((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ 𝑥 = 𝐵) → (𝑦 = if(𝑥 = 𝐵, 𝐴, 𝑥) → 𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦)))
97	92, 96	impbid 129	. . . . 5 ⊢ (((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ 𝑥 = 𝐵) → (𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦) ↔ 𝑦 = if(𝑥 = 𝐵, 𝐴, 𝑥)))
98		simplr 529	. . . . . . . . 9 ⊢ (((((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ ¬ 𝑥 = 𝐵) ∧ 𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦)) ∧ 𝑦 = 𝐴) → 𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦))
99	41	adantl 277	. . . . . . . . 9 ⊢ (((((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ ¬ 𝑥 = 𝐵) ∧ 𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦)) ∧ 𝑦 = 𝐴) → if(𝑦 = 𝐴, 𝐵, 𝑦) = 𝐵)
100	98, 99	eqtrd 2265	. . . . . . . 8 ⊢ (((((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ ¬ 𝑥 = 𝐵) ∧ 𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦)) ∧ 𝑦 = 𝐴) → 𝑥 = 𝐵)
101		simpllr 536	. . . . . . . 8 ⊢ (((((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ ¬ 𝑥 = 𝐵) ∧ 𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦)) ∧ 𝑦 = 𝐴) → ¬ 𝑥 = 𝐵)
102	100, 101	pm2.21dd 625	. . . . . . 7 ⊢ (((((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ ¬ 𝑥 = 𝐵) ∧ 𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦)) ∧ 𝑦 = 𝐴) → 𝑦 = if(𝑥 = 𝐵, 𝐴, 𝑥))
103	23	ad3antlr 493	. . . . . . . 8 ⊢ (((((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ ¬ 𝑥 = 𝐵) ∧ 𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦)) ∧ ¬ 𝑦 = 𝐴) → if(𝑥 = 𝐵, 𝐴, 𝑥) = 𝑥)
104		simplr 529	. . . . . . . . 9 ⊢ (((((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ ¬ 𝑥 = 𝐵) ∧ 𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦)) ∧ ¬ 𝑦 = 𝐴) → 𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦))
105	51	adantl 277	. . . . . . . . 9 ⊢ (((((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ ¬ 𝑥 = 𝐵) ∧ 𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦)) ∧ ¬ 𝑦 = 𝐴) → if(𝑦 = 𝐴, 𝐵, 𝑦) = 𝑦)
106	104, 105	eqtrd 2265	. . . . . . . 8 ⊢ (((((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ ¬ 𝑥 = 𝐵) ∧ 𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦)) ∧ ¬ 𝑦 = 𝐴) → 𝑥 = 𝑦)
107	103, 106	eqtr2d 2266	. . . . . . 7 ⊢ (((((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ ¬ 𝑥 = 𝐵) ∧ 𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦)) ∧ ¬ 𝑦 = 𝐴) → 𝑦 = if(𝑥 = 𝐵, 𝐴, 𝑥))
108	90	ad2antrr 488	. . . . . . 7 ⊢ ((((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ ¬ 𝑥 = 𝐵) ∧ 𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦)) → (𝑦 = 𝐴 ∨ ¬ 𝑦 = 𝐴))
109	102, 107, 108	mpjaodan 806	. . . . . 6 ⊢ ((((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ ¬ 𝑥 = 𝐵) ∧ 𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦)) → 𝑦 = if(𝑥 = 𝐵, 𝐴, 𝑥))
110		simprl 531	. . . . . . . . . . . 12 ⊢ ((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) → 𝑥 ∈ (𝑋 ∖ {𝐴}))
111	110	eldifbd 3222	. . . . . . . . . . 11 ⊢ ((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) → ¬ 𝑥 ∈ {𝐴})
112		velsn 3705	. . . . . . . . . . 11 ⊢ (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴)
113	111, 112	sylnib 683	. . . . . . . . . 10 ⊢ ((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) → ¬ 𝑥 = 𝐴)
114	113	ad2antrr 488	. . . . . . . . 9 ⊢ ((((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ ¬ 𝑥 = 𝐵) ∧ 𝑦 = if(𝑥 = 𝐵, 𝐴, 𝑥)) → ¬ 𝑥 = 𝐴)
115		simpr 110	. . . . . . . . . . 11 ⊢ ((((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ ¬ 𝑥 = 𝐵) ∧ 𝑦 = if(𝑥 = 𝐵, 𝐴, 𝑥)) → 𝑦 = if(𝑥 = 𝐵, 𝐴, 𝑥))
116	23	eqeq2d 2244	. . . . . . . . . . . 12 ⊢ (¬ 𝑥 = 𝐵 → (𝑦 = if(𝑥 = 𝐵, 𝐴, 𝑥) ↔ 𝑦 = 𝑥))
117	116	ad2antlr 489	. . . . . . . . . . 11 ⊢ ((((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ ¬ 𝑥 = 𝐵) ∧ 𝑦 = if(𝑥 = 𝐵, 𝐴, 𝑥)) → (𝑦 = if(𝑥 = 𝐵, 𝐴, 𝑥) ↔ 𝑦 = 𝑥))
118	115, 117	mpbid 147	. . . . . . . . . 10 ⊢ ((((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ ¬ 𝑥 = 𝐵) ∧ 𝑦 = if(𝑥 = 𝐵, 𝐴, 𝑥)) → 𝑦 = 𝑥)
119	118	eqeq1d 2241	. . . . . . . . 9 ⊢ ((((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ ¬ 𝑥 = 𝐵) ∧ 𝑦 = if(𝑥 = 𝐵, 𝐴, 𝑥)) → (𝑦 = 𝐴 ↔ 𝑥 = 𝐴))
120	114, 119	mtbird 680	. . . . . . . 8 ⊢ ((((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ ¬ 𝑥 = 𝐵) ∧ 𝑦 = if(𝑥 = 𝐵, 𝐴, 𝑥)) → ¬ 𝑦 = 𝐴)
121	120, 51	syl 14	. . . . . . 7 ⊢ ((((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ ¬ 𝑥 = 𝐵) ∧ 𝑦 = if(𝑥 = 𝐵, 𝐴, 𝑥)) → if(𝑦 = 𝐴, 𝐵, 𝑦) = 𝑦)
122	121, 118	eqtr2d 2266	. . . . . 6 ⊢ ((((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ ¬ 𝑥 = 𝐵) ∧ 𝑦 = if(𝑥 = 𝐵, 𝐴, 𝑥)) → 𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦))
123	109, 122	impbida 600	. . . . 5 ⊢ (((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) ∧ ¬ 𝑥 = 𝐵) → (𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦) ↔ 𝑦 = if(𝑥 = 𝐵, 𝐴, 𝑥)))
124	39	adantrr 479	. . . . 5 ⊢ ((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) → (𝑥 = 𝐵 ∨ ¬ 𝑥 = 𝐵))
125	97, 123, 124	mpjaodan 806	. . . 4 ⊢ ((((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ∧ 𝑦 ∈ (𝑋 ∖ {𝐵}))) → (𝑥 = if(𝑦 = 𝐴, 𝐵, 𝑦) ↔ 𝑦 = if(𝑥 = 𝐵, 𝐴, 𝑥)))
126	11, 40, 67, 125	f1o2d 6259	. . 3 ⊢ (((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) → (𝑥 ∈ (𝑋 ∖ {𝐴}) ↦ if(𝑥 = 𝐵, 𝐴, 𝑥)):(𝑋 ∖ {𝐴})–1-1-onto→(𝑋 ∖ {𝐵}))
127		f1oeng 6995	. . 3 ⊢ (((𝑋 ∖ {𝐴}) ∈ V ∧ (𝑥 ∈ (𝑋 ∖ {𝐴}) ↦ if(𝑥 = 𝐵, 𝐴, 𝑥)):(𝑋 ∖ {𝐴})–1-1-onto→(𝑋 ∖ {𝐵})) → (𝑋 ∖ {𝐴}) ≈ (𝑋 ∖ {𝐵}))
128	10, 126, 127	syl2anc 411	. 2 ⊢ (((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ¬ 𝐴 = 𝐵) → (𝑋 ∖ {𝐴}) ≈ (𝑋 ∖ {𝐵}))
129		fidceq 7123	. . 3 ⊢ ((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → DECID 𝐴 = 𝐵)
130		exmiddc 844	. . 3 ⊢ (DECID 𝐴 = 𝐵 → (𝐴 = 𝐵 ∨ ¬ 𝐴 = 𝐵))
131	129, 130	syl 14	. 2 ⊢ ((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴 = 𝐵 ∨ ¬ 𝐴 = 𝐵))
132	9, 128, 131	mpjaodan 806	1 ⊢ ((𝑋 ∈ Fin ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝑋 ∖ {𝐴}) ≈ (𝑋 ∖ {𝐵}))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 716  DECID wdc 842   ∧ w3a 1005   = wceq 1398   ∈ wcel 2203   ≠ wne 2412  Vcvv 2812   ∖ cdif 3207  ifcif 3619  {csn 3688   class class class wbr 4108   ↦ cmpt 4170  –1-1-onto→wf1o 5350   ≈ cen 6972  Fincfn 6974

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-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4224  ax-sep 4227  ax-nul 4235  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-setind 4658  ax-iinf 4709

This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2814  df-sbc 3042  df-csb 3138  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-nul 3508  df-if 3620  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-int 3949  df-iun 3992  df-br 4109  df-opab 4171  df-mpt 4172  df-tr 4208  df-id 4413  df-iord 4486  df-on 4488  df-suc 4491  df-iom 4712  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761  df-iota 5311  df-fun 5353  df-fn 5354  df-f 5355  df-f1 5356  df-fo 5357  df-f1o 5358  df-fv 5359  df-en 6975  df-fin 6977

This theorem is referenced by:  dif1en  7135