| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > hash3tr | Structured version Visualization version GIF version | ||
| Description: A set of size three is an unordered triple. (Contributed by Alexander van der Vekens, 13-Sep-2018.) |
| Ref | Expression |
|---|---|
| hash3tr | ⊢ ((𝑉 ∈ 𝑊 ∧ (♯‘𝑉) = 3) → ∃𝑎∃𝑏∃𝑐 𝑉 = {𝑎, 𝑏, 𝑐}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 3nn0 12513 | . . . . 5 ⊢ 3 ∈ ℕ0 | |
| 2 | hashvnfin 14387 | . . . . 5 ⊢ ((𝑉 ∈ 𝑊 ∧ 3 ∈ ℕ0) → ((♯‘𝑉) = 3 → 𝑉 ∈ Fin)) | |
| 3 | 1, 2 | mpan2 703 | . . . 4 ⊢ (𝑉 ∈ 𝑊 → ((♯‘𝑉) = 3 → 𝑉 ∈ Fin)) |
| 4 | 3 | imp 411 | . . 3 ⊢ ((𝑉 ∈ 𝑊 ∧ (♯‘𝑉) = 3) → 𝑉 ∈ Fin) |
| 5 | hash3 14433 | . . . . . . . 8 ⊢ (♯‘3o) = 3 | |
| 6 | 5 | eqcomi 2774 | . . . . . . 7 ⊢ 3 = (♯‘3o) |
| 7 | 6 | a1i 11 | . . . . . 6 ⊢ (𝑉 ∈ Fin → 3 = (♯‘3o)) |
| 8 | 7 | eqeq2d 2776 | . . . . 5 ⊢ (𝑉 ∈ Fin → ((♯‘𝑉) = 3 ↔ (♯‘𝑉) = (♯‘3o))) |
| 9 | 3onn 8618 | . . . . . . . 8 ⊢ 3o ∈ ω | |
| 10 | nnfi 9140 | . . . . . . . 8 ⊢ (3o ∈ ω → 3o ∈ Fin) | |
| 11 | 9, 10 | ax-mp 5 | . . . . . . 7 ⊢ 3o ∈ Fin |
| 12 | hashen 14374 | . . . . . . 7 ⊢ ((𝑉 ∈ Fin ∧ 3o ∈ Fin) → ((♯‘𝑉) = (♯‘3o) ↔ 𝑉 ≈ 3o)) | |
| 13 | 11, 12 | mpan2 703 | . . . . . 6 ⊢ (𝑉 ∈ Fin → ((♯‘𝑉) = (♯‘3o) ↔ 𝑉 ≈ 3o)) |
| 14 | 13 | biimpd 232 | . . . . 5 ⊢ (𝑉 ∈ Fin → ((♯‘𝑉) = (♯‘3o) → 𝑉 ≈ 3o)) |
| 15 | 8, 14 | sylbid 243 | . . . 4 ⊢ (𝑉 ∈ Fin → ((♯‘𝑉) = 3 → 𝑉 ≈ 3o)) |
| 16 | 15 | adantld 495 | . . 3 ⊢ (𝑉 ∈ Fin → ((𝑉 ∈ 𝑊 ∧ (♯‘𝑉) = 3) → 𝑉 ≈ 3o)) |
| 17 | 4, 16 | mpcom 39 | . 2 ⊢ ((𝑉 ∈ 𝑊 ∧ (♯‘𝑉) = 3) → 𝑉 ≈ 3o) |
| 18 | en3 9229 | . 2 ⊢ (𝑉 ≈ 3o → ∃𝑎∃𝑏∃𝑐 𝑉 = {𝑎, 𝑏, 𝑐}) | |
| 19 | 17, 18 | syl 18 | 1 ⊢ ((𝑉 ∈ 𝑊 ∧ (♯‘𝑉) = 3) → ∃𝑎∃𝑏∃𝑐 𝑉 = {𝑎, 𝑏, 𝑐}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1563 ∃wex 1802 ∈ wcel 2145 {ctp 4589 class class class wbr 5105 ‘cfv 6525 ωcom 7850 3oc3o 8436 ≈ cen 8928 Fincfn 8931 3c3 12287 ℕ0cn0 12495 ♯chash 14357 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-tp 4590 df-op 4592 df-uni 4869 df-int 4909 df-iun 4954 df-br 5106 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-pred 6292 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-1st 7974 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-1o 8441 df-2o 8442 df-3o 8443 df-oadd 8445 df-er 8682 df-en 8932 df-dom 8933 df-sdom 8934 df-fin 8935 df-dju 9875 df-card 9913 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-nn 12225 df-2 12294 df-3 12295 df-n0 12496 df-z 12583 df-uz 12854 df-fz 13527 df-hash 14358 |
| This theorem is referenced by: hash1to3 14519 hash3tpde 14520 |
| Copyright terms: Public domain | W3C validator |