![]() |
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 6903 | . . . . . . . . 9 ⊢ (𝐻‘𝑥) ∈ V | |
2 | fvex 6903 | . . . . . . . . 9 ⊢ (𝐻‘𝑦) ∈ V | |
3 | 1, 2 | opelvv 5715 | . . . . . . . 8 ⊢ ⟨(𝐻‘𝑥), (𝐻‘𝑦)⟩ ∈ (V × V) |
4 | df-br 5148 | . . . . . . . 8 ⊢ ((𝐻‘𝑥)(V × V)(𝐻‘𝑦) ↔ ⟨(𝐻‘𝑥), (𝐻‘𝑦)⟩ ∈ (V × V)) | |
5 | 3, 4 | mpbir 230 | . . . . . . 7 ⊢ (𝐻‘𝑥)(V × V)(𝐻‘𝑦) |
6 | 5 | a1i 11 | . . . . . 6 ⊢ (𝑥(V × V)𝑦 → (𝐻‘𝑥)(V × V)(𝐻‘𝑦)) |
7 | opelvvg 5716 | . . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → ⟨𝑥, 𝑦⟩ ∈ (V × V)) | |
8 | df-br 5148 | . . . . . . . 8 ⊢ (𝑥(V × V)𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ (V × V)) | |
9 | 7, 8 | sylibr 233 | . . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → 𝑥(V × V)𝑦) |
10 | 9 | a1d 25 | . . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → ((𝐻‘𝑥)(V × V)(𝐻‘𝑦) → 𝑥(V × V)𝑦)) |
11 | 6, 10 | impbid2 225 | . . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑥(V × V)𝑦 ↔ (𝐻‘𝑥)(V × V)(𝐻‘𝑦))) |
12 | 11 | adantl 480 | . . . 4 ⊢ ((𝐻:𝐴–1-1-onto→𝐵 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑥(V × V)𝑦 ↔ (𝐻‘𝑥)(V × V)(𝐻‘𝑦))) |
13 | 12 | ralrimivva 3198 | . . 3 ⊢ (𝐻:𝐴–1-1-onto→𝐵 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥(V × V)𝑦 ↔ (𝐻‘𝑥)(V × V)(𝐻‘𝑦))) |
14 | 13 | pm4.71i 558 | . 2 ⊢ (𝐻:𝐴–1-1-onto→𝐵 ↔ (𝐻:𝐴–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥(V × V)𝑦 ↔ (𝐻‘𝑥)(V × V)(𝐻‘𝑦)))) |
15 | df-isom 6551 | . 2 ⊢ (𝐻 Isom (V × V), (V × V)(𝐴, 𝐵) ↔ (𝐻:𝐴–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥(V × V)𝑦 ↔ (𝐻‘𝑥)(V × V)(𝐻‘𝑦)))) | |
16 | 14, 15 | bitr4i 277 | 1 ⊢ (𝐻:𝐴–1-1-onto→𝐵 ↔ 𝐻 Isom (V × V), (V × V)(𝐴, 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∧ wa 394 ∈ wcel 2104 ∀wral 3059 Vcvv 3472 ⟨cop 4633 class class class wbr 5147 × cxp 5673 –1-1-onto→wf1o 6541 ‘cfv 6542 Isom wiso 6543 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-ext 2701 ax-sep 5298 ax-nul 5305 ax-pr 5426 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-sb 2066 df-clab 2708 df-cleq 2722 df-clel 2808 df-ne 2939 df-ral 3060 df-rex 3069 df-rab 3431 df-v 3474 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4322 df-if 4528 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-br 5148 df-opab 5210 df-xp 5681 df-iota 6494 df-fv 6550 df-isom 6551 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |