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

Theorem breng 8938
Description: Equinumerosity relation. This variation of bren 8939 does not require the Axiom of Union. (Contributed by NM, 15-Jun-1998.) Extract from a subproof of bren 8939. (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 6797 . . 3 (𝑥 = 𝐴 → (𝑓:𝑥1-1-onto𝑦𝑓:𝐴1-1-onto𝑦))
21exbidv 1943 . 2 (𝑥 = 𝐴 → (∃𝑓 𝑓:𝑥1-1-onto𝑦 ↔ ∃𝑓 𝑓:𝐴1-1-onto𝑦))
3 f1oeq3 6798 . . 3 (𝑦 = 𝐵 → (𝑓:𝐴1-1-onto𝑦𝑓:𝐴1-1-onto𝐵))
43exbidv 1943 . 2 (𝑦 = 𝐵 → (∃𝑓 𝑓:𝐴1-1-onto𝑦 ↔ ∃𝑓 𝑓:𝐴1-1-onto𝐵))
5 df-en 8930 . 2 ≈ = {⟨𝑥, 𝑦⟩ ∣ ∃𝑓 𝑓:𝑥1-1-onto𝑦}
62, 4, 5brabg 5512 1 ((𝐴𝑉𝐵𝑊) → (𝐴𝐵 ↔ ∃𝑓 𝑓:𝐴1-1-onto𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399   = wceq 1562  wex 1801  wcel 2144   class class class wbr 5102  1-1-ontowf1o 6522  cen 8926
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-ext 2736  ax-sep 5248  ax-pr 5392
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-sb 2093  df-clab 2743  df-cleq 2756  df-clel 2839  df-rab 3417  df-v 3458  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5103  df-opab 5165  df-fn 6526  df-f 6527  df-f1 6528  df-fo 6529  df-f1o 6530  df-en 8930
This theorem is referenced by:  bren  8939  f1oen4g  8947  en0  9001  en0r  9003  ensn1  9004  en1  9007  en2sn  9024  en2prd  9030  rexdif1en  9131  snnen2o  9191  1sdom2dom  9200  clnbgr3stgrgrlic  48647
  Copyright terms: Public domain W3C validator