Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > fourierdlem36 | Structured version Visualization version GIF version |
Description: 𝐹 is an isomorphism. (Contributed by Glauco Siliprandi, 11-Dec-2019.) |
Ref | Expression |
---|---|
fourierdlem36.a | ⊢ (𝜑 → 𝐴 ∈ Fin) |
fourierdlem36.assr | ⊢ (𝜑 → 𝐴 ⊆ ℝ) |
fourierdlem36.f | ⊢ 𝐹 = (℩𝑓𝑓 Isom < , < ((0...𝑁), 𝐴)) |
fourierdlem36.n | ⊢ 𝑁 = ((♯‘𝐴) − 1) |
Ref | Expression |
---|---|
fourierdlem36 | ⊢ (𝜑 → 𝐹 Isom < , < ((0...𝑁), 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fourierdlem36.f | . . 3 ⊢ 𝐹 = (℩𝑓𝑓 Isom < , < ((0...𝑁), 𝐴)) | |
2 | fourierdlem36.a | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ Fin) | |
3 | fourierdlem36.assr | . . . . . . 7 ⊢ (𝜑 → 𝐴 ⊆ ℝ) | |
4 | ltso 10715 | . . . . . . 7 ⊢ < Or ℝ | |
5 | soss 5487 | . . . . . . 7 ⊢ (𝐴 ⊆ ℝ → ( < Or ℝ → < Or 𝐴)) | |
6 | 3, 4, 5 | mpisyl 21 | . . . . . 6 ⊢ (𝜑 → < Or 𝐴) |
7 | 0zd 11987 | . . . . . 6 ⊢ (𝜑 → 0 ∈ ℤ) | |
8 | eqid 2821 | . . . . . 6 ⊢ ((♯‘𝐴) + (0 − 1)) = ((♯‘𝐴) + (0 − 1)) | |
9 | 2, 6, 7, 8 | fzisoeu 41560 | . . . . 5 ⊢ (𝜑 → ∃!𝑓 𝑓 Isom < , < ((0...((♯‘𝐴) + (0 − 1))), 𝐴)) |
10 | hashcl 13711 | . . . . . . . . . . . 12 ⊢ (𝐴 ∈ Fin → (♯‘𝐴) ∈ ℕ0) | |
11 | 2, 10 | syl 17 | . . . . . . . . . . 11 ⊢ (𝜑 → (♯‘𝐴) ∈ ℕ0) |
12 | 11 | nn0cnd 11951 | . . . . . . . . . 10 ⊢ (𝜑 → (♯‘𝐴) ∈ ℂ) |
13 | 1cnd 10630 | . . . . . . . . . 10 ⊢ (𝜑 → 1 ∈ ℂ) | |
14 | 12, 13 | negsubd 10997 | . . . . . . . . 9 ⊢ (𝜑 → ((♯‘𝐴) + -1) = ((♯‘𝐴) − 1)) |
15 | df-neg 10867 | . . . . . . . . . . 11 ⊢ -1 = (0 − 1) | |
16 | 15 | eqcomi 2830 | . . . . . . . . . 10 ⊢ (0 − 1) = -1 |
17 | 16 | oveq2i 7161 | . . . . . . . . 9 ⊢ ((♯‘𝐴) + (0 − 1)) = ((♯‘𝐴) + -1) |
18 | fourierdlem36.n | . . . . . . . . 9 ⊢ 𝑁 = ((♯‘𝐴) − 1) | |
19 | 14, 17, 18 | 3eqtr4g 2881 | . . . . . . . 8 ⊢ (𝜑 → ((♯‘𝐴) + (0 − 1)) = 𝑁) |
20 | 19 | oveq2d 7166 | . . . . . . 7 ⊢ (𝜑 → (0...((♯‘𝐴) + (0 − 1))) = (0...𝑁)) |
21 | isoeq4 7067 | . . . . . . 7 ⊢ ((0...((♯‘𝐴) + (0 − 1))) = (0...𝑁) → (𝑓 Isom < , < ((0...((♯‘𝐴) + (0 − 1))), 𝐴) ↔ 𝑓 Isom < , < ((0...𝑁), 𝐴))) | |
22 | 20, 21 | syl 17 | . . . . . 6 ⊢ (𝜑 → (𝑓 Isom < , < ((0...((♯‘𝐴) + (0 − 1))), 𝐴) ↔ 𝑓 Isom < , < ((0...𝑁), 𝐴))) |
23 | 22 | eubidv 2668 | . . . . 5 ⊢ (𝜑 → (∃!𝑓 𝑓 Isom < , < ((0...((♯‘𝐴) + (0 − 1))), 𝐴) ↔ ∃!𝑓 𝑓 Isom < , < ((0...𝑁), 𝐴))) |
24 | 9, 23 | mpbid 234 | . . . 4 ⊢ (𝜑 → ∃!𝑓 𝑓 Isom < , < ((0...𝑁), 𝐴)) |
25 | iotacl 6335 | . . . 4 ⊢ (∃!𝑓 𝑓 Isom < , < ((0...𝑁), 𝐴) → (℩𝑓𝑓 Isom < , < ((0...𝑁), 𝐴)) ∈ {𝑓 ∣ 𝑓 Isom < , < ((0...𝑁), 𝐴)}) | |
26 | 24, 25 | syl 17 | . . 3 ⊢ (𝜑 → (℩𝑓𝑓 Isom < , < ((0...𝑁), 𝐴)) ∈ {𝑓 ∣ 𝑓 Isom < , < ((0...𝑁), 𝐴)}) |
27 | 1, 26 | eqeltrid 2917 | . 2 ⊢ (𝜑 → 𝐹 ∈ {𝑓 ∣ 𝑓 Isom < , < ((0...𝑁), 𝐴)}) |
28 | iotaex 6329 | . . . 4 ⊢ (℩𝑓𝑓 Isom < , < ((0...𝑁), 𝐴)) ∈ V | |
29 | 1, 28 | eqeltri 2909 | . . 3 ⊢ 𝐹 ∈ V |
30 | isoeq1 7064 | . . 3 ⊢ (𝑓 = 𝐹 → (𝑓 Isom < , < ((0...𝑁), 𝐴) ↔ 𝐹 Isom < , < ((0...𝑁), 𝐴))) | |
31 | 29, 30 | elab 3666 | . 2 ⊢ (𝐹 ∈ {𝑓 ∣ 𝑓 Isom < , < ((0...𝑁), 𝐴)} ↔ 𝐹 Isom < , < ((0...𝑁), 𝐴)) |
32 | 27, 31 | sylib 220 | 1 ⊢ (𝜑 → 𝐹 Isom < , < ((0...𝑁), 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 = wceq 1533 ∈ wcel 2110 ∃!weu 2649 {cab 2799 Vcvv 3494 ⊆ wss 3935 Or wor 5467 ℩cio 6306 ‘cfv 6349 Isom wiso 6350 (class class class)co 7150 Fincfn 8503 ℝcr 10530 0cc0 10531 1c1 10532 + caddc 10534 < clt 10669 − cmin 10864 -cneg 10865 ℕ0cn0 11891 ...cfz 12886 ♯chash 13684 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5182 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 ax-inf2 9098 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-tp 4565 df-op 4567 df-uni 4832 df-int 4869 df-iun 4913 df-br 5059 df-opab 5121 df-mpt 5139 df-tr 5165 df-id 5454 df-eprel 5459 df-po 5468 df-so 5469 df-fr 5508 df-se 5509 df-we 5510 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-pred 6142 df-ord 6188 df-on 6189 df-lim 6190 df-suc 6191 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-isom 6358 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7575 df-1st 7683 df-2nd 7684 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-1o 8096 df-er 8283 df-en 8504 df-dom 8505 df-sdom 8506 df-fin 8507 df-oi 8968 df-card 9362 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-nn 11633 df-n0 11892 df-z 11976 df-uz 12238 df-fz 12887 df-hash 13685 |
This theorem is referenced by: fourierdlem50 42435 fourierdlem51 42436 fourierdlem52 42437 fourierdlem54 42439 fourierdlem76 42461 fourierdlem102 42487 fourierdlem103 42488 fourierdlem104 42489 fourierdlem114 42499 |
Copyright terms: Public domain | W3C validator |