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

Theorem f1ompt 5827
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 5507 . . . . 5 (𝐹:𝐴𝐵𝐹 Fn 𝐴)
2 dff1o4 5621 . . . . . 6 (𝐹:𝐴1-1-onto𝐵 ↔ (𝐹 Fn 𝐴𝐹 Fn 𝐵))
32baib 927 . . . . 5 (𝐹 Fn 𝐴 → (𝐹:𝐴1-1-onto𝐵𝐹 Fn 𝐵))
41, 3syl 14 . . . 4 (𝐹:𝐴𝐵 → (𝐹:𝐴1-1-onto𝐵𝐹 Fn 𝐵))
5 fnres 5474 . . . . . 6 ((𝐹𝐵) Fn 𝐵 ↔ ∀𝑦𝐵 ∃!𝑧 𝑦𝐹𝑧)
6 nfcv 2384 . . . . . . . . . 10 𝑥𝑧
7 fmpt.1 . . . . . . . . . . 11 𝐹 = (𝑥𝐴𝐶)
8 nfmpt1 4202 . . . . . . . . . . 11 𝑥(𝑥𝐴𝐶)
97, 8nfcxfr 2381 . . . . . . . . . 10 𝑥𝐹
10 nfcv 2384 . . . . . . . . . 10 𝑥𝑦
116, 9, 10nfbr 4155 . . . . . . . . 9 𝑥 𝑧𝐹𝑦
12 nfv 1577 . . . . . . . . 9 𝑧(𝑥𝐴𝑦 = 𝐶)
13 breq1 4111 . . . . . . . . . 10 (𝑧 = 𝑥 → (𝑧𝐹𝑦𝑥𝐹𝑦))
14 df-mpt 4172 . . . . . . . . . . . . 13 (𝑥𝐴𝐶) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐶)}
157, 14eqtri 2253 . . . . . . . . . . . 12 𝐹 = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐶)}
1615breqi 4114 . . . . . . . . . . 11 (𝑥𝐹𝑦𝑥{⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐶)}𝑦)
17 df-br 4109 . . . . . . . . . . . 12 (𝑥{⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐶)}𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐶)})
18 opabid 4373 . . . . . . . . . . . 12 (⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐶)} ↔ (𝑥𝐴𝑦 = 𝐶))
1917, 18bitri 184 . . . . . . . . . . 11 (𝑥{⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐶)}𝑦 ↔ (𝑥𝐴𝑦 = 𝐶))
2016, 19bitri 184 . . . . . . . . . 10 (𝑥𝐹𝑦 ↔ (𝑥𝐴𝑦 = 𝐶))
2113, 20bitrdi 196 . . . . . . . . 9 (𝑧 = 𝑥 → (𝑧𝐹𝑦 ↔ (𝑥𝐴𝑦 = 𝐶)))
2211, 12, 21cbveu 2104 . . . . . . . 8 (∃!𝑧 𝑧𝐹𝑦 ↔ ∃!𝑥(𝑥𝐴𝑦 = 𝐶))
23 vex 2815 . . . . . . . . . 10 𝑦 ∈ V
24 vex 2815 . . . . . . . . . 10 𝑧 ∈ V
2523, 24brcnv 4937 . . . . . . . . 9 (𝑦𝐹𝑧𝑧𝐹𝑦)
2625eubii 2089 . . . . . . . 8 (∃!𝑧 𝑦𝐹𝑧 ↔ ∃!𝑧 𝑧𝐹𝑦)
27 df-reu 2527 . . . . . . . 8 (∃!𝑥𝐴 𝑦 = 𝐶 ↔ ∃!𝑥(𝑥𝐴𝑦 = 𝐶))
2822, 26, 273bitr4i 212 . . . . . . 7 (∃!𝑧 𝑦𝐹𝑧 ↔ ∃!𝑥𝐴 𝑦 = 𝐶)
2928ralbii 2548 . . . . . 6 (∀𝑦𝐵 ∃!𝑧 𝑦𝐹𝑧 ↔ ∀𝑦𝐵 ∃!𝑥𝐴 𝑦 = 𝐶)
305, 29bitri 184 . . . . 5 ((𝐹𝐵) Fn 𝐵 ↔ ∀𝑦𝐵 ∃!𝑥𝐴 𝑦 = 𝐶)
31 relcnv 5139 . . . . . . 7 Rel 𝐹
32 df-rn 4759 . . . . . . . 8 ran 𝐹 = dom 𝐹
33 frn 5516 . . . . . . . 8 (𝐹:𝐴𝐵 → ran 𝐹𝐵)
3432, 33eqsstrrid 3284 . . . . . . 7 (𝐹:𝐴𝐵 → dom 𝐹𝐵)
35 relssres 5075 . . . . . . 7 ((Rel 𝐹 ∧ dom 𝐹𝐵) → (𝐹𝐵) = 𝐹)
3631, 34, 35sylancr 414 . . . . . 6 (𝐹:𝐴𝐵 → (𝐹𝐵) = 𝐹)
3736fneq1d 5445 . . . . 5 (𝐹:𝐴𝐵 → ((𝐹𝐵) Fn 𝐵𝐹 Fn 𝐵))
3830, 37bitr3id 194 . . . 4 (𝐹:𝐴𝐵 → (∀𝑦𝐵 ∃!𝑥𝐴 𝑦 = 𝐶𝐹 Fn 𝐵))
394, 38bitr4d 191 . . 3 (𝐹:𝐴𝐵 → (𝐹:𝐴1-1-onto𝐵 ↔ ∀𝑦𝐵 ∃!𝑥𝐴 𝑦 = 𝐶))
4039pm5.32i 454 . 2 ((𝐹:𝐴𝐵𝐹:𝐴1-1-onto𝐵) ↔ (𝐹:𝐴𝐵 ∧ ∀𝑦𝐵 ∃!𝑥𝐴 𝑦 = 𝐶))
41 f1of 5613 . . 3 (𝐹:𝐴1-1-onto𝐵𝐹:𝐴𝐵)
4241pm4.71ri 392 . 2 (𝐹:𝐴1-1-onto𝐵 ↔ (𝐹:𝐴𝐵𝐹:𝐴1-1-onto𝐵))
437fmpt 5826 . . 3 (∀𝑥𝐴 𝐶𝐵𝐹:𝐴𝐵)
4443anbi1i 458 . 2 ((∀𝑥𝐴 𝐶𝐵 ∧ ∀𝑦𝐵 ∃!𝑥𝐴 𝑦 = 𝐶) ↔ (𝐹:𝐴𝐵 ∧ ∀𝑦𝐵 ∃!𝑥𝐴 𝑦 = 𝐶))
4540, 42, 443bitr4i 212 1 (𝐹:𝐴1-1-onto𝐵 ↔ (∀𝑥𝐴 𝐶𝐵 ∧ ∀𝑦𝐵 ∃!𝑥𝐴 𝑦 = 𝐶))
Colors of variables: wff set class
Syntax hints:  wa 104  wb 105   = wceq 1398  ∃!weu 2080  wcel 2203  wral 2520  ∃!wreu 2522  wss 3210  cop 3691   class class class wbr 4108  {copab 4169  cmpt 4170  ccnv 4747  dom cdm 4748  ran crn 4749  cres 4750  Rel wrel 4753   Fn wfn 5346  wf 5347  1-1-ontowf1o 5350
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2206  ax-ext 2214  ax-sep 4227  ax-pow 4286  ax-pr 4321
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2814  df-sbc 3042  df-un 3214  df-in 3216  df-ss 3223  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-br 4109  df-opab 4171  df-mpt 4172  df-id 4413  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761  df-iota 5311  df-fun 5353  df-fn 5354  df-f 5355  df-f1 5356  df-fo 5357  df-f1o 5358  df-fv 5359
This theorem is referenced by:  xpf1o  7096  icoshftf1o  10323
  Copyright terms: Public domain W3C validator