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 43989
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 43985 . . 3 (𝜑𝐺:(𝒫 𝐵m 𝐴)⟶(𝒫 𝐴m 𝐵))
65ffnd 6657 . 2 (𝜑𝐺 Fn (𝒫 𝐵m 𝐴))
7 eqid 2729 . . . . 5 (𝐵𝑂𝐴) = (𝐵𝑂𝐴)
81, 3, 2, 7fsovfd 43985 . . . 4 (𝜑 → (𝐵𝑂𝐴):(𝒫 𝐴m 𝐵)⟶(𝒫 𝐵m 𝐴))
98ffnd 6657 . . 3 (𝜑 → (𝐵𝑂𝐴) Fn (𝒫 𝐴m 𝐵))
101, 2, 3, 4, 7fsovcnvd 43987 . . . 4 (𝜑𝐺 = (𝐵𝑂𝐴))
1110fneq1d 6579 . . 3 (𝜑 → (𝐺 Fn (𝒫 𝐴m 𝐵) ↔ (𝐵𝑂𝐴) Fn (𝒫 𝐴m 𝐵)))
129, 11mpbird 257 . 2 (𝜑𝐺 Fn (𝒫 𝐴m 𝐵))
13 dff1o4 6776 . 2 (𝐺:(𝒫 𝐵m 𝐴)–1-1-onto→(𝒫 𝐴m 𝐵) ↔ (𝐺 Fn (𝒫 𝐵m 𝐴) ∧ 𝐺 Fn (𝒫 𝐴m 𝐵)))
146, 12, 13sylanbrc 583 1 (𝜑𝐺:(𝒫 𝐵m 𝐴)–1-1-onto→(𝒫 𝐴m 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1540  wcel 2109  {crab 3396  Vcvv 3438  𝒫 cpw 4553  cmpt 5176  ccnv 5622   Fn wfn 6481  1-1-ontowf1o 6485  cfv 6486  (class class class)co 7353  cmpo 7355  m cmap 8760
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5221  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7675
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3346  df-rab 3397  df-v 3440  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4862  df-iun 4946  df-br 5096  df-opab 5158  df-mpt 5177  df-id 5518  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-ov 7356  df-oprab 7357  df-mpo 7358  df-1st 7931  df-2nd 7932  df-map 8762
This theorem is referenced by:  ntrneif1o  44048  clsneif1o  44077  clsneikex  44079  clsneinex  44080  neicvgf1o  44087  neicvgmex  44090  neicvgel1  44092
  Copyright terms: Public domain W3C validator