Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > mptctf | Structured version Visualization version GIF version |
Description: A countable mapping set is countable, using bound-variable hypotheses instead of distinct variable conditions. (Contributed by Thierry Arnoux, 8-Mar-2017.) |
Ref | Expression |
---|---|
mptctf.1 | ⊢ Ⅎ𝑥𝐴 |
Ref | Expression |
---|---|
mptctf | ⊢ (𝐴 ≼ ω → (𝑥 ∈ 𝐴 ↦ 𝐵) ≼ ω) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | funmpt 6386 | . 2 ⊢ Fun (𝑥 ∈ 𝐴 ↦ 𝐵) | |
2 | ctex 8512 | . . . 4 ⊢ (𝐴 ≼ ω → 𝐴 ∈ V) | |
3 | eqid 2818 | . . . . . 6 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵) | |
4 | 3 | dmmpt 6087 | . . . . 5 ⊢ dom (𝑥 ∈ 𝐴 ↦ 𝐵) = {𝑥 ∈ 𝐴 ∣ 𝐵 ∈ V} |
5 | df-rab 3144 | . . . . . 6 ⊢ {𝑥 ∈ 𝐴 ∣ 𝐵 ∈ V} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝐵 ∈ V)} | |
6 | simpl 483 | . . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐵 ∈ V) → 𝑥 ∈ 𝐴) | |
7 | 6 | ss2abi 4040 | . . . . . . 7 ⊢ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝐵 ∈ V)} ⊆ {𝑥 ∣ 𝑥 ∈ 𝐴} |
8 | mptctf.1 | . . . . . . . 8 ⊢ Ⅎ𝑥𝐴 | |
9 | 8 | abid2f 3009 | . . . . . . 7 ⊢ {𝑥 ∣ 𝑥 ∈ 𝐴} = 𝐴 |
10 | 7, 9 | sseqtri 4000 | . . . . . 6 ⊢ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝐵 ∈ V)} ⊆ 𝐴 |
11 | 5, 10 | eqsstri 3998 | . . . . 5 ⊢ {𝑥 ∈ 𝐴 ∣ 𝐵 ∈ V} ⊆ 𝐴 |
12 | 4, 11 | eqsstri 3998 | . . . 4 ⊢ dom (𝑥 ∈ 𝐴 ↦ 𝐵) ⊆ 𝐴 |
13 | ssdomg 8543 | . . . 4 ⊢ (𝐴 ∈ V → (dom (𝑥 ∈ 𝐴 ↦ 𝐵) ⊆ 𝐴 → dom (𝑥 ∈ 𝐴 ↦ 𝐵) ≼ 𝐴)) | |
14 | 2, 12, 13 | mpisyl 21 | . . 3 ⊢ (𝐴 ≼ ω → dom (𝑥 ∈ 𝐴 ↦ 𝐵) ≼ 𝐴) |
15 | domtr 8550 | . . 3 ⊢ ((dom (𝑥 ∈ 𝐴 ↦ 𝐵) ≼ 𝐴 ∧ 𝐴 ≼ ω) → dom (𝑥 ∈ 𝐴 ↦ 𝐵) ≼ ω) | |
16 | 14, 15 | mpancom 684 | . 2 ⊢ (𝐴 ≼ ω → dom (𝑥 ∈ 𝐴 ↦ 𝐵) ≼ ω) |
17 | funfn 6378 | . . 3 ⊢ (Fun (𝑥 ∈ 𝐴 ↦ 𝐵) ↔ (𝑥 ∈ 𝐴 ↦ 𝐵) Fn dom (𝑥 ∈ 𝐴 ↦ 𝐵)) | |
18 | fnct 9947 | . . 3 ⊢ (((𝑥 ∈ 𝐴 ↦ 𝐵) Fn dom (𝑥 ∈ 𝐴 ↦ 𝐵) ∧ dom (𝑥 ∈ 𝐴 ↦ 𝐵) ≼ ω) → (𝑥 ∈ 𝐴 ↦ 𝐵) ≼ ω) | |
19 | 17, 18 | sylanb 581 | . 2 ⊢ ((Fun (𝑥 ∈ 𝐴 ↦ 𝐵) ∧ dom (𝑥 ∈ 𝐴 ↦ 𝐵) ≼ ω) → (𝑥 ∈ 𝐴 ↦ 𝐵) ≼ ω) |
20 | 1, 16, 19 | sylancr 587 | 1 ⊢ (𝐴 ≼ ω → (𝑥 ∈ 𝐴 ↦ 𝐵) ≼ ω) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∈ wcel 2105 {cab 2796 Ⅎwnfc 2958 {crab 3139 Vcvv 3492 ⊆ wss 3933 class class class wbr 5057 ↦ cmpt 5137 dom cdm 5548 Fun wfun 6342 Fn wfn 6343 ωcom 7569 ≼ cdom 8495 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-rep 5181 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-inf2 9092 ax-ac2 9873 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-ral 3140 df-rex 3141 df-reu 3142 df-rmo 3143 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4831 df-int 4868 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-se 5508 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-isom 6357 df-riota 7103 df-ov 7148 df-oprab 7149 df-mpo 7150 df-om 7570 df-1st 7678 df-2nd 7679 df-wrecs 7936 df-recs 7997 df-rdg 8035 df-1o 8091 df-oadd 8095 df-er 8278 df-map 8397 df-en 8498 df-dom 8499 df-sdom 8500 df-fin 8501 df-oi 8962 df-card 9356 df-acn 9359 df-ac 9530 |
This theorem is referenced by: abrexctf 30380 |
Copyright terms: Public domain | W3C validator |