![]() |
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 2730 | . . . . . 6 ⊢ {𝑔 ∈ (𝐴 ↑m 𝐵) ∣ 𝑔 finSupp ∅} = {𝑔 ∈ (𝐴 ↑m 𝐵) ∣ 𝑔 finSupp ∅} | |
3 | cantnfs.a | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ On) | |
4 | cantnfs.b | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ On) | |
5 | 2, 3, 4 | cantnfdm 9661 | . . . . 5 ⊢ (𝜑 → dom (𝐴 CNF 𝐵) = {𝑔 ∈ (𝐴 ↑m 𝐵) ∣ 𝑔 finSupp ∅}) |
6 | 1, 5 | eqtrid 2782 | . . . 4 ⊢ (𝜑 → 𝑆 = {𝑔 ∈ (𝐴 ↑m 𝐵) ∣ 𝑔 finSupp ∅}) |
7 | 6 | eleq2d 2817 | . . 3 ⊢ (𝜑 → (𝐹 ∈ 𝑆 ↔ 𝐹 ∈ {𝑔 ∈ (𝐴 ↑m 𝐵) ∣ 𝑔 finSupp ∅})) |
8 | breq1 5150 | . . . 4 ⊢ (𝑔 = 𝐹 → (𝑔 finSupp ∅ ↔ 𝐹 finSupp ∅)) | |
9 | 8 | elrab 3682 | . . 3 ⊢ (𝐹 ∈ {𝑔 ∈ (𝐴 ↑m 𝐵) ∣ 𝑔 finSupp ∅} ↔ (𝐹 ∈ (𝐴 ↑m 𝐵) ∧ 𝐹 finSupp ∅)) |
10 | 7, 9 | bitrdi 286 | . 2 ⊢ (𝜑 → (𝐹 ∈ 𝑆 ↔ (𝐹 ∈ (𝐴 ↑m 𝐵) ∧ 𝐹 finSupp ∅))) |
11 | 3, 4 | elmapd 8836 | . . 3 ⊢ (𝜑 → (𝐹 ∈ (𝐴 ↑m 𝐵) ↔ 𝐹:𝐵⟶𝐴)) |
12 | 11 | anbi1d 628 | . 2 ⊢ (𝜑 → ((𝐹 ∈ (𝐴 ↑m 𝐵) ∧ 𝐹 finSupp ∅) ↔ (𝐹:𝐵⟶𝐴 ∧ 𝐹 finSupp ∅))) |
13 | 10, 12 | bitrd 278 | 1 ⊢ (𝜑 → (𝐹 ∈ 𝑆 ↔ (𝐹:𝐵⟶𝐴 ∧ 𝐹 finSupp ∅))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 = wceq 1539 ∈ wcel 2104 {crab 3430 ∅c0 4321 class class class wbr 5147 dom cdm 5675 Oncon0 6363 ⟶wf 6538 (class class class)co 7411 ↑m cmap 8822 finSupp cfsupp 9363 CNF ccnf 9658 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2701 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7727 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2532 df-eu 2561 df-clab 2708 df-cleq 2722 df-clel 2808 df-nfc 2883 df-ne 2939 df-ral 3060 df-rex 3069 df-reu 3375 df-rab 3431 df-v 3474 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-id 5573 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6299 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-ov 7414 df-oprab 7415 df-mpo 7416 df-frecs 8268 df-wrecs 8299 df-recs 8373 df-rdg 8412 df-seqom 8450 df-map 8824 df-cnf 9659 |
This theorem is referenced by: cantnfcl 9664 cantnfle 9668 cantnflt 9669 cantnff 9671 cantnf0 9672 cantnfrescl 9673 cantnfp1lem1 9675 cantnfp1lem2 9676 cantnfp1lem3 9677 cantnfp1 9678 oemapvali 9681 cantnflem1a 9682 cantnflem1b 9683 cantnflem1c 9684 cantnflem1d 9685 cantnflem1 9686 cantnflem3 9688 cantnf 9690 cnfcomlem 9696 cnfcom 9697 cnfcom2lem 9698 cnfcom3lem 9700 cnfcom3 9701 cantnfub 42373 cantnfresb 42376 cantnf2 42377 naddcnff 42414 naddcnffo 42416 naddcnfcom 42418 naddcnfid1 42419 naddcnfid2 42420 naddcnfass 42421 |
Copyright terms: Public domain | W3C validator |