Theorem bj-charfunbi 16581

Description: In an ambient set 𝑋, if membership in 𝐴 is stable, then it is decidable if and only if 𝐴 has a characteristic function.

This characterization can be applied to singletons when the set 𝑋 has stable equality, which is the case as soon as it has a tight apartness relation. (Contributed by BJ, 6-Aug-2024.)

Hypotheses

Ref	Expression
bj-charfunbi.ex	⊢ (𝜑 → 𝑋 ∈ 𝑉)
bj-charfunbi.st	⊢ (𝜑 → ∀𝑥 ∈ 𝑋 STAB 𝑥 ∈ 𝐴)

Assertion

Ref	Expression
bj-charfunbi	⊢ (𝜑 → (∀𝑥 ∈ 𝑋 DECID 𝑥 ∈ 𝐴 ↔ ∃𝑓 ∈ (2o ↑𝑚 𝑋)(∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅)))

Distinct variable groups:   𝐴,𝑓,𝑥   𝑓,𝑋,𝑥   𝜑,𝑓,𝑥

Allowed substitution hints:   𝑉(𝑥,𝑓)

Proof of Theorem bj-charfunbi

Dummy variables 𝑔 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eleq1w 2293	. . . . 5 ⊢ (𝑥 = 𝑧 → (𝑥 ∈ 𝐴 ↔ 𝑧 ∈ 𝐴))
2	1	dcbid 846	. . . 4 ⊢ (𝑥 = 𝑧 → (DECID 𝑥 ∈ 𝐴 ↔ DECID 𝑧 ∈ 𝐴))
3	2	cbvralvw 2782	. . 3 ⊢ (∀𝑥 ∈ 𝑋 DECID 𝑥 ∈ 𝐴 ↔ ∀𝑧 ∈ 𝑋 DECID 𝑧 ∈ 𝐴)
4		eleq1w 2293	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑥 → (𝑧 ∈ 𝐴 ↔ 𝑥 ∈ 𝐴))
5	4	ifbid 3644	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑥 → if(𝑧 ∈ 𝐴, 1o, ∅) = if(𝑥 ∈ 𝐴, 1o, ∅))
6	5	cbvmptv 4206	. . . . . . . . . 10 ⊢ (𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅)) = (𝑥 ∈ 𝑋 ↦ if(𝑥 ∈ 𝐴, 1o, ∅))
7	6	a1i 9	. . . . . . . . 9 ⊢ ((𝜑 ∧ ∀𝑧 ∈ 𝑋 DECID 𝑧 ∈ 𝐴) → (𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅)) = (𝑥 ∈ 𝑋 ↦ if(𝑥 ∈ 𝐴, 1o, ∅)))
8	3	biimpri 133	. . . . . . . . . 10 ⊢ (∀𝑧 ∈ 𝑋 DECID 𝑧 ∈ 𝐴 → ∀𝑥 ∈ 𝑋 DECID 𝑥 ∈ 𝐴)
9	8	adantl 277	. . . . . . . . 9 ⊢ ((𝜑 ∧ ∀𝑧 ∈ 𝑋 DECID 𝑧 ∈ 𝐴) → ∀𝑥 ∈ 𝑋 DECID 𝑥 ∈ 𝐴)
10	7, 9	bj-charfundc 16578	. . . . . . . 8 ⊢ ((𝜑 ∧ ∀𝑧 ∈ 𝑋 DECID 𝑧 ∈ 𝐴) → ((𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅)):𝑋⟶2o ∧ (∀𝑥 ∈ (𝑋 ∩ 𝐴)((𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅))‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)((𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅))‘𝑥) = ∅)))
11	10	ex 115	. . . . . . 7 ⊢ (𝜑 → (∀𝑧 ∈ 𝑋 DECID 𝑧 ∈ 𝐴 → ((𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅)):𝑋⟶2o ∧ (∀𝑥 ∈ (𝑋 ∩ 𝐴)((𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅))‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)((𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅))‘𝑥) = ∅))))
12		2on 6656	. . . . . . . . . . 11 ⊢ 2o ∈ On
13	12	a1i 9	. . . . . . . . . 10 ⊢ (𝜑 → 2o ∈ On)
14		bj-charfunbi.ex	. . . . . . . . . 10 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
15	13, 14	elmapd 6896	. . . . . . . . 9 ⊢ (𝜑 → ((𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅)) ∈ (2o ↑𝑚 𝑋) ↔ (𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅)):𝑋⟶2o))
16	15	biimprd 158	. . . . . . . 8 ⊢ (𝜑 → ((𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅)):𝑋⟶2o → (𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅)) ∈ (2o ↑𝑚 𝑋)))
17	16	adantrd 279	. . . . . . 7 ⊢ (𝜑 → (((𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅)):𝑋⟶2o ∧ (∀𝑥 ∈ (𝑋 ∩ 𝐴)((𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅))‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)((𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅))‘𝑥) = ∅)) → (𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅)) ∈ (2o ↑𝑚 𝑋)))
18	11, 17	syld 45	. . . . . 6 ⊢ (𝜑 → (∀𝑧 ∈ 𝑋 DECID 𝑧 ∈ 𝐴 → (𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅)) ∈ (2o ↑𝑚 𝑋)))
19	18	imp 124	. . . . 5 ⊢ ((𝜑 ∧ ∀𝑧 ∈ 𝑋 DECID 𝑧 ∈ 𝐴) → (𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅)) ∈ (2o ↑𝑚 𝑋))
20		fveq1 5669	. . . . . . . . 9 ⊢ (𝑓 = (𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅)) → (𝑓‘𝑥) = ((𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅))‘𝑥))
21	20	eqeq1d 2241	. . . . . . . 8 ⊢ (𝑓 = (𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅)) → ((𝑓‘𝑥) = 1o ↔ ((𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅))‘𝑥) = 1o))
22	21	ralbidv 2542	. . . . . . 7 ⊢ (𝑓 = (𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅)) → (∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) = 1o ↔ ∀𝑥 ∈ (𝑋 ∩ 𝐴)((𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅))‘𝑥) = 1o))
23	20	eqeq1d 2241	. . . . . . . 8 ⊢ (𝑓 = (𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅)) → ((𝑓‘𝑥) = ∅ ↔ ((𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅))‘𝑥) = ∅))
24	23	ralbidv 2542	. . . . . . 7 ⊢ (𝑓 = (𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅)) → (∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅ ↔ ∀𝑥 ∈ (𝑋 ∖ 𝐴)((𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅))‘𝑥) = ∅))
25	22, 24	anbi12d 473	. . . . . 6 ⊢ (𝑓 = (𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅)) → ((∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅) ↔ (∀𝑥 ∈ (𝑋 ∩ 𝐴)((𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅))‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)((𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅))‘𝑥) = ∅)))
26	25	adantl 277	. . . . 5 ⊢ (((𝜑 ∧ ∀𝑧 ∈ 𝑋 DECID 𝑧 ∈ 𝐴) ∧ 𝑓 = (𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅))) → ((∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅) ↔ (∀𝑥 ∈ (𝑋 ∩ 𝐴)((𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅))‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)((𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅))‘𝑥) = ∅)))
27	10	simprd 114	. . . . 5 ⊢ ((𝜑 ∧ ∀𝑧 ∈ 𝑋 DECID 𝑧 ∈ 𝐴) → (∀𝑥 ∈ (𝑋 ∩ 𝐴)((𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅))‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)((𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅))‘𝑥) = ∅))
28	19, 26, 27	rspcedvd 2927	. . . 4 ⊢ ((𝜑 ∧ ∀𝑧 ∈ 𝑋 DECID 𝑧 ∈ 𝐴) → ∃𝑓 ∈ (2o ↑𝑚 𝑋)(∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅))
29	28	ex 115	. . 3 ⊢ (𝜑 → (∀𝑧 ∈ 𝑋 DECID 𝑧 ∈ 𝐴 → ∃𝑓 ∈ (2o ↑𝑚 𝑋)(∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅)))
30	3, 29	biimtrid 152	. 2 ⊢ (𝜑 → (∀𝑥 ∈ 𝑋 DECID 𝑥 ∈ 𝐴 → ∃𝑓 ∈ (2o ↑𝑚 𝑋)(∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅)))
31		omex 4715	. . . . . . . . 9 ⊢ ω ∈ V
32		2ssom 6757	. . . . . . . . 9 ⊢ 2o ⊆ ω
33		mapss 6926	. . . . . . . . 9 ⊢ ((ω ∈ V ∧ 2o ⊆ ω) → (2o ↑𝑚 𝑋) ⊆ (ω ↑𝑚 𝑋))
34	31, 32, 33	mp2an 426	. . . . . . . 8 ⊢ (2o ↑𝑚 𝑋) ⊆ (ω ↑𝑚 𝑋)
35		fveq1 5669	. . . . . . . . . . . . 13 ⊢ (𝑓 = 𝑔 → (𝑓‘𝑥) = (𝑔‘𝑥))
36	35	eqeq1d 2241	. . . . . . . . . . . 12 ⊢ (𝑓 = 𝑔 → ((𝑓‘𝑥) = 1o ↔ (𝑔‘𝑥) = 1o))
37	36	ralbidv 2542	. . . . . . . . . . 11 ⊢ (𝑓 = 𝑔 → (∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) = 1o ↔ ∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑥) = 1o))
38	35	eqeq1d 2241	. . . . . . . . . . . 12 ⊢ (𝑓 = 𝑔 → ((𝑓‘𝑥) = ∅ ↔ (𝑔‘𝑥) = ∅))
39	38	ralbidv 2542	. . . . . . . . . . 11 ⊢ (𝑓 = 𝑔 → (∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅ ↔ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑔‘𝑥) = ∅))
40	37, 39	anbi12d 473	. . . . . . . . . 10 ⊢ (𝑓 = 𝑔 → ((∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅) ↔ (∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑔‘𝑥) = ∅)))
41	40	cbvrexvw 2783	. . . . . . . . 9 ⊢ (∃𝑓 ∈ (2o ↑𝑚 𝑋)(∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅) ↔ ∃𝑔 ∈ (2o ↑𝑚 𝑋)(∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑔‘𝑥) = ∅))
42		fveqeq2 5679	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑦 → ((𝑔‘𝑥) = 1o ↔ (𝑔‘𝑦) = 1o))
43	42	cbvralvw 2782	. . . . . . . . . . . 12 ⊢ (∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑥) = 1o ↔ ∀𝑦 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑦) = 1o)
44		1n0 6665	. . . . . . . . . . . . . . . 16 ⊢ 1o ≠ ∅
45	44	neii 2414	. . . . . . . . . . . . . . 15 ⊢ ¬ 1o = ∅
46		eqeq1 2239	. . . . . . . . . . . . . . 15 ⊢ ((𝑔‘𝑦) = 1o → ((𝑔‘𝑦) = ∅ ↔ 1o = ∅))
47	45, 46	mtbiri 682	. . . . . . . . . . . . . 14 ⊢ ((𝑔‘𝑦) = 1o → ¬ (𝑔‘𝑦) = ∅)
48	47	neqned 2419	. . . . . . . . . . . . 13 ⊢ ((𝑔‘𝑦) = 1o → (𝑔‘𝑦) ≠ ∅)
49	48	ralimi 2605	. . . . . . . . . . . 12 ⊢ (∀𝑦 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑦) = 1o → ∀𝑦 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑦) ≠ ∅)
50	43, 49	sylbi 121	. . . . . . . . . . 11 ⊢ (∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑥) = 1o → ∀𝑦 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑦) ≠ ∅)
51		fveqeq2 5679	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑦 → ((𝑔‘𝑥) = ∅ ↔ (𝑔‘𝑦) = ∅))
52	51	cbvralvw 2782	. . . . . . . . . . . 12 ⊢ (∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑔‘𝑥) = ∅ ↔ ∀𝑦 ∈ (𝑋 ∖ 𝐴)(𝑔‘𝑦) = ∅)
53	52	biimpi 120	. . . . . . . . . . 11 ⊢ (∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑔‘𝑥) = ∅ → ∀𝑦 ∈ (𝑋 ∖ 𝐴)(𝑔‘𝑦) = ∅)
54	50, 53	anim12i 338	. . . . . . . . . 10 ⊢ ((∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑔‘𝑥) = ∅) → (∀𝑦 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑦) ≠ ∅ ∧ ∀𝑦 ∈ (𝑋 ∖ 𝐴)(𝑔‘𝑦) = ∅))
55	54	reximi 2639	. . . . . . . . 9 ⊢ (∃𝑔 ∈ (2o ↑𝑚 𝑋)(∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑔‘𝑥) = ∅) → ∃𝑔 ∈ (2o ↑𝑚 𝑋)(∀𝑦 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑦) ≠ ∅ ∧ ∀𝑦 ∈ (𝑋 ∖ 𝐴)(𝑔‘𝑦) = ∅))
56	41, 55	sylbi 121	. . . . . . . 8 ⊢ (∃𝑓 ∈ (2o ↑𝑚 𝑋)(∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅) → ∃𝑔 ∈ (2o ↑𝑚 𝑋)(∀𝑦 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑦) ≠ ∅ ∧ ∀𝑦 ∈ (𝑋 ∖ 𝐴)(𝑔‘𝑦) = ∅))
57		ssrexv 3303	. . . . . . . 8 ⊢ ((2o ↑𝑚 𝑋) ⊆ (ω ↑𝑚 𝑋) → (∃𝑔 ∈ (2o ↑𝑚 𝑋)(∀𝑦 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑦) ≠ ∅ ∧ ∀𝑦 ∈ (𝑋 ∖ 𝐴)(𝑔‘𝑦) = ∅) → ∃𝑔 ∈ (ω ↑𝑚 𝑋)(∀𝑦 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑦) ≠ ∅ ∧ ∀𝑦 ∈ (𝑋 ∖ 𝐴)(𝑔‘𝑦) = ∅)))
58	34, 56, 57	mpsyl 65	. . . . . . 7 ⊢ (∃𝑓 ∈ (2o ↑𝑚 𝑋)(∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅) → ∃𝑔 ∈ (ω ↑𝑚 𝑋)(∀𝑦 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑦) ≠ ∅ ∧ ∀𝑦 ∈ (𝑋 ∖ 𝐴)(𝑔‘𝑦) = ∅))
59	58	adantl 277	. . . . . 6 ⊢ ((𝜑 ∧ ∃𝑓 ∈ (2o ↑𝑚 𝑋)(∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅)) → ∃𝑔 ∈ (ω ↑𝑚 𝑋)(∀𝑦 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑦) ≠ ∅ ∧ ∀𝑦 ∈ (𝑋 ∖ 𝐴)(𝑔‘𝑦) = ∅))
60	59	bj-charfunr 16580	. . . . 5 ⊢ ((𝜑 ∧ ∃𝑓 ∈ (2o ↑𝑚 𝑋)(∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅)) → ∀𝑦 ∈ 𝑋 DECID ¬ 𝑦 ∈ 𝐴)
61	60	ex 115	. . . 4 ⊢ (𝜑 → (∃𝑓 ∈ (2o ↑𝑚 𝑋)(∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅) → ∀𝑦 ∈ 𝑋 DECID ¬ 𝑦 ∈ 𝐴))
62		eleq1w 2293	. . . . . . 7 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
63	62	notbid 673	. . . . . 6 ⊢ (𝑥 = 𝑦 → (¬ 𝑥 ∈ 𝐴 ↔ ¬ 𝑦 ∈ 𝐴))
64	63	dcbid 846	. . . . 5 ⊢ (𝑥 = 𝑦 → (DECID ¬ 𝑥 ∈ 𝐴 ↔ DECID ¬ 𝑦 ∈ 𝐴))
65	64	cbvralvw 2782	. . . 4 ⊢ (∀𝑥 ∈ 𝑋 DECID ¬ 𝑥 ∈ 𝐴 ↔ ∀𝑦 ∈ 𝑋 DECID ¬ 𝑦 ∈ 𝐴)
66	61, 65	imbitrrdi 162	. . 3 ⊢ (𝜑 → (∃𝑓 ∈ (2o ↑𝑚 𝑋)(∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅) → ∀𝑥 ∈ 𝑋 DECID ¬ 𝑥 ∈ 𝐴))
67		bj-charfunbi.st	. . . . . 6 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 STAB 𝑥 ∈ 𝐴)
68	67	r19.21bi 2630	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → STAB 𝑥 ∈ 𝐴)
69		stdcn 855	. . . . 5 ⊢ (STAB 𝑥 ∈ 𝐴 ↔ (DECID ¬ 𝑥 ∈ 𝐴 → DECID 𝑥 ∈ 𝐴))
70	68, 69	sylib 122	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (DECID ¬ 𝑥 ∈ 𝐴 → DECID 𝑥 ∈ 𝐴))
71	70	ralimdva 2609	. . 3 ⊢ (𝜑 → (∀𝑥 ∈ 𝑋 DECID ¬ 𝑥 ∈ 𝐴 → ∀𝑥 ∈ 𝑋 DECID 𝑥 ∈ 𝐴))
72	66, 71	syld 45	. 2 ⊢ (𝜑 → (∃𝑓 ∈ (2o ↑𝑚 𝑋)(∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅) → ∀𝑥 ∈ 𝑋 DECID 𝑥 ∈ 𝐴))
73	30, 72	impbid 129	1 ⊢ (𝜑 → (∀𝑥 ∈ 𝑋 DECID 𝑥 ∈ 𝐴 ↔ ∃𝑓 ∈ (2o ↑𝑚 𝑋)(∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅)))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105  STAB wstab 838  DECID wdc 842   = wceq 1398   ∈ wcel 2203   ≠ wne 2412  ∀wral 2520  ∃wrex 2521  Vcvv 2813   ∖ cdif 3208   ∩ cin 3210   ⊆ wss 3211  ∅c0 3508  ifcif 3620   ↦ cmpt 4171  Oncon0 4484  ωcom 4712  ⟶wf 5348  ‘cfv 5352  (class class class)co 6050  1_oc1o 6640  2_oc2o 6641   ↑_𝑚 cmap 6882

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-sep 4228  ax-nul 4236  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-iinf 4710

This theorem depends on definitions:  df-bi 117  df-stab 839  df-dc 843  df-3an 1007  df-tru 1401  df-fal 1404  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-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-if 3621  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-br 4110  df-opab 4172  df-mpt 4173  df-tr 4209  df-id 4414  df-iord 4487  df-on 4489  df-suc 4492  df-iom 4713  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-fv 5360  df-ov 6053  df-oprab 6054  df-mpo 6055  df-1o 6647  df-2o 6648  df-map 6884

This theorem is referenced by: (None)