| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > psrbagconcl | GIF version | ||
| Description: The complement of a bag is a bag. (Contributed by Mario Carneiro, 29-Dec-2014.) Remove a sethood antecedent. (Revised by SN, 6-Aug-2024.) |
| Ref | Expression |
|---|---|
| psrbag.d | ⊢ 𝐷 = {𝑓 ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} |
| psrbagconf1o.s | ⊢ 𝑆 = {𝑦 ∈ 𝐷 ∣ 𝑦 ∘𝑟 ≤ 𝐹} |
| Ref | Expression |
|---|---|
| psrbagconcl | ⊢ ((𝐹 ∈ 𝐷 ∧ 𝑋 ∈ 𝑆) → (𝐹 ∘𝑓 − 𝑋) ∈ 𝑆) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 109 | . . 3 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝑋 ∈ 𝑆) → 𝐹 ∈ 𝐷) | |
| 2 | simpr 110 | . . . . . 6 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝑋 ∈ 𝑆) → 𝑋 ∈ 𝑆) | |
| 3 | breq1 4131 | . . . . . . 7 ⊢ (𝑦 = 𝑋 → (𝑦 ∘𝑟 ≤ 𝐹 ↔ 𝑋 ∘𝑟 ≤ 𝐹)) | |
| 4 | psrbagconf1o.s | . . . . . . 7 ⊢ 𝑆 = {𝑦 ∈ 𝐷 ∣ 𝑦 ∘𝑟 ≤ 𝐹} | |
| 5 | 3, 4 | elrab2 2985 | . . . . . 6 ⊢ (𝑋 ∈ 𝑆 ↔ (𝑋 ∈ 𝐷 ∧ 𝑋 ∘𝑟 ≤ 𝐹)) |
| 6 | 2, 5 | sylib 122 | . . . . 5 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝑋 ∈ 𝑆) → (𝑋 ∈ 𝐷 ∧ 𝑋 ∘𝑟 ≤ 𝐹)) |
| 7 | 6 | simpld 112 | . . . 4 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝑋 ∈ 𝑆) → 𝑋 ∈ 𝐷) |
| 8 | psrbag.d | . . . . 5 ⊢ 𝐷 = {𝑓 ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin} | |
| 9 | 8 | psrbagf 14980 | . . . 4 ⊢ (𝑋 ∈ 𝐷 → 𝑋:𝐼⟶ℕ0) |
| 10 | 7, 9 | syl 14 | . . 3 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝑋 ∈ 𝑆) → 𝑋:𝐼⟶ℕ0) |
| 11 | 6 | simprd 114 | . . 3 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝑋 ∈ 𝑆) → 𝑋 ∘𝑟 ≤ 𝐹) |
| 12 | 8 | psrbagcon 14988 | . . 3 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝑋:𝐼⟶ℕ0 ∧ 𝑋 ∘𝑟 ≤ 𝐹) → ((𝐹 ∘𝑓 − 𝑋) ∈ 𝐷 ∧ (𝐹 ∘𝑓 − 𝑋) ∘𝑟 ≤ 𝐹)) |
| 13 | 1, 10, 11, 12 | syl3anc 1278 | . 2 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝑋 ∈ 𝑆) → ((𝐹 ∘𝑓 − 𝑋) ∈ 𝐷 ∧ (𝐹 ∘𝑓 − 𝑋) ∘𝑟 ≤ 𝐹)) |
| 14 | breq1 4131 | . . 3 ⊢ (𝑦 = (𝐹 ∘𝑓 − 𝑋) → (𝑦 ∘𝑟 ≤ 𝐹 ↔ (𝐹 ∘𝑓 − 𝑋) ∘𝑟 ≤ 𝐹)) | |
| 15 | 14, 4 | elrab2 2985 | . 2 ⊢ ((𝐹 ∘𝑓 − 𝑋) ∈ 𝑆 ↔ ((𝐹 ∘𝑓 − 𝑋) ∈ 𝐷 ∧ (𝐹 ∘𝑓 − 𝑋) ∘𝑟 ≤ 𝐹)) |
| 16 | 13, 15 | sylibr 134 | 1 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝑋 ∈ 𝑆) → (𝐹 ∘𝑓 − 𝑋) ∈ 𝑆) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 {crab 2532 class class class wbr 4128 ◡ccnv 4771 “ cima 4775 ⟶wf 5371 (class class class)co 6078 ∘𝑓 cof 6293 ∘𝑟 cofr 6294 ↑𝑚 cmap 6915 Fincfn 7015 ≤ cle 8354 − cmin 8490 ℕcn 9286 ℕ0cn0 9545 |
| 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-coll 4244 ax-sep 4247 ax-nul 4257 ax-pow 4309 ax-pr 4344 ax-un 4576 ax-setind 4682 ax-iinf 4733 ax-cnex 8263 ax-resscn 8264 ax-1cn 8265 ax-1re 8266 ax-icn 8267 ax-addcl 8268 ax-addrcl 8269 ax-mulcl 8270 ax-addcom 8272 ax-addass 8274 ax-distr 8276 ax-i2m1 8277 ax-0lt1 8278 ax-0id 8280 ax-rnegex 8281 ax-cnre 8283 ax-pre-ltirr 8284 ax-pre-ltwlin 8285 ax-pre-lttrn 8286 ax-pre-ltadd 8288 |
| This theorem depends on definitions: df-bi 117 df-dc 847 df-3or 1010 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-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 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 3639 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-uni 3934 df-int 3969 df-iun 4012 df-br 4129 df-opab 4191 df-mpt 4192 df-tr 4228 df-id 4436 df-iord 4509 df-on 4511 df-suc 4514 df-iom 4736 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-rn 4783 df-res 4784 df-ima 4785 df-iota 5335 df-fun 5377 df-fn 5378 df-f 5379 df-f1 5380 df-fo 5381 df-f1o 5382 df-fv 5383 df-riota 6031 df-ov 6081 df-oprab 6082 df-mpo 6083 df-of 6295 df-ofr 6296 df-1o 6680 df-er 6800 df-map 6917 df-en 7016 df-fin 7018 df-pnf 8355 df-mnf 8356 df-xr 8357 df-ltxr 8358 df-le 8359 df-sub 8492 df-neg 8493 df-inn 9287 df-n0 9546 df-z 9627 df-uz 9904 |
| This theorem is referenced by: psrbagconf1o 14990 |
| Copyright terms: Public domain | W3C validator |