Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  fsovf1od Structured version   Visualization version   GIF version

Theorem fsovf1od 44461
Description: The value of (𝐴𝑂𝐵) is a bijection, where 𝑂 is the operator which maps between maps from one base set to subsets of the second to maps from the second base set to subsets of the first for base sets. (Contributed by RP, 27-Apr-2021.)
Hypotheses
Ref Expression
fsovd.fs 𝑂 = (𝑎 ∈ V, 𝑏 ∈ V ↦ (𝑓 ∈ (𝒫 𝑏m 𝑎) ↦ (𝑦𝑏 ↦ {𝑥𝑎𝑦 ∈ (𝑓𝑥)})))
fsovd.a (𝜑𝐴𝑉)
fsovd.b (𝜑𝐵𝑊)
fsovfvd.g 𝐺 = (𝐴𝑂𝐵)
Assertion
Ref Expression
fsovf1od (𝜑𝐺:(𝒫 𝐵m 𝐴)–1-1-onto→(𝒫 𝐴m 𝐵))
Distinct variable groups:   𝐴,𝑎,𝑏,𝑓,𝑥,𝑦   𝐵,𝑎,𝑏,𝑓,𝑥,𝑦   𝜑,𝑎,𝑏,𝑓,𝑦
Allowed substitution hints:   𝜑(𝑥)   𝐺(𝑥,𝑦,𝑓,𝑎,𝑏)   𝑂(𝑥,𝑦,𝑓,𝑎,𝑏)   𝑉(𝑥,𝑦,𝑓,𝑎,𝑏)   𝑊(𝑥,𝑦,𝑓,𝑎,𝑏)

Proof of Theorem fsovf1od
StepHypRef Expression
1 fsovd.fs . . . 4 𝑂 = (𝑎 ∈ V, 𝑏 ∈ V ↦ (𝑓 ∈ (𝒫 𝑏m 𝑎) ↦ (𝑦𝑏 ↦ {𝑥𝑎𝑦 ∈ (𝑓𝑥)})))
2 fsovd.a . . . 4 (𝜑𝐴𝑉)
3 fsovd.b . . . 4 (𝜑𝐵𝑊)
4 fsovfvd.g . . . 4 𝐺 = (𝐴𝑂𝐵)
51, 2, 3, 4fsovfd 44457 . . 3 (𝜑𝐺:(𝒫 𝐵m 𝐴)⟶(𝒫 𝐴m 𝐵))
65ffnd 6663 . 2 (𝜑𝐺 Fn (𝒫 𝐵m 𝐴))
7 eqid 2740 . . . . 5 (𝐵𝑂𝐴) = (𝐵𝑂𝐴)
81, 3, 2, 7fsovfd 44457 . . . 4 (𝜑 → (𝐵𝑂𝐴):(𝒫 𝐴m 𝐵)⟶(𝒫 𝐵m 𝐴))
98ffnd 6663 . . 3 (𝜑 → (𝐵𝑂𝐴) Fn (𝒫 𝐴m 𝐵))
101, 2, 3, 4, 7fsovcnvd 44459 . . . 4 (𝜑𝐺 = (𝐵𝑂𝐴))
1110fneq1d 6585 . . 3 (𝜑 → (𝐺 Fn (𝒫 𝐴m 𝐵) ↔ (𝐵𝑂𝐴) Fn (𝒫 𝐴m 𝐵)))
129, 11mpbird 258 . 2 (𝜑𝐺 Fn (𝒫 𝐴m 𝐵))
13 dff1o4 6782 . 2 (𝐺:(𝒫 𝐵m 𝐴)–1-1-onto→(𝒫 𝐴m 𝐵) ↔ (𝐺 Fn (𝒫 𝐵m 𝐴) ∧ 𝐺 Fn (𝒫 𝐴m 𝐵)))
146, 12, 13sylanbrc 589 1 (𝜑𝐺:(𝒫 𝐵m 𝐴)–1-1-onto→(𝒫 𝐴m 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1547  wcel 2119  {crab 3392  Vcvv 3432  𝒫 cpw 4536  cmpt 5160  ccnv 5624   Fn wfn 6487  1-1-ontowf1o 6491  cfv 6492  (class class class)co 7363  cmpo 7365  m cmap 8770
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-rep 5206  ax-sep 5225  ax-nul 5235  ax-pow 5301  ax-pr 5369  ax-un 7685
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-reu 3346  df-rab 3393  df-v 3434  df-sbc 3731  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-iun 4930  df-br 5080  df-opab 5142  df-mpt 5161  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7366  df-oprab 7367  df-mpo 7368  df-1st 7938  df-2nd 7939  df-map 8772
This theorem is referenced by:  ntrneif1o  44520  clsneif1o  44549  clsneikex  44551  clsneinex  44552  neicvgf1o  44559  neicvgmex  44562  neicvgel1  44564
  Copyright terms: Public domain W3C validator