MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  isof1oopb Structured version   Visualization version   GIF version

Theorem isof1oopb 7271
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.)
Assertion
Ref Expression
isof1oopb (𝐻:𝐴1-1-onto𝐵𝐻 Isom (V × V), (V × V)(𝐴, 𝐵))

Proof of Theorem isof1oopb
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fvex 6847 . . . . . . . . 9 (𝐻𝑥) ∈ V
2 fvex 6847 . . . . . . . . 9 (𝐻𝑦) ∈ V
31, 2opelvv 5664 . . . . . . . 8 ⟨(𝐻𝑥), (𝐻𝑦)⟩ ∈ (V × V)
4 df-br 5099 . . . . . . . 8 ((𝐻𝑥)(V × V)(𝐻𝑦) ↔ ⟨(𝐻𝑥), (𝐻𝑦)⟩ ∈ (V × V))
53, 4mpbir 231 . . . . . . 7 (𝐻𝑥)(V × V)(𝐻𝑦)
65a1i 11 . . . . . 6 (𝑥(V × V)𝑦 → (𝐻𝑥)(V × V)(𝐻𝑦))
7 opelvvg 5665 . . . . . . . 8 ((𝑥𝐴𝑦𝐴) → ⟨𝑥, 𝑦⟩ ∈ (V × V))
8 df-br 5099 . . . . . . . 8 (𝑥(V × V)𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ (V × V))
97, 8sylibr 234 . . . . . . 7 ((𝑥𝐴𝑦𝐴) → 𝑥(V × V)𝑦)
109a1d 25 . . . . . 6 ((𝑥𝐴𝑦𝐴) → ((𝐻𝑥)(V × V)(𝐻𝑦) → 𝑥(V × V)𝑦))
116, 10impbid2 226 . . . . 5 ((𝑥𝐴𝑦𝐴) → (𝑥(V × V)𝑦 ↔ (𝐻𝑥)(V × V)(𝐻𝑦)))
1211adantl 481 . . . 4 ((𝐻:𝐴1-1-onto𝐵 ∧ (𝑥𝐴𝑦𝐴)) → (𝑥(V × V)𝑦 ↔ (𝐻𝑥)(V × V)(𝐻𝑦)))
1312ralrimivva 3179 . . 3 (𝐻:𝐴1-1-onto𝐵 → ∀𝑥𝐴𝑦𝐴 (𝑥(V × V)𝑦 ↔ (𝐻𝑥)(V × V)(𝐻𝑦)))
1413pm4.71i 559 . 2 (𝐻:𝐴1-1-onto𝐵 ↔ (𝐻:𝐴1-1-onto𝐵 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥(V × V)𝑦 ↔ (𝐻𝑥)(V × V)(𝐻𝑦))))
15 df-isom 6501 . 2 (𝐻 Isom (V × V), (V × V)(𝐴, 𝐵) ↔ (𝐻:𝐴1-1-onto𝐵 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥(V × V)𝑦 ↔ (𝐻𝑥)(V × V)(𝐻𝑦))))
1614, 15bitr4i 278 1 (𝐻:𝐴1-1-onto𝐵𝐻 Isom (V × V), (V × V)(𝐴, 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395  wcel 2113  wral 3051  Vcvv 3440  cop 4586   class class class wbr 5098   × cxp 5622  1-1-ontowf1o 6491  cfv 6492   Isom wiso 6493
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-opab 5161  df-xp 5630  df-iota 6448  df-fv 6500  df-isom 6501
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator