| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > rinvf1o | Structured version Visualization version GIF version | ||
| Description: Sufficient conditions for the restriction of an involution to be a bijection. (Contributed by Thierry Arnoux, 7-Dec-2016.) |
| Ref | Expression |
|---|---|
| rinvbij.1 | ⊢ Fun 𝐹 |
| rinvbij.2 | ⊢ ◡𝐹 = 𝐹 |
| rinvbij.3a | ⊢ (𝐹 “ 𝐴) ⊆ 𝐵 |
| rinvbij.3b | ⊢ (𝐹 “ 𝐵) ⊆ 𝐴 |
| rinvbij.4a | ⊢ 𝐴 ⊆ dom 𝐹 |
| rinvbij.4b | ⊢ 𝐵 ⊆ dom 𝐹 |
| Ref | Expression |
|---|---|
| rinvf1o | ⊢ (𝐹 ↾ 𝐴):𝐴–1-1-onto→𝐵 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rinvbij.1 | . . . . 5 ⊢ Fun 𝐹 | |
| 2 | fdmrn 6738 | . . . . 5 ⊢ (Fun 𝐹 ↔ 𝐹:dom 𝐹⟶ran 𝐹) | |
| 3 | 1, 2 | mpbi 233 | . . . 4 ⊢ 𝐹:dom 𝐹⟶ran 𝐹 |
| 4 | rinvbij.2 | . . . . . 6 ⊢ ◡𝐹 = 𝐹 | |
| 5 | 4 | funeqi 6558 | . . . . 5 ⊢ (Fun ◡𝐹 ↔ Fun 𝐹) |
| 6 | 1, 5 | mpbir 234 | . . . 4 ⊢ Fun ◡𝐹 |
| 7 | df-f1 6542 | . . . 4 ⊢ (𝐹:dom 𝐹–1-1→ran 𝐹 ↔ (𝐹:dom 𝐹⟶ran 𝐹 ∧ Fun ◡𝐹)) | |
| 8 | 3, 6, 7 | mpbir2an 724 | . . 3 ⊢ 𝐹:dom 𝐹–1-1→ran 𝐹 |
| 9 | rinvbij.4a | . . 3 ⊢ 𝐴 ⊆ dom 𝐹 | |
| 10 | f1ores 6836 | . . 3 ⊢ ((𝐹:dom 𝐹–1-1→ran 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝐹 ↾ 𝐴):𝐴–1-1-onto→(𝐹 “ 𝐴)) | |
| 11 | 8, 9, 10 | mp2an 705 | . 2 ⊢ (𝐹 ↾ 𝐴):𝐴–1-1-onto→(𝐹 “ 𝐴) |
| 12 | rinvbij.3a | . . . 4 ⊢ (𝐹 “ 𝐴) ⊆ 𝐵 | |
| 13 | rinvbij.3b | . . . . . 6 ⊢ (𝐹 “ 𝐵) ⊆ 𝐴 | |
| 14 | rinvbij.4b | . . . . . . 7 ⊢ 𝐵 ⊆ dom 𝐹 | |
| 15 | funimass3 7050 | . . . . . . 7 ⊢ ((Fun 𝐹 ∧ 𝐵 ⊆ dom 𝐹) → ((𝐹 “ 𝐵) ⊆ 𝐴 ↔ 𝐵 ⊆ (◡𝐹 “ 𝐴))) | |
| 16 | 1, 14, 15 | mp2an 705 | . . . . . 6 ⊢ ((𝐹 “ 𝐵) ⊆ 𝐴 ↔ 𝐵 ⊆ (◡𝐹 “ 𝐴)) |
| 17 | 13, 16 | mpbi 233 | . . . . 5 ⊢ 𝐵 ⊆ (◡𝐹 “ 𝐴) |
| 18 | 4 | imaeq1i 6057 | . . . . 5 ⊢ (◡𝐹 “ 𝐴) = (𝐹 “ 𝐴) |
| 19 | 17, 18 | sseqtri 3982 | . . . 4 ⊢ 𝐵 ⊆ (𝐹 “ 𝐴) |
| 20 | 12, 19 | eqssi 3950 | . . 3 ⊢ (𝐹 “ 𝐴) = 𝐵 |
| 21 | f1oeq3 6811 | . . 3 ⊢ ((𝐹 “ 𝐴) = 𝐵 → ((𝐹 ↾ 𝐴):𝐴–1-1-onto→(𝐹 “ 𝐴) ↔ (𝐹 ↾ 𝐴):𝐴–1-1-onto→𝐵)) | |
| 22 | 20, 21 | ax-mp 5 | . 2 ⊢ ((𝐹 ↾ 𝐴):𝐴–1-1-onto→(𝐹 “ 𝐴) ↔ (𝐹 ↾ 𝐴):𝐴–1-1-onto→𝐵) |
| 23 | 11, 22 | mpbi 233 | 1 ⊢ (𝐹 ↾ 𝐴):𝐴–1-1-onto→𝐵 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 = wceq 1570 ⊆ wss 3902 ◡ccnv 5658 dom cdm 5659 ran crn 5660 ↾ cres 5661 “ cima 5662 Fun wfun 6531 ⟶wf 6533 –1-1→wf1 6534 –1-1-onto→wf1o 6536 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pr 5402 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-opab 5172 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 |
| This theorem is used by: ballotlem7 35034 |
| Copyright terms: Public domain | W3C validator |