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 6421 | . . . . 5 ⊢ 1o ∈ 2o | |
3 | 2 | a1i 9 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 1o ∈ 2o) |
4 | 0lt2o 6420 | . . . . 5 ⊢ ∅ ∈ 2o | |
5 | 4 | a1i 9 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ∅ ∈ 2o) |
6 | bj-charfundc.dc | . . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 DECID 𝑥 ∈ 𝐴) | |
7 | 6 | r19.21bi 2558 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → DECID 𝑥 ∈ 𝐴) |
8 | 3, 5, 7 | ifcldcd 3561 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → if(𝑥 ∈ 𝐴, 1o, ∅) ∈ 2o) |
9 | 1, 8 | fmpt3d 5652 | . 2 ⊢ (𝜑 → 𝐹:𝑋⟶2o) |
10 | inss1 3347 | . . . . . . . 8 ⊢ (𝑋 ∩ 𝐴) ⊆ 𝑋 | |
11 | 10 | a1i 9 | . . . . . . 7 ⊢ (𝜑 → (𝑋 ∩ 𝐴) ⊆ 𝑋) |
12 | 11 | sseld 3146 | . . . . . 6 ⊢ (𝜑 → (𝑥 ∈ (𝑋 ∩ 𝐴) → 𝑥 ∈ 𝑋)) |
13 | 12 | imdistani 443 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋 ∩ 𝐴)) → (𝜑 ∧ 𝑥 ∈ 𝑋)) |
14 | 1, 8 | fvmpt2d 5582 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝐹‘𝑥) = if(𝑥 ∈ 𝐴, 1o, ∅)) |
15 | 13, 14 | syl 14 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋 ∩ 𝐴)) → (𝐹‘𝑥) = if(𝑥 ∈ 𝐴, 1o, ∅)) |
16 | simpr 109 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋 ∩ 𝐴)) → 𝑥 ∈ (𝑋 ∩ 𝐴)) | |
17 | 16 | elin2d 3317 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋 ∩ 𝐴)) → 𝑥 ∈ 𝐴) |
18 | 17 | iftrued 3533 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋 ∩ 𝐴)) → if(𝑥 ∈ 𝐴, 1o, ∅) = 1o) |
19 | 15, 18 | eqtrd 2203 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋 ∩ 𝐴)) → (𝐹‘𝑥) = 1o) |
20 | 19 | ralrimiva 2543 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝐹‘𝑥) = 1o) |
21 | difssd 3254 | . . . . . . 7 ⊢ (𝜑 → (𝑋 ∖ 𝐴) ⊆ 𝑋) | |
22 | 21 | sseld 3146 | . . . . . 6 ⊢ (𝜑 → (𝑥 ∈ (𝑋 ∖ 𝐴) → 𝑥 ∈ 𝑋)) |
23 | 22 | imdistani 443 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋 ∖ 𝐴)) → (𝜑 ∧ 𝑥 ∈ 𝑋)) |
24 | 23, 14 | syl 14 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋 ∖ 𝐴)) → (𝐹‘𝑥) = if(𝑥 ∈ 𝐴, 1o, ∅)) |
25 | simpr 109 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋 ∖ 𝐴)) → 𝑥 ∈ (𝑋 ∖ 𝐴)) | |
26 | 25 | eldifbd 3133 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋 ∖ 𝐴)) → ¬ 𝑥 ∈ 𝐴) |
27 | 26 | iffalsed 3536 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋 ∖ 𝐴)) → if(𝑥 ∈ 𝐴, 1o, ∅) = ∅) |
28 | 24, 27 | eqtrd 2203 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑋 ∖ 𝐴)) → (𝐹‘𝑥) = ∅) |
29 | 28 | ralrimiva 2543 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝐹‘𝑥) = ∅) |
30 | 9, 20, 29 | jca32 308 | 1 ⊢ (𝜑 → (𝐹:𝑋⟶2o ∧ (∀𝑥 ∈ (𝑋 ∩ 𝐴)(𝐹‘𝑥) = 1o ∧ ∀𝑥 ∈ (𝑋 ∖ 𝐴)(𝐹‘𝑥) = ∅))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 DECID wdc 829 = wceq 1348 ∈ wcel 2141 ∀wral 2448 ∖ cdif 3118 ∩ cin 3120 ⊆ wss 3121 ∅c0 3414 ifcif 3526 ↦ cmpt 4050 ⟶wf 5194 ‘cfv 5198 1oc1o 6388 2oc2o 6389 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 609 ax-in2 610 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-13 2143 ax-14 2144 ax-ext 2152 ax-sep 4107 ax-nul 4115 ax-pow 4160 ax-pr 4194 ax-un 4418 |
This theorem depends on definitions: df-bi 116 df-dc 830 df-3an 975 df-tru 1351 df-nf 1454 df-sb 1756 df-eu 2022 df-mo 2023 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ral 2453 df-rex 2454 df-rab 2457 df-v 2732 df-sbc 2956 df-csb 3050 df-dif 3123 df-un 3125 df-in 3127 df-ss 3134 df-nul 3415 df-if 3527 df-pw 3568 df-sn 3589 df-pr 3590 df-op 3592 df-uni 3797 df-br 3990 df-opab 4051 df-mpt 4052 df-tr 4088 df-id 4278 df-iord 4351 df-on 4353 df-suc 4356 df-xp 4617 df-rel 4618 df-cnv 4619 df-co 4620 df-dm 4621 df-rn 4622 df-res 4623 df-ima 4624 df-iota 5160 df-fun 5200 df-fn 5201 df-f 5202 df-fv 5206 df-1o 6395 df-2o 6396 |
This theorem is referenced by: bj-charfunbi 13846 |
Copyright terms: Public domain | W3C validator |