![]() |
Mathbox for BJ |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > Mathboxes > bj-charfundc | GIF version |
Description: Properties of the characteristic function on the class 𝑋 of the class 𝐴, provided membership in 𝐴 is decidable in 𝑋. (Contributed by BJ, 6-Aug-2024.) |
Ref | Expression |
---|---|
bj-charfundc.1 | ⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝑋 ↦ if(𝑥 ∈ 𝐴, 1o, ∅))) |
bj-charfundc.dc | ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 DECID 𝑥 ∈ 𝐴) |
Ref | Expression |
---|---|
bj-charfundc | ⊢ (𝜑 → (𝐹:𝑋⟶2o ∧ (∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝐹‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝐹‘𝑥) = ∅))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bj-charfundc.1 | . . 3 ⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝑋 ↦ if(𝑥 ∈ 𝐴, 1o, ∅))) | |
2 | 1lt2o 6445 | . . . . 5 ⊢ 1o ∈ 2o | |
3 | 2 | a1i 9 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 1o ∈ 2o) |
4 | 0lt2o 6444 | . . . . 5 ⊢ ∅ ∈ 2o | |
5 | 4 | a1i 9 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ∅ ∈ 2o) |
6 | bj-charfundc.dc | . . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 DECID 𝑥 ∈ 𝐴) | |
7 | 6 | r19.21bi 2565 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → DECID 𝑥 ∈ 𝐴) |
8 | 3, 5, 7 | ifcldcd 3572 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → if(𝑥 ∈ 𝐴, 1o, ∅) ∈ 2o) |
9 | 1, 8 | fmpt3d 5674 | . 2 ⊢ (𝜑 → 𝐹:𝑋⟶2o) |
10 | inss1 3357 | . . . . . . . 8 ⊢ (𝑋 ∩ 𝐴) ⊆ 𝑋 | |
11 | 10 | a1i 9 | . . . . . . 7 ⊢ (𝜑 → (𝑋 ∩ 𝐴) ⊆ 𝑋) |
12 | 11 | sseld 3156 | . . . . . 6 ⊢ (𝜑 → (𝑥 ∈ (𝑋 ∩ 𝐴) → 𝑥 ∈ 𝑋)) |
13 | 12 | imdistani 445 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋 ∩ 𝐴)) → (𝜑 ∧ 𝑥 ∈ 𝑋)) |
14 | 1, 8 | fvmpt2d 5604 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐹‘𝑥) = if(𝑥 ∈ 𝐴, 1o, ∅)) |
15 | 13, 14 | syl 14 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋 ∩ 𝐴)) → (𝐹‘𝑥) = if(𝑥 ∈ 𝐴, 1o, ∅)) |
16 | simpr 110 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋 ∩ 𝐴)) → 𝑥 ∈ (𝑋 ∩ 𝐴)) | |
17 | 16 | elin2d 3327 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋 ∩ 𝐴)) → 𝑥 ∈ 𝐴) |
18 | 17 | iftrued 3543 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋 ∩ 𝐴)) → if(𝑥 ∈ 𝐴, 1o, ∅) = 1o) |
19 | 15, 18 | eqtrd 2210 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋 ∩ 𝐴)) → (𝐹‘𝑥) = 1o) |
20 | 19 | ralrimiva 2550 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝐹‘𝑥) = 1o) |
21 | difssd 3264 | . . . . . . 7 ⊢ (𝜑 → (𝑋 ∖ 𝐴) ⊆ 𝑋) | |
22 | 21 | sseld 3156 | . . . . . 6 ⊢ (𝜑 → (𝑥 ∈ (𝑋 ∖ 𝐴) → 𝑥 ∈ 𝑋)) |
23 | 22 | imdistani 445 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋 ∖ 𝐴)) → (𝜑 ∧ 𝑥 ∈ 𝑋)) |
24 | 23, 14 | syl 14 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋 ∖ 𝐴)) → (𝐹‘𝑥) = if(𝑥 ∈ 𝐴, 1o, ∅)) |
25 | simpr 110 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋 ∖ 𝐴)) → 𝑥 ∈ (𝑋 ∖ 𝐴)) | |
26 | 25 | eldifbd 3143 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋 ∖ 𝐴)) → ¬ 𝑥 ∈ 𝐴) |
27 | 26 | iffalsed 3546 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋 ∖ 𝐴)) → if(𝑥 ∈ 𝐴, 1o, ∅) = ∅) |
28 | 24, 27 | eqtrd 2210 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋 ∖ 𝐴)) → (𝐹‘𝑥) = ∅) |
29 | 28 | ralrimiva 2550 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝐹‘𝑥) = ∅) |
30 | 9, 20, 29 | jca32 310 | 1 ⊢ (𝜑 → (𝐹:𝑋⟶2o ∧ (∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝐹‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝐹‘𝑥) = ∅))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 DECID wdc 834 = wceq 1353 ∈ wcel 2148 ∀wral 2455 ∖ cdif 3128 ∩ cin 3130 ⊆ wss 3131 ∅c0 3424 ifcif 3536 ↦ cmpt 4066 ⟶wf 5214 ‘cfv 5218 1oc1o 6412 2oc2o 6413 |
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 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-sep 4123 ax-nul 4131 ax-pow 4176 ax-pr 4211 ax-un 4435 |
This theorem depends on definitions: df-bi 117 df-dc 835 df-3an 980 df-tru 1356 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ral 2460 df-rex 2461 df-rab 2464 df-v 2741 df-sbc 2965 df-csb 3060 df-dif 3133 df-un 3135 df-in 3137 df-ss 3144 df-nul 3425 df-if 3537 df-pw 3579 df-sn 3600 df-pr 3601 df-op 3603 df-uni 3812 df-br 4006 df-opab 4067 df-mpt 4068 df-tr 4104 df-id 4295 df-iord 4368 df-on 4370 df-suc 4373 df-xp 4634 df-rel 4635 df-cnv 4636 df-co 4637 df-dm 4638 df-rn 4639 df-res 4640 df-ima 4641 df-iota 5180 df-fun 5220 df-fn 5221 df-f 5222 df-fv 5226 df-1o 6419 df-2o 6420 |
This theorem is referenced by: bj-charfunbi 14648 |
Copyright terms: Public domain | W3C validator |