![]() |
Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > pmapssbaN | Structured version Visualization version GIF version |
Description: A weakening of pmapssat 38189 to shorten some proofs. (Contributed by NM, 7-Mar-2012.) (New usage is discouraged.) |
Ref | Expression |
---|---|
pmapssba.b | ⊢ 𝐵 = (Base‘𝐾) |
pmapssba.m | ⊢ 𝑀 = (pmap‘𝐾) |
Ref | Expression |
---|---|
pmapssbaN | ⊢ ((𝐾 ∈ 𝐶 ∧ 𝑋 ∈ 𝐵) → (𝑀‘𝑋) ⊆ 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | pmapssba.b | . . 3 ⊢ 𝐵 = (Base‘𝐾) | |
2 | eqid 2736 | . . 3 ⊢ (Atoms‘𝐾) = (Atoms‘𝐾) | |
3 | pmapssba.m | . . 3 ⊢ 𝑀 = (pmap‘𝐾) | |
4 | 1, 2, 3 | pmapssat 38189 | . 2 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝑋 ∈ 𝐵) → (𝑀‘𝑋) ⊆ (Atoms‘𝐾)) |
5 | 1, 2 | atssbase 37719 | . 2 ⊢ (Atoms‘𝐾) ⊆ 𝐵 |
6 | 4, 5 | sstrdi 3954 | 1 ⊢ ((𝐾 ∈ 𝐶 ∧ 𝑋 ∈ 𝐵) → (𝑀‘𝑋) ⊆ 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ⊆ wss 3908 ‘cfv 6493 Basecbs 17075 Atomscatm 37692 pmapcpmap 37927 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-rep 5240 ax-sep 5254 ax-nul 5261 ax-pr 5382 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2887 df-ne 2942 df-ral 3063 df-rex 3072 df-reu 3352 df-rab 3406 df-v 3445 df-sbc 3738 df-csb 3854 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4281 df-if 4485 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4864 df-iun 4954 df-br 5104 df-opab 5166 df-mpt 5187 df-id 5529 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6445 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-ats 37696 df-pmap 37934 |
This theorem is referenced by: paddunN 38357 |
Copyright terms: Public domain | W3C validator |