![]() |
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 2733 | . . . . . 6 ⊢ {𝑔 ∈ (𝐴 ↑m 𝐵) ∣ 𝑔 finSupp ∅} = {𝑔 ∈ (𝐴 ↑m 𝐵) ∣ 𝑔 finSupp ∅} | |
3 | cantnfs.a | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ On) | |
4 | cantnfs.b | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ On) | |
5 | 2, 3, 4 | cantnfdm 9659 | . . . . 5 ⊢ (𝜑 → dom (𝐴 CNF 𝐵) = {𝑔 ∈ (𝐴 ↑m 𝐵) ∣ 𝑔 finSupp ∅}) |
6 | 1, 5 | eqtrid 2785 | . . . 4 ⊢ (𝜑 → 𝑆 = {𝑔 ∈ (𝐴 ↑m 𝐵) ∣ 𝑔 finSupp ∅}) |
7 | 6 | eleq2d 2820 | . . 3 ⊢ (𝜑 → (𝐹 ∈ 𝑆 ↔ 𝐹 ∈ {𝑔 ∈ (𝐴 ↑m 𝐵) ∣ 𝑔 finSupp ∅})) |
8 | breq1 5152 | . . . 4 ⊢ (𝑔 = 𝐹 → (𝑔 finSupp ∅ ↔ 𝐹 finSupp ∅)) | |
9 | 8 | elrab 3684 | . . 3 ⊢ (𝐹 ∈ {𝑔 ∈ (𝐴 ↑m 𝐵) ∣ 𝑔 finSupp ∅} ↔ (𝐹 ∈ (𝐴 ↑m 𝐵) ∧ 𝐹 finSupp ∅)) |
10 | 7, 9 | bitrdi 287 | . 2 ⊢ (𝜑 → (𝐹 ∈ 𝑆 ↔ (𝐹 ∈ (𝐴 ↑m 𝐵) ∧ 𝐹 finSupp ∅))) |
11 | 3, 4 | elmapd 8834 | . . 3 ⊢ (𝜑 → (𝐹 ∈ (𝐴 ↑m 𝐵) ↔ 𝐹:𝐵⟶𝐴)) |
12 | 11 | anbi1d 631 | . 2 ⊢ (𝜑 → ((𝐹 ∈ (𝐴 ↑m 𝐵) ∧ 𝐹 finSupp ∅) ↔ (𝐹:𝐵⟶𝐴 ∧ 𝐹 finSupp ∅))) |
13 | 10, 12 | bitrd 279 | 1 ⊢ (𝜑 → (𝐹 ∈ 𝑆 ↔ (𝐹:𝐵⟶𝐴 ∧ 𝐹 finSupp ∅))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 = wceq 1542 ∈ wcel 2107 {crab 3433 ∅c0 4323 class class class wbr 5149 dom cdm 5677 Oncon0 6365 ⟶wf 6540 (class class class)co 7409 ↑m cmap 8820 finSupp cfsupp 9361 CNF ccnf 9656 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-ral 3063 df-rex 3072 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-id 5575 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-ov 7412 df-oprab 7413 df-mpo 7414 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-seqom 8448 df-map 8822 df-cnf 9657 |
This theorem is referenced by: cantnfcl 9662 cantnfle 9666 cantnflt 9667 cantnff 9669 cantnf0 9670 cantnfrescl 9671 cantnfp1lem1 9673 cantnfp1lem2 9674 cantnfp1lem3 9675 cantnfp1 9676 oemapvali 9679 cantnflem1a 9680 cantnflem1b 9681 cantnflem1c 9682 cantnflem1d 9683 cantnflem1 9684 cantnflem3 9686 cantnf 9688 cnfcomlem 9694 cnfcom 9695 cnfcom2lem 9696 cnfcom3lem 9698 cnfcom3 9699 cantnfub 42071 cantnfresb 42074 cantnf2 42075 naddcnff 42112 naddcnffo 42114 naddcnfcom 42116 naddcnfid1 42117 naddcnfid2 42118 naddcnfass 42119 |
Copyright terms: Public domain | W3C validator |