Theorem bj-charfunr 17002

Description: If a class 𝐴 has a "weak" characteristic function on a class 𝑋, then negated membership in 𝐴 is decidable (in other words, membership in 𝐴 is testable) in 𝑋.

The hypothesis imposes that 𝑋 be a set. As usual, it could be formulated as ⊢ (𝜑 → (𝐹:𝑋⟶ω ∧ ...)) to deal with general classes, but that extra generality would not make the theorem much more useful.

The theorem would still hold if the codomain of 𝑓 were any class with testable equality to the point where (𝑋 ∖ 𝐴) is sent. (Contributed by BJ, 6-Aug-2024.)

Hypothesis

Ref	Expression
bj-charfunr.1	⊢ (𝜑 → ∃𝑓 ∈ (ω ↑𝑚 𝑋)(∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) ≠ ∅ ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅))

Assertion

Ref	Expression
bj-charfunr	⊢ (𝜑 → ∀𝑥 ∈ 𝑋 DECID ¬ 𝑥 ∈ 𝐴)

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

Allowed substitution hints:   𝐴(𝑥)   𝑋(𝑥)

Proof of Theorem bj-charfunr

Step	Hyp	Ref	Expression
1		bj-charfunr.1	. . . . 5 ⊢ (𝜑 → ∃𝑓 ∈ (ω ↑𝑚 𝑋)(∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) ≠ ∅ ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅))
2		elmapi 6944	. . . . . . . . . 10 ⊢ (𝑓 ∈ (ω ↑𝑚 𝑋) → 𝑓:𝑋⟶ω)
3		ffvelcdm 5841	. . . . . . . . . . 11 ⊢ ((𝑓:𝑋⟶ω ∧ 𝑥 ∈ 𝑋) → (𝑓‘𝑥) ∈ ω)
4	3	ex 115	. . . . . . . . . 10 ⊢ (𝑓:𝑋⟶ω → (𝑥 ∈ 𝑋 → (𝑓‘𝑥) ∈ ω))
5	2, 4	syl 14	. . . . . . . . 9 ⊢ (𝑓 ∈ (ω ↑𝑚 𝑋) → (𝑥 ∈ 𝑋 → (𝑓‘𝑥) ∈ ω))
6		0elnn 4766	. . . . . . . . . 10 ⊢ ((𝑓‘𝑥) ∈ ω → ((𝑓‘𝑥) = ∅ ∨ ∅ ∈ (𝑓‘𝑥)))
7		nn0eln0 4767	. . . . . . . . . . 11 ⊢ ((𝑓‘𝑥) ∈ ω → (∅ ∈ (𝑓‘𝑥) ↔ (𝑓‘𝑥) ≠ ∅))
8	7	orbi2d 802	. . . . . . . . . 10 ⊢ ((𝑓‘𝑥) ∈ ω → (((𝑓‘𝑥) = ∅ ∨ ∅ ∈ (𝑓‘𝑥)) ↔ ((𝑓‘𝑥) = ∅ ∨ (𝑓‘𝑥) ≠ ∅)))
9	6, 8	mpbid 147	. . . . . . . . 9 ⊢ ((𝑓‘𝑥) ∈ ω → ((𝑓‘𝑥) = ∅ ∨ (𝑓‘𝑥) ≠ ∅))
10	5, 9	syl6 33	. . . . . . . 8 ⊢ (𝑓 ∈ (ω ↑𝑚 𝑋) → (𝑥 ∈ 𝑋 → ((𝑓‘𝑥) = ∅ ∨ (𝑓‘𝑥) ≠ ∅)))
11	10	adantr 276	. . . . . . 7 ⊢ ((𝑓 ∈ (ω ↑𝑚 𝑋) ∧ (∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) ≠ ∅ ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅)) → (𝑥 ∈ 𝑋 → ((𝑓‘𝑥) = ∅ ∨ (𝑓‘𝑥) ≠ ∅)))
12		elin 3412	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ (𝑋 ∩ 𝐴) ↔ (𝑥 ∈ 𝑋 ∧ 𝑥 ∈ 𝐴))
13		rsp 2597	. . . . . . . . . . . . . . 15 ⊢ (∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) ≠ ∅ → (𝑥 ∈ (𝑋 ∩ 𝐴) → (𝑓‘𝑥) ≠ ∅))
14	12, 13	biimtrrid 153	. . . . . . . . . . . . . 14 ⊢ (∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) ≠ ∅ → ((𝑥 ∈ 𝑋 ∧ 𝑥 ∈ 𝐴) → (𝑓‘𝑥) ≠ ∅))
15	14	expd 258	. . . . . . . . . . . . 13 ⊢ (∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) ≠ ∅ → (𝑥 ∈ 𝑋 → (𝑥 ∈ 𝐴 → (𝑓‘𝑥) ≠ ∅)))
16	15	adantr 276	. . . . . . . . . . . 12 ⊢ ((∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) ≠ ∅ ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅) → (𝑥 ∈ 𝑋 → (𝑥 ∈ 𝐴 → (𝑓‘𝑥) ≠ ∅)))
17	16	imp 124	. . . . . . . . . . 11 ⊢ (((∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) ≠ ∅ ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅) ∧ 𝑥 ∈ 𝑋) → (𝑥 ∈ 𝐴 → (𝑓‘𝑥) ≠ ∅))
18	17	necon2bd 2478	. . . . . . . . . 10 ⊢ (((∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) ≠ ∅ ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅) ∧ 𝑥 ∈ 𝑋) → ((𝑓‘𝑥) = ∅ → ¬ 𝑥 ∈ 𝐴))
19		eldif 3229	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ (𝑋 ∖ 𝐴) ↔ (𝑥 ∈ 𝑋 ∧ ¬ 𝑥 ∈ 𝐴))
20		rsp 2597	. . . . . . . . . . . . . . 15 ⊢ (∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅ → (𝑥 ∈ (𝑋 ∖ 𝐴) → (𝑓‘𝑥) = ∅))
21	19, 20	biimtrrid 153	. . . . . . . . . . . . . 14 ⊢ (∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅ → ((𝑥 ∈ 𝑋 ∧ ¬ 𝑥 ∈ 𝐴) → (𝑓‘𝑥) = ∅))
22	21	expd 258	. . . . . . . . . . . . 13 ⊢ (∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅ → (𝑥 ∈ 𝑋 → (¬ 𝑥 ∈ 𝐴 → (𝑓‘𝑥) = ∅)))
23	22	adantl 277	. . . . . . . . . . . 12 ⊢ ((∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) ≠ ∅ ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅) → (𝑥 ∈ 𝑋 → (¬ 𝑥 ∈ 𝐴 → (𝑓‘𝑥) = ∅)))
24	23	imp 124	. . . . . . . . . . 11 ⊢ (((∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) ≠ ∅ ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅) ∧ 𝑥 ∈ 𝑋) → (¬ 𝑥 ∈ 𝐴 → (𝑓‘𝑥) = ∅))
25	24	necon3ad 2462	. . . . . . . . . 10 ⊢ (((∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) ≠ ∅ ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅) ∧ 𝑥 ∈ 𝑋) → ((𝑓‘𝑥) ≠ ∅ → ¬ ¬ 𝑥 ∈ 𝐴))
26	18, 25	orim12d 798	. . . . . . . . 9 ⊢ (((∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) ≠ ∅ ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅) ∧ 𝑥 ∈ 𝑋) → (((𝑓‘𝑥) = ∅ ∨ (𝑓‘𝑥) ≠ ∅) → (¬ 𝑥 ∈ 𝐴 ∨ ¬ ¬ 𝑥 ∈ 𝐴)))
27	26	ex 115	. . . . . . . 8 ⊢ ((∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) ≠ ∅ ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅) → (𝑥 ∈ 𝑋 → (((𝑓‘𝑥) = ∅ ∨ (𝑓‘𝑥) ≠ ∅) → (¬ 𝑥 ∈ 𝐴 ∨ ¬ ¬ 𝑥 ∈ 𝐴))))
28	27	adantl 277	. . . . . . 7 ⊢ ((𝑓 ∈ (ω ↑𝑚 𝑋) ∧ (∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) ≠ ∅ ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅)) → (𝑥 ∈ 𝑋 → (((𝑓‘𝑥) = ∅ ∨ (𝑓‘𝑥) ≠ ∅) → (¬ 𝑥 ∈ 𝐴 ∨ ¬ ¬ 𝑥 ∈ 𝐴))))
29	11, 28	mpdd 41	. . . . . 6 ⊢ ((𝑓 ∈ (ω ↑𝑚 𝑋) ∧ (∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) ≠ ∅ ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅)) → (𝑥 ∈ 𝑋 → (¬ 𝑥 ∈ 𝐴 ∨ ¬ ¬ 𝑥 ∈ 𝐴)))
30	29	adantl 277	. . . . 5 ⊢ ((𝜑 ∧ (𝑓 ∈ (ω ↑𝑚 𝑋) ∧ (∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝑓‘𝑥) ≠ ∅ ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝑓‘𝑥) = ∅))) → (𝑥 ∈ 𝑋 → (¬ 𝑥 ∈ 𝐴 ∨ ¬ ¬ 𝑥 ∈ 𝐴)))
31	1, 30	rexlimddv 2673	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝑋 → (¬ 𝑥 ∈ 𝐴 ∨ ¬ ¬ 𝑥 ∈ 𝐴)))
32	31	imp 124	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (¬ 𝑥 ∈ 𝐴 ∨ ¬ ¬ 𝑥 ∈ 𝐴))
33		df-dc 847	. . 3 ⊢ (DECID ¬ 𝑥 ∈ 𝐴 ↔ (¬ 𝑥 ∈ 𝐴 ∨ ¬ ¬ 𝑥 ∈ 𝐴))
34	32, 33	sylibr 134	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → DECID ¬ 𝑥 ∈ 𝐴)
35	34	ralrimiva 2623	1 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 DECID ¬ 𝑥 ∈ 𝐴)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 104   ∨ wo 720  DECID wdc 846   = wceq 1402   ∈ wcel 2209   ≠ wne 2420  ∀wral 2528  ∃wrex 2529   ∖ cdif 3217   ∩ cin 3219  ∅c0 3520  ωcom 4737  ⟶wf 5373  ‘cfv 5377  (class class class)co 6085   ↑_𝑚 cmap 6922

This proof depends on 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 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735

This proof depends on definitions:  df-bi 117  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-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-id 4438  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-map 6924

This theorem is used by:  bj-charfunbi  17003