Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cantnfs | Structured version Visualization version GIF version |
Description: Elementhood in the set of finitely supported functions from 𝐵 to 𝐴. (Contributed by Mario Carneiro, 25-May-2015.) (Revised by AV, 28-Jun-2019.) |
Ref | Expression |
---|---|
cantnfs.s | ⊢ 𝑆 = dom (𝐴 CNF 𝐵) |
cantnfs.a | ⊢ (𝜑 → 𝐴 ∈ On) |
cantnfs.b | ⊢ (𝜑 → 𝐵 ∈ On) |
Ref | Expression |
---|---|
cantnfs | ⊢ (𝜑 → (𝐹 ∈ 𝑆 ↔ (𝐹:𝐵⟶𝐴 ∧ 𝐹 finSupp ∅))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cantnfs.s | . . . . 5 ⊢ 𝑆 = dom (𝐴 CNF 𝐵) | |
2 | eqid 2821 | . . . . . 6 ⊢ {𝑔 ∈ (𝐴 ↑m 𝐵) ∣ 𝑔 finSupp ∅} = {𝑔 ∈ (𝐴 ↑m 𝐵) ∣ 𝑔 finSupp ∅} | |
3 | cantnfs.a | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ On) | |
4 | cantnfs.b | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ On) | |
5 | 2, 3, 4 | cantnfdm 9126 | . . . . 5 ⊢ (𝜑 → dom (𝐴 CNF 𝐵) = {𝑔 ∈ (𝐴 ↑m 𝐵) ∣ 𝑔 finSupp ∅}) |
6 | 1, 5 | syl5eq 2868 | . . . 4 ⊢ (𝜑 → 𝑆 = {𝑔 ∈ (𝐴 ↑m 𝐵) ∣ 𝑔 finSupp ∅}) |
7 | 6 | eleq2d 2898 | . . 3 ⊢ (𝜑 → (𝐹 ∈ 𝑆 ↔ 𝐹 ∈ {𝑔 ∈ (𝐴 ↑m 𝐵) ∣ 𝑔 finSupp ∅})) |
8 | breq1 5068 | . . . 4 ⊢ (𝑔 = 𝐹 → (𝑔 finSupp ∅ ↔ 𝐹 finSupp ∅)) | |
9 | 8 | elrab 3679 | . . 3 ⊢ (𝐹 ∈ {𝑔 ∈ (𝐴 ↑m 𝐵) ∣ 𝑔 finSupp ∅} ↔ (𝐹 ∈ (𝐴 ↑m 𝐵) ∧ 𝐹 finSupp ∅)) |
10 | 7, 9 | syl6bb 289 | . 2 ⊢ (𝜑 → (𝐹 ∈ 𝑆 ↔ (𝐹 ∈ (𝐴 ↑m 𝐵) ∧ 𝐹 finSupp ∅))) |
11 | 3, 4 | elmapd 8419 | . . 3 ⊢ (𝜑 → (𝐹 ∈ (𝐴 ↑m 𝐵) ↔ 𝐹:𝐵⟶𝐴)) |
12 | 11 | anbi1d 631 | . 2 ⊢ (𝜑 → ((𝐹 ∈ (𝐴 ↑m 𝐵) ∧ 𝐹 finSupp ∅) ↔ (𝐹:𝐵⟶𝐴 ∧ 𝐹 finSupp ∅))) |
13 | 10, 12 | bitrd 281 | 1 ⊢ (𝜑 → (𝐹 ∈ 𝑆 ↔ (𝐹:𝐵⟶𝐴 ∧ 𝐹 finSupp ∅))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1533 ∈ wcel 2110 {crab 3142 ∅c0 4290 class class class wbr 5065 dom cdm 5554 Oncon0 6190 ⟶wf 6350 (class class class)co 7155 ↑m cmap 8405 finSupp cfsupp 8832 CNF ccnf 9123 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5189 ax-sep 5202 ax-nul 5209 ax-pow 5265 ax-pr 5329 ax-un 7460 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-fal 1546 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4567 df-pr 4569 df-op 4573 df-uni 4838 df-iun 4920 df-br 5066 df-opab 5128 df-mpt 5146 df-id 5459 df-xp 5560 df-rel 5561 df-cnv 5562 df-co 5563 df-dm 5564 df-rn 5565 df-res 5566 df-ima 5567 df-pred 6147 df-iota 6313 df-fun 6356 df-fn 6357 df-f 6358 df-f1 6359 df-fo 6360 df-f1o 6361 df-fv 6362 df-ov 7158 df-oprab 7159 df-mpo 7160 df-wrecs 7946 df-recs 8007 df-rdg 8045 df-seqom 8083 df-map 8407 df-cnf 9124 |
This theorem is referenced by: cantnfcl 9129 cantnfle 9133 cantnflt 9134 cantnff 9136 cantnf0 9137 cantnfrescl 9138 cantnfp1lem1 9140 cantnfp1lem2 9141 cantnfp1lem3 9142 cantnfp1 9143 oemapvali 9146 cantnflem1a 9147 cantnflem1b 9148 cantnflem1c 9149 cantnflem1d 9150 cantnflem1 9151 cantnflem3 9153 cantnf 9155 cnfcomlem 9161 cnfcom 9162 cnfcom2lem 9163 cnfcom3lem 9165 cnfcom3 9166 |
Copyright terms: Public domain | W3C validator |