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 44443
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 44439 . . 3 (𝜑𝐺:(𝒫 𝐵m 𝐴)⟶(𝒫 𝐴m 𝐵))
65ffnd 6670 . 2 (𝜑𝐺 Fn (𝒫 𝐵m 𝐴))
7 eqid 2737 . . . . 5 (𝐵𝑂𝐴) = (𝐵𝑂𝐴)
81, 3, 2, 7fsovfd 44439 . . . 4 (𝜑 → (𝐵𝑂𝐴):(𝒫 𝐴m 𝐵)⟶(𝒫 𝐵m 𝐴))
98ffnd 6670 . . 3 (𝜑 → (𝐵𝑂𝐴) Fn (𝒫 𝐴m 𝐵))
101, 2, 3, 4, 7fsovcnvd 44441 . . . 4 (𝜑𝐺 = (𝐵𝑂𝐴))
1110fneq1d 6592 . . 3 (𝜑 → (𝐺 Fn (𝒫 𝐴m 𝐵) ↔ (𝐵𝑂𝐴) Fn (𝒫 𝐴m 𝐵)))
129, 11mpbird 257 . 2 (𝜑𝐺 Fn (𝒫 𝐴m 𝐵))
13 dff1o4 6789 . 2 (𝐺:(𝒫 𝐵m 𝐴)–1-1-onto→(𝒫 𝐴m 𝐵) ↔ (𝐺 Fn (𝒫 𝐵m 𝐴) ∧ 𝐺 Fn (𝒫 𝐴m 𝐵)))
146, 12, 13sylanbrc 584 1 (𝜑𝐺:(𝒫 𝐵m 𝐴)–1-1-onto→(𝒫 𝐴m 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1542  wcel 2114  {crab 3390  Vcvv 3430  𝒫 cpw 4542  cmpt 5167  ccnv 5630   Fn wfn 6494  1-1-ontowf1o 6498  cfv 6499  (class class class)co 7367  cmpo 7369  m cmap 8773
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5213  ax-sep 5232  ax-nul 5242  ax-pow 5308  ax-pr 5376  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6455  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-ov 7370  df-oprab 7371  df-mpo 7372  df-1st 7942  df-2nd 7943  df-map 8775
This theorem is referenced by:  ntrneif1o  44502  clsneif1o  44531  clsneikex  44533  clsneinex  44534  neicvgf1o  44541  neicvgmex  44544  neicvgel1  44546
  Copyright terms: Public domain W3C validator