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

Theorem f1ompt 7130
Description: Express bijection for a mapping operation. (Contributed by Mario Carneiro, 30-May-2015.) (Revised by Mario Carneiro, 4-Dec-2016.)
Hypothesis
Ref Expression
fmpt.1 𝐹 = (𝑥𝐴𝐶)
Assertion
Ref Expression
f1ompt (𝐹:𝐴1-1-onto𝐵 ↔ (∀𝑥𝐴 𝐶𝐵 ∧ ∀𝑦𝐵 ∃!𝑥𝐴 𝑦 = 𝐶))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑦,𝐶   𝑦,𝐹
Allowed substitution hints:   𝐶(𝑥)   𝐹(𝑥)

Proof of Theorem f1ompt
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 ffn 6735 . . . . 5 (𝐹:𝐴𝐵𝐹 Fn 𝐴)
2 dff1o4 6855 . . . . . 6 (𝐹:𝐴1-1-onto𝐵 ↔ (𝐹 Fn 𝐴𝐹 Fn 𝐵))
32baib 535 . . . . 5 (𝐹 Fn 𝐴 → (𝐹:𝐴1-1-onto𝐵𝐹 Fn 𝐵))
41, 3syl 17 . . . 4 (𝐹:𝐴𝐵 → (𝐹:𝐴1-1-onto𝐵𝐹 Fn 𝐵))
5 fnres 6694 . . . . . 6 ((𝐹𝐵) Fn 𝐵 ↔ ∀𝑦𝐵 ∃!𝑧 𝑦𝐹𝑧)
6 nfcv 2904 . . . . . . . . . 10 𝑥𝑧
7 fmpt.1 . . . . . . . . . . 11 𝐹 = (𝑥𝐴𝐶)
8 nfmpt1 5249 . . . . . . . . . . 11 𝑥(𝑥𝐴𝐶)
97, 8nfcxfr 2902 . . . . . . . . . 10 𝑥𝐹
10 nfcv 2904 . . . . . . . . . 10 𝑥𝑦
116, 9, 10nfbr 5189 . . . . . . . . 9 𝑥 𝑧𝐹𝑦
12 nfv 1913 . . . . . . . . 9 𝑧(𝑥𝐴𝑦 = 𝐶)
13 breq1 5145 . . . . . . . . . 10 (𝑧 = 𝑥 → (𝑧𝐹𝑦𝑥𝐹𝑦))
14 df-mpt 5225 . . . . . . . . . . . . 13 (𝑥𝐴𝐶) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐶)}
157, 14eqtri 2764 . . . . . . . . . . . 12 𝐹 = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐶)}
1615breqi 5148 . . . . . . . . . . 11 (𝑥𝐹𝑦𝑥{⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐶)}𝑦)
17 df-br 5143 . . . . . . . . . . . 12 (𝑥{⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐶)}𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐶)})
18 opabidw 5528 . . . . . . . . . . . 12 (⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐶)} ↔ (𝑥𝐴𝑦 = 𝐶))
1917, 18bitri 275 . . . . . . . . . . 11 (𝑥{⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐶)}𝑦 ↔ (𝑥𝐴𝑦 = 𝐶))
2016, 19bitri 275 . . . . . . . . . 10 (𝑥𝐹𝑦 ↔ (𝑥𝐴𝑦 = 𝐶))
2113, 20bitrdi 287 . . . . . . . . 9 (𝑧 = 𝑥 → (𝑧𝐹𝑦 ↔ (𝑥𝐴𝑦 = 𝐶)))
2211, 12, 21cbveuw 2605 . . . . . . . 8 (∃!𝑧 𝑧𝐹𝑦 ↔ ∃!𝑥(𝑥𝐴𝑦 = 𝐶))
23 vex 3483 . . . . . . . . . 10 𝑦 ∈ V
24 vex 3483 . . . . . . . . . 10 𝑧 ∈ V
2523, 24brcnv 5892 . . . . . . . . 9 (𝑦𝐹𝑧𝑧𝐹𝑦)
2625eubii 2584 . . . . . . . 8 (∃!𝑧 𝑦𝐹𝑧 ↔ ∃!𝑧 𝑧𝐹𝑦)
27 df-reu 3380 . . . . . . . 8 (∃!𝑥𝐴 𝑦 = 𝐶 ↔ ∃!𝑥(𝑥𝐴𝑦 = 𝐶))
2822, 26, 273bitr4i 303 . . . . . . 7 (∃!𝑧 𝑦𝐹𝑧 ↔ ∃!𝑥𝐴 𝑦 = 𝐶)
2928ralbii 3092 . . . . . 6 (∀𝑦𝐵 ∃!𝑧 𝑦𝐹𝑧 ↔ ∀𝑦𝐵 ∃!𝑥𝐴 𝑦 = 𝐶)
305, 29bitri 275 . . . . 5 ((𝐹𝐵) Fn 𝐵 ↔ ∀𝑦𝐵 ∃!𝑥𝐴 𝑦 = 𝐶)
31 relcnv 6121 . . . . . . 7 Rel 𝐹
32 df-rn 5695 . . . . . . . 8 ran 𝐹 = dom 𝐹
33 frn 6742 . . . . . . . 8 (𝐹:𝐴𝐵 → ran 𝐹𝐵)
3432, 33eqsstrrid 4022 . . . . . . 7 (𝐹:𝐴𝐵 → dom 𝐹𝐵)
35 relssres 6039 . . . . . . 7 ((Rel 𝐹 ∧ dom 𝐹𝐵) → (𝐹𝐵) = 𝐹)
3631, 34, 35sylancr 587 . . . . . 6 (𝐹:𝐴𝐵 → (𝐹𝐵) = 𝐹)
3736fneq1d 6660 . . . . 5 (𝐹:𝐴𝐵 → ((𝐹𝐵) Fn 𝐵𝐹 Fn 𝐵))
3830, 37bitr3id 285 . . . 4 (𝐹:𝐴𝐵 → (∀𝑦𝐵 ∃!𝑥𝐴 𝑦 = 𝐶𝐹 Fn 𝐵))
394, 38bitr4d 282 . . 3 (𝐹:𝐴𝐵 → (𝐹:𝐴1-1-onto𝐵 ↔ ∀𝑦𝐵 ∃!𝑥𝐴 𝑦 = 𝐶))
4039pm5.32i 574 . 2 ((𝐹:𝐴𝐵𝐹:𝐴1-1-onto𝐵) ↔ (𝐹:𝐴𝐵 ∧ ∀𝑦𝐵 ∃!𝑥𝐴 𝑦 = 𝐶))
41 f1of 6847 . . 3 (𝐹:𝐴1-1-onto𝐵𝐹:𝐴𝐵)
4241pm4.71ri 560 . 2 (𝐹:𝐴1-1-onto𝐵 ↔ (𝐹:𝐴𝐵𝐹:𝐴1-1-onto𝐵))
437fmpt 7129 . . 3 (∀𝑥𝐴 𝐶𝐵𝐹:𝐴𝐵)
4443anbi1i 624 . 2 ((∀𝑥𝐴 𝐶𝐵 ∧ ∀𝑦𝐵 ∃!𝑥𝐴 𝑦 = 𝐶) ↔ (𝐹:𝐴𝐵 ∧ ∀𝑦𝐵 ∃!𝑥𝐴 𝑦 = 𝐶))
4540, 42, 443bitr4i 303 1 (𝐹:𝐴1-1-onto𝐵 ↔ (∀𝑥𝐴 𝐶𝐵 ∧ ∀𝑦𝐵 ∃!𝑥𝐴 𝑦 = 𝐶))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395   = wceq 1539  wcel 2107  ∃!weu 2567  wral 3060  ∃!wreu 3377  wss 3950  cop 4631   class class class wbr 5142  {copab 5204  cmpt 5224  ccnv 5683  dom cdm 5684  ran crn 5685  cres 5686  Rel wrel 5689   Fn wfn 6555  wf 6556  1-1-ontowf1o 6559
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2707  ax-sep 5295  ax-nul 5305  ax-pr 5431
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2728  df-clel 2815  df-nfc 2891  df-ral 3061  df-rex 3070  df-reu 3380  df-rab 3436  df-v 3481  df-dif 3953  df-un 3955  df-in 3957  df-ss 3967  df-nul 4333  df-if 4525  df-sn 4626  df-pr 4628  df-op 4632  df-br 5143  df-opab 5205  df-mpt 5225  df-id 5577  df-xp 5690  df-rel 5691  df-cnv 5692  df-co 5693  df-dm 5694  df-rn 5695  df-res 5696  df-ima 5697  df-fun 6562  df-fn 6563  df-f 6564  df-f1 6565  df-fo 6566  df-f1o 6567
This theorem is referenced by:  oaf1o  8602  xpf1o  9180  icoshftf1o  13515  fprodser  15986  dfod2  19583  gsummptf1o  19982  nbusgrf1o0  29387  cusgrfilem2  29475  numclwlk2lem2f1o  30399  f1mptrn  32646  ccatws1f1o  32937  gsummptfsf1o  33058  xrmulc1cn  33930  poimirlem4  37632  poimirlem16  37644  poimirlem17  37645  poimirlem19  37647  poimirlem20  37648  isuspgrim0lem  47876  isuspgrim0  47877  isuspgrimlem  47879
  Copyright terms: Public domain W3C validator