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

Theorem breng 8613
Description: Equinumerosity relation. This variation of bren 8614 does not require the Axiom of Union. (Contributed 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 6628 . . 3 (𝑥 = 𝐴 → (𝑓:𝑥1-1-onto𝑦𝑓:𝐴1-1-onto𝑦))
21exbidv 1929 . 2 (𝑥 = 𝐴 → (∃𝑓 𝑓:𝑥1-1-onto𝑦 ↔ ∃𝑓 𝑓:𝐴1-1-onto𝑦))
3 f1oeq3 6629 . . 3 (𝑦 = 𝐵 → (𝑓:𝐴1-1-onto𝑦𝑓:𝐴1-1-onto𝐵))
43exbidv 1929 . 2 (𝑦 = 𝐵 → (∃𝑓 𝑓:𝐴1-1-onto𝑦 ↔ ∃𝑓 𝑓:𝐴1-1-onto𝐵))
5 df-en 8605 . 2 ≈ = {⟨𝑥, 𝑦⟩ ∣ ∃𝑓 𝑓:𝑥1-1-onto𝑦}
62, 4, 5brabg 5405 1 ((𝐴𝑉𝐵𝑊) → (𝐴𝐵 ↔ ∃𝑓 𝑓:𝐴1-1-onto𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 399   = wceq 1543  wex 1787  wcel 2112   class class class wbr 5039  1-1-ontowf1o 6357  cen 8601
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2018  ax-8 2114  ax-9 2122  ax-ext 2708  ax-sep 5177  ax-nul 5184  ax-pr 5307
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-sb 2073  df-clab 2715  df-cleq 2728  df-clel 2809  df-rab 3060  df-v 3400  df-dif 3856  df-un 3858  df-in 3860  df-ss 3870  df-nul 4224  df-if 4426  df-sn 4528  df-pr 4530  df-op 4534  df-br 5040  df-opab 5102  df-fn 6361  df-f 6362  df-f1 6363  df-fo 6364  df-f1o 6365  df-en 8605
This theorem is referenced by:  bren  8614  en0  8669  ensn1  8672  en1  8676  en2sn  8696
  Copyright terms: Public domain W3C validator