Theorem bj-charfunbi 16751

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 2299	. . . . 5 ⊢ (𝑥 = 𝑧 → (𝑥 ∈ 𝐴 ↔ 𝑧 ∈ 𝐴))
2	1	dcbid 850	. . . 4 ⊢ (𝑥 = 𝑧 → (DECID 𝑥 ∈ 𝐴 ↔ DECID 𝑧 ∈ 𝐴))
3	2	cbvralvw 2790	. . 3 ⊢ (∀𝑥 ∈ 𝑋 DECID 𝑥 ∈ 𝐴 ↔ ∀𝑧 ∈ 𝑋 DECID 𝑧 ∈ 𝐴)
4		eleq1w 2299	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑥 → (𝑧 ∈ 𝐴 ↔ 𝑥 ∈ 𝐴))
5	4	ifbid 3659	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑥 → if(𝑧 ∈ 𝐴, 1o, ∅) = if(𝑥 ∈ 𝐴, 1o, ∅))
6	5	cbvmptv 4222	. . . . . . . . . 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 16748	. . . . . . . 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 6686	. . . . . . . . . . 11 ⊢ 2o ∈ On
13	12	a1i 9	. . . . . . . . . 10 ⊢ (𝜑 → 2o ∈ On)
14		bj-charfunbi.ex	. . . . . . . . . 10 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
15	13, 14	elmapd 6926	. . . . . . . . 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 5689	. . . . . . . . 9 ⊢ (𝑓 = (𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅)) → (𝑓‘𝑥) = ((𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅))‘𝑥))
21	20	eqeq1d 2247	. . . . . . . 8 ⊢ (𝑓 = (𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅)) → ((𝑓‘𝑥) = 1o ↔ ((𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅))‘𝑥) = 1o))
22	21	ralbidv 2550	. . . . . . 7 ⊢ (𝑓 = (𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅)) → (∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) = 1o ↔ ∀𝑥 ∈ (𝑋 ∩ 𝐴)((𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅))‘𝑥) = 1o))
23	20	eqeq1d 2247	. . . . . . . 8 ⊢ (𝑓 = (𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅)) → ((𝑓‘𝑥) = ∅ ↔ ((𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅))‘𝑥) = ∅))
24	23	ralbidv 2550	. . . . . . 7 ⊢ (𝑓 = (𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅)) → (∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅ ↔ ∀𝑥 ∈ (𝑋 ∖ 𝐴)((𝑧 ∈ 𝑋 ↦ if(𝑧 ∈ 𝐴, 1o, ∅))‘𝑥) = ∅))
25	22, 24	anbi12d 477	. . . . . 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 2935	. . . 4 ⊢ ((𝜑 ∧ ∀𝑧 ∈ 𝑋 DECID 𝑧 ∈ 𝐴) → ∃𝑓 ∈ (2o ↑𝑚 𝑋)(∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅))
29	28	ex 115	. . 3 ⊢ (𝜑 → (∀𝑧 ∈ 𝑋 DECID 𝑧 ∈ 𝐴 → ∃𝑓 ∈ (2o ↑𝑚 𝑋)(∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅)))
30	3, 29	biimtrid 152	. 2 ⊢ (𝜑 → (∀𝑥 ∈ 𝑋 DECID 𝑥 ∈ 𝐴 → ∃𝑓 ∈ (2o ↑𝑚 𝑋)(∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅)))
31		omex 4735	. . . . . . . . 9 ⊢ ω ∈ V
32		2ssom 6787	. . . . . . . . 9 ⊢ 2o ⊆ ω
33		mapss 6963	. . . . . . . . 9 ⊢ ((ω ∈ V ∧ 2o ⊆ ω) → (2o ↑𝑚 𝑋) ⊆ (ω ↑𝑚 𝑋))
34	31, 32, 33	mp2an 430	. . . . . . . 8 ⊢ (2o ↑𝑚 𝑋) ⊆ (ω ↑𝑚 𝑋)
35		fveq1 5689	. . . . . . . . . . . . 13 ⊢ (𝑓 = 𝑔 → (𝑓‘𝑥) = (𝑔‘𝑥))
36	35	eqeq1d 2247	. . . . . . . . . . . 12 ⊢ (𝑓 = 𝑔 → ((𝑓‘𝑥) = 1o ↔ (𝑔‘𝑥) = 1o))
37	36	ralbidv 2550	. . . . . . . . . . 11 ⊢ (𝑓 = 𝑔 → (∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) = 1o ↔ ∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑥) = 1o))
38	35	eqeq1d 2247	. . . . . . . . . . . 12 ⊢ (𝑓 = 𝑔 → ((𝑓‘𝑥) = ∅ ↔ (𝑔‘𝑥) = ∅))
39	38	ralbidv 2550	. . . . . . . . . . 11 ⊢ (𝑓 = 𝑔 → (∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅ ↔ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑔‘𝑥) = ∅))
40	37, 39	anbi12d 477	. . . . . . . . . 10 ⊢ (𝑓 = 𝑔 → ((∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅) ↔ (∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑔‘𝑥) = ∅)))
41	40	cbvrexvw 2791	. . . . . . . . 9 ⊢ (∃𝑓 ∈ (2o ↑𝑚 𝑋)(∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅) ↔ ∃𝑔 ∈ (2o ↑𝑚 𝑋)(∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑔‘𝑥) = ∅))
42		fveqeq2 5699	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑦 → ((𝑔‘𝑥) = 1o ↔ (𝑔‘𝑦) = 1o))
43	42	cbvralvw 2790	. . . . . . . . . . . 12 ⊢ (∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑥) = 1o ↔ ∀𝑦 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑦) = 1o)
44		1n0 6695	. . . . . . . . . . . . . . . 16 ⊢ 1o ≠ ∅
45	44	neii 2422	. . . . . . . . . . . . . . 15 ⊢ ¬ 1o = ∅
46		eqeq1 2245	. . . . . . . . . . . . . . 15 ⊢ ((𝑔‘𝑦) = 1o → ((𝑔‘𝑦) = ∅ ↔ 1o = ∅))
47	45, 46	mtbiri 686	. . . . . . . . . . . . . 14 ⊢ ((𝑔‘𝑦) = 1o → ¬ (𝑔‘𝑦) = ∅)
48	47	neqned 2427	. . . . . . . . . . . . 13 ⊢ ((𝑔‘𝑦) = 1o → (𝑔‘𝑦) ≠ ∅)
49	48	ralimi 2613	. . . . . . . . . . . 12 ⊢ (∀𝑦 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑦) = 1o → ∀𝑦 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑦) ≠ ∅)
50	43, 49	sylbi 121	. . . . . . . . . . 11 ⊢ (∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑥) = 1o → ∀𝑦 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑦) ≠ ∅)
51		fveqeq2 5699	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑦 → ((𝑔‘𝑥) = ∅ ↔ (𝑔‘𝑦) = ∅))
52	51	cbvralvw 2790	. . . . . . . . . . . 12 ⊢ (∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑔‘𝑥) = ∅ ↔ ∀𝑦 ∈ (𝑋 ∖ 𝐴)(𝑔‘𝑦) = ∅)
53	52	biimpi 120	. . . . . . . . . . 11 ⊢ (∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑔‘𝑥) = ∅ → ∀𝑦 ∈ (𝑋 ∖ 𝐴)(𝑔‘𝑦) = ∅)
54	50, 53	anim12i 338	. . . . . . . . . 10 ⊢ ((∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑔‘𝑥) = ∅) → (∀𝑦 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑦) ≠ ∅ ∧ ∀𝑦 ∈ (𝑋 ∖ 𝐴)(𝑔‘𝑦) = ∅))
55	54	reximi 2647	. . . . . . . . 9 ⊢ (∃𝑔 ∈ (2o ↑𝑚 𝑋)(∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑔‘𝑥) = ∅) → ∃𝑔 ∈ (2o ↑𝑚 𝑋)(∀𝑦 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑦) ≠ ∅ ∧ ∀𝑦 ∈ (𝑋 ∖ 𝐴)(𝑔‘𝑦) = ∅))
56	41, 55	sylbi 121	. . . . . . . 8 ⊢ (∃𝑓 ∈ (2o ↑𝑚 𝑋)(∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅) → ∃𝑔 ∈ (2o ↑𝑚 𝑋)(∀𝑦 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑦) ≠ ∅ ∧ ∀𝑦 ∈ (𝑋 ∖ 𝐴)(𝑔‘𝑦) = ∅))
57		ssrexv 3313	. . . . . . . 8 ⊢ ((2o ↑𝑚 𝑋) ⊆ (ω ↑𝑚 𝑋) → (∃𝑔 ∈ (2o ↑𝑚 𝑋)(∀𝑦 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑦) ≠ ∅ ∧ ∀𝑦 ∈ (𝑋 ∖ 𝐴)(𝑔‘𝑦) = ∅) → ∃𝑔 ∈ (ω ↑𝑚 𝑋)(∀𝑦 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑦) ≠ ∅ ∧ ∀𝑦 ∈ (𝑋 ∖ 𝐴)(𝑔‘𝑦) = ∅)))
58	34, 56, 57	mpsyl 65	. . . . . . 7 ⊢ (∃𝑓 ∈ (2o ↑𝑚 𝑋)(∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅) → ∃𝑔 ∈ (ω ↑𝑚 𝑋)(∀𝑦 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑦) ≠ ∅ ∧ ∀𝑦 ∈ (𝑋 ∖ 𝐴)(𝑔‘𝑦) = ∅))
59	58	adantl 277	. . . . . 6 ⊢ ((𝜑 ∧ ∃𝑓 ∈ (2o ↑𝑚 𝑋)(∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅)) → ∃𝑔 ∈ (ω ↑𝑚 𝑋)(∀𝑦 ∈ (𝑋 ∩ 𝐴)(𝑔‘𝑦) ≠ ∅ ∧ ∀𝑦 ∈ (𝑋 ∖ 𝐴)(𝑔‘𝑦) = ∅))
60	59	bj-charfunr 16750	. . . . 5 ⊢ ((𝜑 ∧ ∃𝑓 ∈ (2o ↑𝑚 𝑋)(∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅)) → ∀𝑦 ∈ 𝑋 DECID ¬ 𝑦 ∈ 𝐴)
61	60	ex 115	. . . 4 ⊢ (𝜑 → (∃𝑓 ∈ (2o ↑𝑚 𝑋)(∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅) → ∀𝑦 ∈ 𝑋 DECID ¬ 𝑦 ∈ 𝐴))
62		eleq1w 2299	. . . . . . 7 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
63	62	notbid 677	. . . . . 6 ⊢ (𝑥 = 𝑦 → (¬ 𝑥 ∈ 𝐴 ↔ ¬ 𝑦 ∈ 𝐴))
64	63	dcbid 850	. . . . 5 ⊢ (𝑥 = 𝑦 → (DECID ¬ 𝑥 ∈ 𝐴 ↔ DECID ¬ 𝑦 ∈ 𝐴))
65	64	cbvralvw 2790	. . . 4 ⊢ (∀𝑥 ∈ 𝑋 DECID ¬ 𝑥 ∈ 𝐴 ↔ ∀𝑦 ∈ 𝑋 DECID ¬ 𝑦 ∈ 𝐴)
66	61, 65	imbitrrdi 162	. . 3 ⊢ (𝜑 → (∃𝑓 ∈ (2o ↑𝑚 𝑋)(∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅) → ∀𝑥 ∈ 𝑋 DECID ¬ 𝑥 ∈ 𝐴))
67		bj-charfunbi.st	. . . . . 6 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 STAB 𝑥 ∈ 𝐴)
68	67	r19.21bi 2638	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → STAB 𝑥 ∈ 𝐴)
69		stdcn 859	. . . . 5 ⊢ (STAB 𝑥 ∈ 𝐴 ↔ (DECID ¬ 𝑥 ∈ 𝐴 → DECID 𝑥 ∈ 𝐴))
70	68, 69	sylib 122	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (DECID ¬ 𝑥 ∈ 𝐴 → DECID 𝑥 ∈ 𝐴))
71	70	ralimdva 2617	. . 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 842  DECID wdc 846   = wceq 1402   ∈ wcel 2209   ≠ wne 2420  ∀wral 2528  ∃wrex 2529  Vcvv 2821   ∖ cdif 3217   ∩ cin 3219   ⊆ wss 3220  ∅c0 3520  ifcif 3635   ↦ cmpt 4187  Oncon0 4503  ωcom 4732  ⟶wf 5368  ‘cfv 5372  (class class class)co 6075  1_oc1o 6670  2_oc2o 6671   ↑_𝑚 cmap 6912

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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-iinf 4730

This theorem depends on definitions:  df-bi 117  df-stab 843  df-dc 847  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3636  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-id 4433  df-iord 4506  df-on 4508  df-suc 4511  df-iom 4733  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-fv 5380  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1o 6677  df-2o 6678  df-map 6914

This theorem is referenced by: (None)