Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > hashss | Structured version Visualization version GIF version |
Description: The size of a subset is less than or equal to the size of its superset. (Contributed by Alexander van der Vekens, 14-Jul-2018.) |
Ref | Expression |
---|---|
hashss | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴) → (♯‘𝐵) ≤ (♯‘𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssdomg 8873 | . . . . . . 7 ⊢ (𝐴 ∈ Fin → (𝐵 ⊆ 𝐴 → 𝐵 ≼ 𝐴)) | |
2 | 1 | com12 32 | . . . . . 6 ⊢ (𝐵 ⊆ 𝐴 → (𝐴 ∈ Fin → 𝐵 ≼ 𝐴)) |
3 | 2 | adantl 482 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴) → (𝐴 ∈ Fin → 𝐵 ≼ 𝐴)) |
4 | 3 | impcom 408 | . . . 4 ⊢ ((𝐴 ∈ Fin ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴)) → 𝐵 ≼ 𝐴) |
5 | ssfi 9050 | . . . . . 6 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ⊆ 𝐴) → 𝐵 ∈ Fin) | |
6 | 5 | adantrl 714 | . . . . 5 ⊢ ((𝐴 ∈ Fin ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴)) → 𝐵 ∈ Fin) |
7 | simpl 483 | . . . . 5 ⊢ ((𝐴 ∈ Fin ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴)) → 𝐴 ∈ Fin) | |
8 | hashdom 14206 | . . . . 5 ⊢ ((𝐵 ∈ Fin ∧ 𝐴 ∈ Fin) → ((♯‘𝐵) ≤ (♯‘𝐴) ↔ 𝐵 ≼ 𝐴)) | |
9 | 6, 7, 8 | syl2anc 584 | . . . 4 ⊢ ((𝐴 ∈ Fin ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴)) → ((♯‘𝐵) ≤ (♯‘𝐴) ↔ 𝐵 ≼ 𝐴)) |
10 | 4, 9 | mpbird 256 | . . 3 ⊢ ((𝐴 ∈ Fin ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴)) → (♯‘𝐵) ≤ (♯‘𝐴)) |
11 | 10 | ex 413 | . 2 ⊢ (𝐴 ∈ Fin → ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴) → (♯‘𝐵) ≤ (♯‘𝐴))) |
12 | hashinf 14162 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) → (♯‘𝐴) = +∞) | |
13 | ssexg 5278 | . . . . . . . . . . . 12 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝐴 ∈ 𝑉) → 𝐵 ∈ V) | |
14 | 13 | ancoms 459 | . . . . . . . . . . 11 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴) → 𝐵 ∈ V) |
15 | hashxrcl 14184 | . . . . . . . . . . 11 ⊢ (𝐵 ∈ V → (♯‘𝐵) ∈ ℝ*) | |
16 | pnfge 12979 | . . . . . . . . . . 11 ⊢ ((♯‘𝐵) ∈ ℝ* → (♯‘𝐵) ≤ +∞) | |
17 | 14, 15, 16 | 3syl 18 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴) → (♯‘𝐵) ≤ +∞) |
18 | 17 | ex 413 | . . . . . . . . 9 ⊢ (𝐴 ∈ 𝑉 → (𝐵 ⊆ 𝐴 → (♯‘𝐵) ≤ +∞)) |
19 | 18 | adantl 482 | . . . . . . . 8 ⊢ (((♯‘𝐴) = +∞ ∧ 𝐴 ∈ 𝑉) → (𝐵 ⊆ 𝐴 → (♯‘𝐵) ≤ +∞)) |
20 | breq2 5107 | . . . . . . . . 9 ⊢ ((♯‘𝐴) = +∞ → ((♯‘𝐵) ≤ (♯‘𝐴) ↔ (♯‘𝐵) ≤ +∞)) | |
21 | 20 | adantr 481 | . . . . . . . 8 ⊢ (((♯‘𝐴) = +∞ ∧ 𝐴 ∈ 𝑉) → ((♯‘𝐵) ≤ (♯‘𝐴) ↔ (♯‘𝐵) ≤ +∞)) |
22 | 19, 21 | sylibrd 258 | . . . . . . 7 ⊢ (((♯‘𝐴) = +∞ ∧ 𝐴 ∈ 𝑉) → (𝐵 ⊆ 𝐴 → (♯‘𝐵) ≤ (♯‘𝐴))) |
23 | 22 | expcom 414 | . . . . . 6 ⊢ (𝐴 ∈ 𝑉 → ((♯‘𝐴) = +∞ → (𝐵 ⊆ 𝐴 → (♯‘𝐵) ≤ (♯‘𝐴)))) |
24 | 23 | adantr 481 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) → ((♯‘𝐴) = +∞ → (𝐵 ⊆ 𝐴 → (♯‘𝐵) ≤ (♯‘𝐴)))) |
25 | 12, 24 | mpd 15 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ ¬ 𝐴 ∈ Fin) → (𝐵 ⊆ 𝐴 → (♯‘𝐵) ≤ (♯‘𝐴))) |
26 | 25 | impancom 452 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴) → (¬ 𝐴 ∈ Fin → (♯‘𝐵) ≤ (♯‘𝐴))) |
27 | 26 | com12 32 | . 2 ⊢ (¬ 𝐴 ∈ Fin → ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴) → (♯‘𝐵) ≤ (♯‘𝐴))) |
28 | 11, 27 | pm2.61i 182 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴) → (♯‘𝐵) ≤ (♯‘𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 Vcvv 3443 ⊆ wss 3908 class class class wbr 5103 ‘cfv 6491 ≼ cdom 8814 Fincfn 8816 +∞cpnf 11119 ℝ*cxr 11121 ≤ cle 11123 ♯chash 14157 |
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 2708 ax-sep 5254 ax-nul 5261 ax-pow 5318 ax-pr 5382 ax-un 7662 ax-cnex 11040 ax-resscn 11041 ax-1cn 11042 ax-icn 11043 ax-addcl 11044 ax-addrcl 11045 ax-mulcl 11046 ax-mulrcl 11047 ax-mulcom 11048 ax-addass 11049 ax-mulass 11050 ax-distr 11051 ax-i2m1 11052 ax-1ne0 11053 ax-1rid 11054 ax-rnegex 11055 ax-rrecex 11056 ax-cnre 11057 ax-pre-lttri 11058 ax-pre-lttrn 11059 ax-pre-ltadd 11060 ax-pre-mulgt0 11061 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2815 df-nfc 2887 df-ne 2942 df-nel 3048 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-pss 3927 df-nul 4281 df-if 4485 df-pw 4560 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4864 df-int 4906 df-iun 4954 df-br 5104 df-opab 5166 df-mpt 5187 df-tr 5221 df-id 5528 df-eprel 5534 df-po 5542 df-so 5543 df-fr 5585 df-we 5587 df-xp 5636 df-rel 5637 df-cnv 5638 df-co 5639 df-dm 5640 df-rn 5641 df-res 5642 df-ima 5643 df-pred 6249 df-ord 6316 df-on 6317 df-lim 6318 df-suc 6319 df-iota 6443 df-fun 6493 df-fn 6494 df-f 6495 df-f1 6496 df-fo 6497 df-f1o 6498 df-fv 6499 df-riota 7305 df-ov 7352 df-oprab 7353 df-mpo 7354 df-om 7793 df-1st 7911 df-2nd 7912 df-frecs 8179 df-wrecs 8210 df-recs 8284 df-rdg 8323 df-1o 8379 df-oadd 8383 df-er 8581 df-en 8817 df-dom 8818 df-sdom 8819 df-fin 8820 df-card 9808 df-pnf 11124 df-mnf 11125 df-xr 11126 df-ltxr 11127 df-le 11128 df-sub 11320 df-neg 11321 df-nn 12087 df-n0 12347 df-xnn0 12419 df-z 12433 df-uz 12696 df-fz 13353 df-hash 14158 |
This theorem is referenced by: prsshashgt1 14237 hashin 14238 nehash2 14300 isnzr2hash 20657 nbfusgrlevtxm1 28123 nbfusgrlevtxm2 28124 konigsberglem5 28998 cycpmconjslem2 31798 lssdimle 32088 hashf1dmcdm 33481 poimirlem9 35982 hashssle 43289 fourierdlem102 44202 fourierdlem114 44214 |
Copyright terms: Public domain | W3C validator |