ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  bren GIF version

Theorem bren 7035
Description: Equinumerosity relation. (Contributed by NM, 15-Jun-1998.)
Assertion
Ref Expression
bren (𝐴 ≈ 𝐵 ↔ ∃𝑓 𝑓:𝐴–1-1-onto→𝐵)
Distinct variable groups:   𝐴,𝑓   𝐵,𝑓

Proof of Theorem bren
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 encv 7033 . 2 (𝐴 ≈ 𝐵 → (𝐴 ∈ V ∧ 𝐵 ∈ V))
2 f1ofn 5643 . . . . 5 (𝑓:𝐴–1-1-onto→𝐵 → 𝑓 Fn 𝐴)
3 fndm 5483 . . . . . 6 (𝑓 Fn 𝐴 → dom 𝑓 = 𝐴)
4 vex 2824 . . . . . . 7 𝑓 ∈ V
54dmex 5051 . . . . . 6 dom 𝑓 ∈ V
63, 5eqeltrrdi 2330 . . . . 5 (𝑓 Fn 𝐴 → 𝐴 ∈ V)
72, 6syl 14 . . . 4 (𝑓:𝐴–1-1-onto→𝐵 → 𝐴 ∈ V)
8 f1ofo 5649 . . . . . 6 (𝑓:𝐴–1-1-onto→𝐵 → 𝑓:𝐴–onto→𝐵)
9 forn 5621 . . . . . 6 (𝑓:𝐴–onto→𝐵 → ran 𝑓 = 𝐵)
108, 9syl 14 . . . . 5 (𝑓:𝐴–1-1-onto→𝐵 → ran 𝑓 = 𝐵)
114rnex 5052 . . . . 5 ran 𝑓 ∈ V
1210, 11eqeltrrdi 2330 . . . 4 (𝑓:𝐴–1-1-onto→𝐵 → 𝐵 ∈ V)
137, 12jca 306 . . 3 (𝑓:𝐴–1-1-onto→𝐵 → (𝐴 ∈ V ∧ 𝐵 ∈ V))
1413exlimiv 1651 . 2 (∃𝑓 𝑓:𝐴–1-1-onto→𝐵 → (𝐴 ∈ V ∧ 𝐵 ∈ V))
15 f1oeq2 5631 . . . 4 (𝑥 = 𝐴 → (𝑓:𝑥–1-1-onto→𝑦 ↔ 𝑓:𝐴–1-1-onto→𝑦))
1615exbidv 1878 . . 3 (𝑥 = 𝐴 → (∃𝑓 𝑓:𝑥–1-1-onto→𝑦 ↔ ∃𝑓 𝑓:𝐴–1-1-onto→𝑦))
17 f1oeq3 5632 . . . 4 (𝑦 = 𝐵 → (𝑓:𝐴–1-1-onto→𝑦 ↔ 𝑓:𝐴–1-1-onto→𝐵))
1817exbidv 1878 . . 3 (𝑦 = 𝐵 → (∃𝑓 𝑓:𝐴–1-1-onto→𝑦 ↔ ∃𝑓 𝑓:𝐴–1-1-onto→𝐵))
19 df-en 7028 . . 3 ≈ = {⟨𝑥, 𝑦⟩ ∣ ∃𝑓 𝑓:𝑥–1-1-onto→𝑦}
2016, 18, 19brabg 4413 . 2 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴 ≈ 𝐵 ↔ ∃𝑓 𝑓:𝐴–1-1-onto→𝐵))
211, 14, 20pm5.21nii 716 1 (𝐴 ≈ 𝐵 ↔ ∃𝑓 𝑓:𝐴–1-1-onto→𝐵)
Colors of variables:    wff set class
This proof depends on syntax axioms:   ∧ wa 104   ↔ wb 105   = wceq 1402  ∃wex 1545   ∈ wcel 2209  Vcvv 2821   class class class wbr 4131  dom cdm 4776  ran crn 4777   Fn wfn 5375  –onto→wfo 5378  –1-1-onto→wf1o 5379   ≈ cen 7025
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4132  df-opab 4194  df-xp 4782  df-rel 4783  df-cnv 4784  df-dm 4786  df-rn 4787  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-en 7028
This theorem is used by:  domen  7040  f1oen3g  7045  ener  7071  en0  7087  ensn1  7088  en1  7091  unen  7110  en2  7117  enm  7123  xpen  7150  mapen  7151  ssenen  7157  phplem4  7161  phplem4on  7174  fidceq  7176  dif1en  7188  fin0  7194  fin0or  7195  en2eqpr  7219  fiintim  7243  fidcenumlemim  7275  enomnilem  7485  enmkvlem  7508  enwomnilem  7516  pr2cv1  7548  cc3  7641  hasheqf1o  11247  hashfacen  11307  fz1f1o  12167  nninfct  12844  eulerth  13041  ennnfonelemim  13374  exmidunben  13376  ctinfom  13378  qnnen  13381  enctlem  13382  ctiunct  13390  gsumf1ofi  14251  gsummhmfi  14265  gsumressfi  14268  exmidsbthrlem  17285  sbthom  17289
  Copyright terms: Public domain W3C validator