| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > rinvf1o | 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 6007 | . . . . 5 ⊢ (Fun 𝐹 ↔ 𝐹:dom 𝐹⟶ran 𝐹) | |
| 3 | 1, 2 | mpbi 145 | . . . 4 ⊢ 𝐹:dom 𝐹⟶ran 𝐹 |
| 4 | rinvbij.2 | . . . . . 6 ⊢ ◡𝐹 = 𝐹 | |
| 5 | 4 | funeqi 5378 | . . . . 5 ⊢ (Fun ◡𝐹 ↔ Fun 𝐹) |
| 6 | 1, 5 | mpbir 146 | . . . 4 ⊢ Fun ◡𝐹 |
| 7 | df-f1 5362 | . . . 4 ⊢ (𝐹:dom 𝐹–1-1→ran 𝐹 ↔ (𝐹:dom 𝐹⟶ran 𝐹 ∧ Fun ◡𝐹)) | |
| 8 | 3, 6, 7 | mpbir2an 951 | . . 3 ⊢ 𝐹:dom 𝐹–1-1→ran 𝐹 |
| 9 | rinvbij.4a | . . 3 ⊢ 𝐴 ⊆ dom 𝐹 | |
| 10 | f1ores 5634 | . . 3 ⊢ ((𝐹:dom 𝐹–1-1→ran 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝐹 ↾ 𝐴):𝐴–1-1-onto→(𝐹 “ 𝐴)) | |
| 11 | 8, 9, 10 | mp2an 426 | . 2 ⊢ (𝐹 ↾ 𝐴):𝐴–1-1-onto→(𝐹 “ 𝐴) |
| 12 | rinvbij.3a | . . . 4 ⊢ (𝐹 “ 𝐴) ⊆ 𝐵 | |
| 13 | rinvbij.3b | . . . . . 6 ⊢ (𝐹 “ 𝐵) ⊆ 𝐴 | |
| 14 | rinvbij.4b | . . . . . . 7 ⊢ 𝐵 ⊆ dom 𝐹 | |
| 15 | funimass3 5799 | . . . . . . 7 ⊢ ((Fun 𝐹 ∧ 𝐵 ⊆ dom 𝐹) → ((𝐹 “ 𝐵) ⊆ 𝐴 ↔ 𝐵 ⊆ (◡𝐹 “ 𝐴))) | |
| 16 | 1, 14, 15 | mp2an 426 | . . . . . 6 ⊢ ((𝐹 “ 𝐵) ⊆ 𝐴 ↔ 𝐵 ⊆ (◡𝐹 “ 𝐴)) |
| 17 | 13, 16 | mpbi 145 | . . . . 5 ⊢ 𝐵 ⊆ (◡𝐹 “ 𝐴) |
| 18 | 4 | imaeq1i 5103 | . . . . 5 ⊢ (◡𝐹 “ 𝐴) = (𝐹 “ 𝐴) |
| 19 | 17, 18 | sseqtri 3276 | . . . 4 ⊢ 𝐵 ⊆ (𝐹 “ 𝐴) |
| 20 | 12, 19 | eqssi 3258 | . . 3 ⊢ (𝐹 “ 𝐴) = 𝐵 |
| 21 | f1oeq3 5609 | . . 3 ⊢ ((𝐹 “ 𝐴) = 𝐵 → ((𝐹 ↾ 𝐴):𝐴–1-1-onto→(𝐹 “ 𝐴) ↔ (𝐹 ↾ 𝐴):𝐴–1-1-onto→𝐵)) | |
| 22 | 20, 21 | ax-mp 5 | . 2 ⊢ ((𝐹 ↾ 𝐴):𝐴–1-1-onto→(𝐹 “ 𝐴) ↔ (𝐹 ↾ 𝐴):𝐴–1-1-onto→𝐵) |
| 23 | 11, 22 | mpbi 145 | 1 ⊢ (𝐹 ↾ 𝐴):𝐴–1-1-onto→𝐵 |
| Colors of variables: wff set class |
| Syntax hints: ↔ wb 105 = wceq 1398 ⊆ wss 3214 ◡ccnv 4753 dom cdm 4754 ran crn 4755 ↾ cres 4756 “ cima 4757 Fun wfun 5351 ⟶wf 5353 –1-1→wf1 5354 –1-1-onto→wf1o 5356 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-14 2208 ax-ext 2216 ax-sep 4233 ax-pow 4292 ax-pr 4327 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ral 2527 df-rex 2528 df-v 2817 df-sbc 3046 df-un 3218 df-in 3220 df-ss 3227 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-br 4115 df-opab 4177 df-id 4419 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-ima 4767 df-iota 5317 df-fun 5359 df-fn 5360 df-f 5361 df-f1 5362 df-fo 5363 df-f1o 5364 df-fv 5365 |
| This theorem is referenced by: ballotfilem7 13223 |
| Copyright terms: Public domain | W3C validator |