| Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > nvocnvb | Structured version Visualization version GIF version | ||
| Description: Equivalence to saying the converse of an involution is the function itself. (Contributed by RP, 13-Oct-2024.) |
| Ref | Expression |
|---|---|
| nvocnvb | ⊢ ((𝐹 Fn 𝐴 ∧ ◡𝐹 = 𝐹) ↔ (𝐹:𝐴–1-1-onto→𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘(𝐹‘𝑥)) = 𝑥)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nvof1o 7278 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ ◡𝐹 = 𝐹) → 𝐹:𝐴–1-1-onto→𝐴) | |
| 2 | fveq1 6880 | . . . . . 6 ⊢ (◡𝐹 = 𝐹 → (◡𝐹‘(𝐹‘𝑥)) = (𝐹‘(𝐹‘𝑥))) | |
| 3 | 2 | ad2antlr 739 | . . . . 5 ⊢ (((𝐹 Fn 𝐴 ∧ ◡𝐹 = 𝐹) ∧ 𝑥 ∈ 𝐴) → (◡𝐹‘(𝐹‘𝑥)) = (𝐹‘(𝐹‘𝑥))) |
| 4 | f1ocnvfv1 7274 | . . . . . 6 ⊢ ((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝑥 ∈ 𝐴) → (◡𝐹‘(𝐹‘𝑥)) = 𝑥) | |
| 5 | 1, 4 | sylan 591 | . . . . 5 ⊢ (((𝐹 Fn 𝐴 ∧ ◡𝐹 = 𝐹) ∧ 𝑥 ∈ 𝐴) → (◡𝐹‘(𝐹‘𝑥)) = 𝑥) |
| 6 | 3, 5 | eqtr3d 2799 | . . . 4 ⊢ (((𝐹 Fn 𝐴 ∧ ◡𝐹 = 𝐹) ∧ 𝑥 ∈ 𝐴) → (𝐹‘(𝐹‘𝑥)) = 𝑥) |
| 7 | 6 | ralrimiva 3156 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ ◡𝐹 = 𝐹) → ∀𝑥 ∈ 𝐴 (𝐹‘(𝐹‘𝑥)) = 𝑥) |
| 8 | 1, 7 | jca 520 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ ◡𝐹 = 𝐹) → (𝐹:𝐴–1-1-onto→𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘(𝐹‘𝑥)) = 𝑥)) |
| 9 | f1of 6820 | . . 3 ⊢ (𝐹:𝐴–1-1-onto→𝐴 → 𝐹:𝐴⟶𝐴) | |
| 10 | ffn 6705 | . . . . 5 ⊢ (𝐹:𝐴⟶𝐴 → 𝐹 Fn 𝐴) | |
| 11 | 10 | adantr 485 | . . . 4 ⊢ ((𝐹:𝐴⟶𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘(𝐹‘𝑥)) = 𝑥) → 𝐹 Fn 𝐴) |
| 12 | nvocnv 7279 | . . . 4 ⊢ ((𝐹:𝐴⟶𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘(𝐹‘𝑥)) = 𝑥) → ◡𝐹 = 𝐹) | |
| 13 | 11, 12 | jca 520 | . . 3 ⊢ ((𝐹:𝐴⟶𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘(𝐹‘𝑥)) = 𝑥) → (𝐹 Fn 𝐴 ∧ ◡𝐹 = 𝐹)) |
| 14 | 9, 13 | sylan 591 | . 2 ⊢ ((𝐹:𝐴–1-1-onto→𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘(𝐹‘𝑥)) = 𝑥) → (𝐹 Fn 𝐴 ∧ ◡𝐹 = 𝐹)) |
| 15 | 8, 14 | impbii 212 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ ◡𝐹 = 𝐹) ↔ (𝐹:𝐴–1-1-onto→𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘(𝐹‘𝑥)) = 𝑥)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 400 = wceq 1569 ∈ wcel 2142 ∀wral 3078 ◡ccnv 5659 Fn wfn 6531 ⟶wf 6532 –1-1-onto→wf1o 6535 ‘cfv 6536 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5256 ax-nul 5268 ax-pr 5403 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3416 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-br 5109 df-opab 5173 df-mpt 5192 df-id 5555 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |