| 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 7276 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ ◡𝐹 = 𝐹) → 𝐹:𝐴–1-1-onto→𝐴) | |
| 2 | fveq1 6872 | . . . . . 6 ⊢ (◡𝐹 = 𝐹 → (◡𝐹‘(𝐹‘𝑥)) = (𝐹‘(𝐹‘𝑥))) | |
| 3 | 2 | ad2antlr 740 | . . . . 5 ⊢ (((𝐹 Fn 𝐴 ∧ ◡𝐹 = 𝐹) ∧ 𝑥 ∈ 𝐴) → (◡𝐹‘(𝐹‘𝑥)) = (𝐹‘(𝐹‘𝑥))) |
| 4 | f1ocnvfv1 7272 | . . . . . 6 ⊢ ((𝐹:𝐴–1-1-onto→𝐴 ∧ 𝑥 ∈ 𝐴) → (◡𝐹‘(𝐹‘𝑥)) = 𝑥) | |
| 5 | 1, 4 | sylan 592 | . . . . 5 ⊢ (((𝐹 Fn 𝐴 ∧ ◡𝐹 = 𝐹) ∧ 𝑥 ∈ 𝐴) → (◡𝐹‘(𝐹‘𝑥)) = 𝑥) |
| 6 | 3, 5 | eqtr3d 2797 | . . . 4 ⊢ (((𝐹 Fn 𝐴 ∧ ◡𝐹 = 𝐹) ∧ 𝑥 ∈ 𝐴) → (𝐹‘(𝐹‘𝑥)) = 𝑥) |
| 7 | 6 | ralrimiva 3154 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ ◡𝐹 = 𝐹) → ∀𝑥 ∈ 𝐴 (𝐹‘(𝐹‘𝑥)) = 𝑥) |
| 8 | 1, 7 | jca 521 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ ◡𝐹 = 𝐹) → (𝐹:𝐴–1-1-onto→𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘(𝐹‘𝑥)) = 𝑥)) |
| 9 | f1of 6812 | . . 3 ⊢ (𝐹:𝐴–1-1-onto→𝐴 → 𝐹:𝐴⟶𝐴) | |
| 10 | ffn 6697 | . . . . 5 ⊢ (𝐹:𝐴⟶𝐴 → 𝐹 Fn 𝐴) | |
| 11 | 10 | adantr 486 | . . . 4 ⊢ ((𝐹:𝐴⟶𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘(𝐹‘𝑥)) = 𝑥) → 𝐹 Fn 𝐴) |
| 12 | nvocnv 7277 | . . . 4 ⊢ ((𝐹:𝐴⟶𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘(𝐹‘𝑥)) = 𝑥) → ◡𝐹 = 𝐹) | |
| 13 | 11, 12 | jca 521 | . . 3 ⊢ ((𝐹:𝐴⟶𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘(𝐹‘𝑥)) = 𝑥) → (𝐹 Fn 𝐴 ∧ ◡𝐹 = 𝐹)) |
| 14 | 9, 13 | sylan 592 | . 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 401 = wceq 1570 ∈ wcel 2145 ∀wral 3076 ◡ccnv 5646 Fn wfn 6522 ⟶wf 6523 –1-1-onto→wf1o 6526 ‘cfv 6527 |
| 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 2213 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pr 5390 |
| 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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-iota 6483 df-fun 6529 df-fn 6530 df-f 6531 df-f1 6532 df-fo 6533 df-f1o 6534 df-fv 6535 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |