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

Theorem isof1oopb 7273
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 6848 . . . . . . . . 9 (𝐻𝑥) ∈ V
2 fvex 6848 . . . . . . . . 9 (𝐻𝑦) ∈ V
31, 2opelvv 5665 . . . . . . . 8 ⟨(𝐻𝑥), (𝐻𝑦)⟩ ∈ (V × V)
4 df-br 5100 . . . . . . . 8 ((𝐻𝑥)(V × V)(𝐻𝑦) ↔ ⟨(𝐻𝑥), (𝐻𝑦)⟩ ∈ (V × V))
53, 4mpbir 231 . . . . . . 7 (𝐻𝑥)(V × V)(𝐻𝑦)
65a1i 11 . . . . . 6 (𝑥(V × V)𝑦 → (𝐻𝑥)(V × V)(𝐻𝑦))
7 opelvvg 5666 . . . . . . . 8 ((𝑥𝐴𝑦𝐴) → ⟨𝑥, 𝑦⟩ ∈ (V × V))
8 df-br 5100 . . . . . . . 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 3180 . . 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 6502 . 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 2114  wral 3052  Vcvv 3441  cop 4587   class class class wbr 5099   × cxp 5623  1-1-ontowf1o 6492  cfv 6493   Isom wiso 6494
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5242  ax-nul 5252  ax-pr 5378
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-ral 3053  df-rex 3062  df-rab 3401  df-v 3443  df-dif 3905  df-un 3907  df-ss 3919  df-nul 4287  df-if 4481  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-opab 5162  df-xp 5631  df-iota 6449  df-fv 6501  df-isom 6502
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator