| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > isof1oopb | Structured version Visualization version GIF version | ||
| Description: A function is a bijection iff it is an isomorphism regarding the universal class of ordered pairs as relations. (Contributed by AV, 9-May-2021.) |
| Ref | Expression |
|---|---|
| isof1oopb | ⊢ (𝐻:𝐴–1-1-onto→𝐵 ↔ 𝐻 Isom (V × V), (V × V)(𝐴, 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fvex 6898 | . . . . . . . . 9 ⊢ (𝐻‘𝑥) ∈ V | |
| 2 | fvex 6898 | . . . . . . . . 9 ⊢ (𝐻‘𝑦) ∈ V | |
| 3 | 1, 2 | opelvv 5705 | . . . . . . . 8 ⊢ 〈(𝐻‘𝑥), (𝐻‘𝑦)〉 ∈ (V × V) |
| 4 | df-br 5124 | . . . . . . . 8 ⊢ ((𝐻‘𝑥)(V × V)(𝐻‘𝑦) ↔ 〈(𝐻‘𝑥), (𝐻‘𝑦)〉 ∈ (V × V)) | |
| 5 | 3, 4 | mpbir 231 | . . . . . . 7 ⊢ (𝐻‘𝑥)(V × V)(𝐻‘𝑦) |
| 6 | 5 | a1i 11 | . . . . . 6 ⊢ (𝑥(V × V)𝑦 → (𝐻‘𝑥)(V × V)(𝐻‘𝑦)) |
| 7 | opelvvg 5706 | . . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → 〈𝑥, 𝑦〉 ∈ (V × V)) | |
| 8 | df-br 5124 | . . . . . . . 8 ⊢ (𝑥(V × V)𝑦 ↔ 〈𝑥, 𝑦〉 ∈ (V × V)) | |
| 9 | 7, 8 | sylibr 234 | . . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → 𝑥(V × V)𝑦) |
| 10 | 9 | a1d 25 | . . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → ((𝐻‘𝑥)(V × V)(𝐻‘𝑦) → 𝑥(V × V)𝑦)) |
| 11 | 6, 10 | impbid2 226 | . . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑥(V × V)𝑦 ↔ (𝐻‘𝑥)(V × V)(𝐻‘𝑦))) |
| 12 | 11 | adantl 481 | . . . 4 ⊢ ((𝐻:𝐴–1-1-onto→𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑥(V × V)𝑦 ↔ (𝐻‘𝑥)(V × V)(𝐻‘𝑦))) |
| 13 | 12 | ralrimivva 3189 | . . 3 ⊢ (𝐻:𝐴–1-1-onto→𝐵 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥(V × V)𝑦 ↔ (𝐻‘𝑥)(V × V)(𝐻‘𝑦))) |
| 14 | 13 | pm4.71i 559 | . 2 ⊢ (𝐻:𝐴–1-1-onto→𝐵 ↔ (𝐻:𝐴–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥(V × V)𝑦 ↔ (𝐻‘𝑥)(V × V)(𝐻‘𝑦)))) |
| 15 | df-isom 6549 | . 2 ⊢ (𝐻 Isom (V × V), (V × V)(𝐴, 𝐵) ↔ (𝐻:𝐴–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥(V × V)𝑦 ↔ (𝐻‘𝑥)(V × V)(𝐻‘𝑦)))) | |
| 16 | 14, 15 | bitr4i 278 | 1 ⊢ (𝐻:𝐴–1-1-onto→𝐵 ↔ 𝐻 Isom (V × V), (V × V)(𝐴, 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 ∈ wcel 2107 ∀wral 3050 Vcvv 3463 〈cop 4612 class class class wbr 5123 × cxp 5663 –1-1-onto→wf1o 6539 ‘cfv 6540 Isom wiso 6541 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-ext 2706 ax-sep 5276 ax-nul 5286 ax-pr 5412 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-sb 2064 df-clab 2713 df-cleq 2726 df-clel 2808 df-ne 2932 df-ral 3051 df-rex 3060 df-rab 3420 df-v 3465 df-dif 3934 df-un 3936 df-ss 3948 df-nul 4314 df-if 4506 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4888 df-br 5124 df-opab 5186 df-xp 5671 df-iota 6493 df-fv 6548 df-isom 6549 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |