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

Theorem brenOLD 8702
Description: Obsolete version of bren 8701 as of 23-Sep-2024. (Contributed by NM, 15-Jun-1998.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
brenOLD (𝐴𝐵 ↔ ∃𝑓 𝑓:𝐴1-1-onto𝐵)
Distinct variable groups:   𝐴,𝑓   𝐵,𝑓

Proof of Theorem brenOLD
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 encv 8699 . 2 (𝐴𝐵 → (𝐴 ∈ V ∧ 𝐵 ∈ V))
2 f1ofn 6701 . . . . 5 (𝑓:𝐴1-1-onto𝐵𝑓 Fn 𝐴)
3 fndm 6520 . . . . . 6 (𝑓 Fn 𝐴 → dom 𝑓 = 𝐴)
4 vex 3426 . . . . . . 7 𝑓 ∈ V
54dmex 7732 . . . . . 6 dom 𝑓 ∈ V
63, 5eqeltrrdi 2848 . . . . 5 (𝑓 Fn 𝐴𝐴 ∈ V)
72, 6syl 17 . . . 4 (𝑓:𝐴1-1-onto𝐵𝐴 ∈ V)
8 f1ofo 6707 . . . . . 6 (𝑓:𝐴1-1-onto𝐵𝑓:𝐴onto𝐵)
9 forn 6675 . . . . . 6 (𝑓:𝐴onto𝐵 → ran 𝑓 = 𝐵)
108, 9syl 17 . . . . 5 (𝑓:𝐴1-1-onto𝐵 → ran 𝑓 = 𝐵)
114rnex 7733 . . . . 5 ran 𝑓 ∈ V
1210, 11eqeltrrdi 2848 . . . 4 (𝑓:𝐴1-1-onto𝐵𝐵 ∈ V)
137, 12jca 511 . . 3 (𝑓:𝐴1-1-onto𝐵 → (𝐴 ∈ V ∧ 𝐵 ∈ V))
1413exlimiv 1934 . 2 (∃𝑓 𝑓:𝐴1-1-onto𝐵 → (𝐴 ∈ V ∧ 𝐵 ∈ V))
15 f1oeq2 6689 . . . 4 (𝑥 = 𝐴 → (𝑓:𝑥1-1-onto𝑦𝑓:𝐴1-1-onto𝑦))
1615exbidv 1925 . . 3 (𝑥 = 𝐴 → (∃𝑓 𝑓:𝑥1-1-onto𝑦 ↔ ∃𝑓 𝑓:𝐴1-1-onto𝑦))
17 f1oeq3 6690 . . . 4 (𝑦 = 𝐵 → (𝑓:𝐴1-1-onto𝑦𝑓:𝐴1-1-onto𝐵))
1817exbidv 1925 . . 3 (𝑦 = 𝐵 → (∃𝑓 𝑓:𝐴1-1-onto𝑦 ↔ ∃𝑓 𝑓:𝐴1-1-onto𝐵))
19 df-en 8692 . . 3 ≈ = {⟨𝑥, 𝑦⟩ ∣ ∃𝑓 𝑓:𝑥1-1-onto𝑦}
2016, 18, 19brabg 5445 . 2 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴𝐵 ↔ ∃𝑓 𝑓:𝐴1-1-onto𝐵))
211, 14, 20pm5.21nii 379 1 (𝐴𝐵 ↔ ∃𝑓 𝑓:𝐴1-1-onto𝐵)
Colors of variables: wff setvar class
Syntax hints:  wb 205  wa 395   = wceq 1539  wex 1783  wcel 2108  Vcvv 3422   class class class wbr 5070  dom cdm 5580  ran crn 5581   Fn wfn 6413  ontowfo 6416  1-1-ontowf1o 6417  cen 8688
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347  ax-un 7566
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-xp 5586  df-rel 5587  df-cnv 5588  df-dm 5590  df-rn 5591  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-en 8692
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator