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

Theorem breng 8933
Description: Equinumerosity relation. This variation of bren 8934 does not require the Axiom of Union. (Contributed by NM, 15-Jun-1998.) Extract from a subproof of bren 8934. (Revised by BTernaryTau, 23-Sep-2024.)
Assertion
Ref Expression
breng ((𝐴𝑉𝐵𝑊) → (𝐴𝐵 ↔ ∃𝑓 𝑓:𝐴1-1-onto𝐵))
Distinct variable groups:   𝐴,𝑓   𝐵,𝑓
Allowed substitution hints:   𝑉(𝑓)   𝑊(𝑓)

Proof of Theorem breng
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 f1oeq2 6810 . . 3 (𝑥 = 𝐴 → (𝑓:𝑥1-1-onto𝑦𝑓:𝐴1-1-onto𝑦))
21exbidv 1924 . 2 (𝑥 = 𝐴 → (∃𝑓 𝑓:𝑥1-1-onto𝑦 ↔ ∃𝑓 𝑓:𝐴1-1-onto𝑦))
3 f1oeq3 6811 . . 3 (𝑦 = 𝐵 → (𝑓:𝐴1-1-onto𝑦𝑓:𝐴1-1-onto𝐵))
43exbidv 1924 . 2 (𝑦 = 𝐵 → (∃𝑓 𝑓:𝐴1-1-onto𝑦 ↔ ∃𝑓 𝑓:𝐴1-1-onto𝐵))
5 df-en 8925 . 2 ≈ = {⟨𝑥, 𝑦⟩ ∣ ∃𝑓 𝑓:𝑥1-1-onto𝑦}
62, 4, 5brabg 5533 1 ((𝐴𝑉𝐵𝑊) → (𝐴𝐵 ↔ ∃𝑓 𝑓:𝐴1-1-onto𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1541  wex 1781  wcel 2106   class class class wbr 5142  1-1-ontowf1o 6532  cen 8921
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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2703  ax-sep 5293  ax-nul 5300  ax-pr 5421
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-sb 2068  df-clab 2710  df-cleq 2724  df-clel 2810  df-rab 3433  df-v 3476  df-dif 3948  df-un 3950  df-in 3952  df-ss 3962  df-nul 4320  df-if 4524  df-sn 4624  df-pr 4626  df-op 4630  df-br 5143  df-opab 5205  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-en 8925
This theorem is referenced by:  bren  8934  f1oen4g  8945  en0  8998  en0r  9001  ensn1  9002  en1  9006  en2sn  9026  en2prd  9033  rexdif1en  9143  snnen2o  9222  1sdom2dom  9232
  Copyright terms: Public domain W3C validator