![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > birthdaylem1 | Structured version Visualization version GIF version |
Description: Lemma for birthday 26885. (Contributed by Mario Carneiro, 17-Apr-2015.) |
Ref | Expression |
---|---|
birthday.s | ⊢ 𝑆 = {𝑓 ∣ 𝑓:(1...𝐾)⟶(1...𝑁)} |
birthday.t | ⊢ 𝑇 = {𝑓 ∣ 𝑓:(1...𝐾)–1-1→(1...𝑁)} |
Ref | Expression |
---|---|
birthdaylem1 | ⊢ (𝑇 ⊆ 𝑆 ∧ 𝑆 ∈ Fin ∧ (𝑁 ∈ ℕ → 𝑆 ≠ ∅)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | f1f 6793 | . . . 4 ⊢ (𝑓:(1...𝐾)–1-1→(1...𝑁) → 𝑓:(1...𝐾)⟶(1...𝑁)) | |
2 | 1 | ss2abi 4061 | . . 3 ⊢ {𝑓 ∣ 𝑓:(1...𝐾)–1-1→(1...𝑁)} ⊆ {𝑓 ∣ 𝑓:(1...𝐾)⟶(1...𝑁)} |
3 | birthday.t | . . 3 ⊢ 𝑇 = {𝑓 ∣ 𝑓:(1...𝐾)–1-1→(1...𝑁)} | |
4 | birthday.s | . . 3 ⊢ 𝑆 = {𝑓 ∣ 𝑓:(1...𝐾)⟶(1...𝑁)} | |
5 | 2, 3, 4 | 3sstr4i 4023 | . 2 ⊢ 𝑇 ⊆ 𝑆 |
6 | fzfi 13969 | . . . . 5 ⊢ (1...𝑁) ∈ Fin | |
7 | fzfi 13969 | . . . . 5 ⊢ (1...𝐾) ∈ Fin | |
8 | mapvalg 8854 | . . . . 5 ⊢ (((1...𝑁) ∈ Fin ∧ (1...𝐾) ∈ Fin) → ((1...𝑁) ↑m (1...𝐾)) = {𝑓 ∣ 𝑓:(1...𝐾)⟶(1...𝑁)}) | |
9 | 6, 7, 8 | mp2an 691 | . . . 4 ⊢ ((1...𝑁) ↑m (1...𝐾)) = {𝑓 ∣ 𝑓:(1...𝐾)⟶(1...𝑁)} |
10 | 4, 9 | eqtr4i 2759 | . . 3 ⊢ 𝑆 = ((1...𝑁) ↑m (1...𝐾)) |
11 | mapfi 9372 | . . . 4 ⊢ (((1...𝑁) ∈ Fin ∧ (1...𝐾) ∈ Fin) → ((1...𝑁) ↑m (1...𝐾)) ∈ Fin) | |
12 | 6, 7, 11 | mp2an 691 | . . 3 ⊢ ((1...𝑁) ↑m (1...𝐾)) ∈ Fin |
13 | 10, 12 | eqeltri 2825 | . 2 ⊢ 𝑆 ∈ Fin |
14 | elfz1end 13563 | . . . 4 ⊢ (𝑁 ∈ ℕ ↔ 𝑁 ∈ (1...𝑁)) | |
15 | ne0i 4335 | . . . 4 ⊢ (𝑁 ∈ (1...𝑁) → (1...𝑁) ≠ ∅) | |
16 | 14, 15 | sylbi 216 | . . 3 ⊢ (𝑁 ∈ ℕ → (1...𝑁) ≠ ∅) |
17 | 10 | eqeq1i 2733 | . . . . 5 ⊢ (𝑆 = ∅ ↔ ((1...𝑁) ↑m (1...𝐾)) = ∅) |
18 | ovex 7453 | . . . . . . 7 ⊢ (1...𝑁) ∈ V | |
19 | ovex 7453 | . . . . . . 7 ⊢ (1...𝐾) ∈ V | |
20 | 18, 19 | map0 8905 | . . . . . 6 ⊢ (((1...𝑁) ↑m (1...𝐾)) = ∅ ↔ ((1...𝑁) = ∅ ∧ (1...𝐾) ≠ ∅)) |
21 | 20 | simplbi 497 | . . . . 5 ⊢ (((1...𝑁) ↑m (1...𝐾)) = ∅ → (1...𝑁) = ∅) |
22 | 17, 21 | sylbi 216 | . . . 4 ⊢ (𝑆 = ∅ → (1...𝑁) = ∅) |
23 | 22 | necon3i 2970 | . . 3 ⊢ ((1...𝑁) ≠ ∅ → 𝑆 ≠ ∅) |
24 | 16, 23 | syl 17 | . 2 ⊢ (𝑁 ∈ ℕ → 𝑆 ≠ ∅) |
25 | 5, 13, 24 | 3pm3.2i 1337 | 1 ⊢ (𝑇 ⊆ 𝑆 ∧ 𝑆 ∈ Fin ∧ (𝑁 ∈ ℕ → 𝑆 ≠ ∅)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1085 = wceq 1534 ∈ wcel 2099 {cab 2705 ≠ wne 2937 ⊆ wss 3947 ∅c0 4323 ⟶wf 6544 –1-1→wf1 6545 (class class class)co 7420 ↑m cmap 8844 Fincfn 8963 1c1 11139 ℕcn 12242 ...cfz 13516 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2699 ax-sep 5299 ax-nul 5306 ax-pow 5365 ax-pr 5429 ax-un 7740 ax-cnex 11194 ax-resscn 11195 ax-1cn 11196 ax-icn 11197 ax-addcl 11198 ax-addrcl 11199 ax-mulcl 11200 ax-mulrcl 11201 ax-mulcom 11202 ax-addass 11203 ax-mulass 11204 ax-distr 11205 ax-i2m1 11206 ax-1ne0 11207 ax-1rid 11208 ax-rnegex 11209 ax-rrecex 11210 ax-cnre 11211 ax-pre-lttri 11212 ax-pre-lttrn 11213 ax-pre-ltadd 11214 ax-pre-mulgt0 11215 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3or 1086 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2530 df-eu 2559 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2938 df-nel 3044 df-ral 3059 df-rex 3068 df-reu 3374 df-rab 3430 df-v 3473 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4909 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5576 df-eprel 5582 df-po 5590 df-so 5591 df-fr 5633 df-we 5635 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-rn 5689 df-res 5690 df-ima 5691 df-pred 6305 df-ord 6372 df-on 6373 df-lim 6374 df-suc 6375 df-iota 6500 df-fun 6550 df-fn 6551 df-f 6552 df-f1 6553 df-fo 6554 df-f1o 6555 df-fv 6556 df-riota 7376 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7871 df-1st 7993 df-2nd 7994 df-frecs 8286 df-wrecs 8317 df-recs 8391 df-rdg 8430 df-1o 8486 df-er 8724 df-map 8846 df-pm 8847 df-en 8964 df-dom 8965 df-sdom 8966 df-fin 8967 df-pnf 11280 df-mnf 11281 df-xr 11282 df-ltxr 11283 df-le 11284 df-sub 11476 df-neg 11477 df-nn 12243 df-n0 12503 df-z 12589 df-uz 12853 df-fz 13517 |
This theorem is referenced by: birthdaylem3 26884 birthday 26885 |
Copyright terms: Public domain | W3C validator |