Theorem fsovf1od 45208

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-1onto(𝒫 𝐴 ↑m 𝐵))

Distinct variable groups:   𝐴,𝑎,𝑏,𝑓,𝑥,𝑦   𝐵,𝑎,𝑏,𝑓,𝑥,𝑦   𝜑,𝑎,𝑏,𝑓,𝑦

Allowed substitution hints:   𝜑(𝑥)   𝐺(𝑥, 𝑦, 𝑓, 𝑎, 𝑏)   𝑂(𝑥, 𝑦, 𝑓, 𝑎, 𝑏)   𝑉(𝑥, 𝑦, 𝑓, 𝑎, 𝑏)   𝑊(𝑥, 𝑦, 𝑓, 𝑎, 𝑏)

Proof of Theorem fsovf1od

Step	Hyp	Ref	Expression
1		fsovd.fs	. . . 4 ⊢ 𝑂 = (𝑎 ∈ V, 𝑏 ∈ V ↦ (𝑓 ∈ (𝒫 𝑏 ↑m 𝑎) ↦ (𝑦 ∈ 𝑏 ↦ {𝑥 ∈ 𝑎 ∣ 𝑦 ∈ (𝑓‘𝑥)})))
2		fsovd.a	. . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
3		fsovd.b	. . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑊)
4		fsovfvd.g	. . . 4 ⊢ 𝐺 = (𝐴𝑂𝐵)
5	1, 2, 3, 4	fsovfd 45204	. . 3 ⊢ (𝜑 → 𝐺:(𝒫 𝐵 ↑m 𝐴)⟶(𝒫 𝐴 ↑m 𝐵))
6	5	ffnd 6732	. 2 ⊢ (𝜑 → 𝐺 Fn (𝒫 𝐵 ↑m 𝐴))
7		eqid 2763	. . . . 5 ⊢ (𝐵𝑂𝐴) = (𝐵𝑂𝐴)
8	1, 3, 2, 7	fsovfd 45204	. . . 4 ⊢ (𝜑 → (𝐵𝑂𝐴):(𝒫 𝐴 ↑m 𝐵)⟶(𝒫 𝐵 ↑m 𝐴))
9	8	ffnd 6732	. . 3 ⊢ (𝜑 → (𝐵𝑂𝐴) Fn (𝒫 𝐴 ↑m 𝐵))
10	1, 2, 3, 4, 7	fsovcnvd 45206	. . . 4 ⊢ (𝜑 → ◡𝐺 = (𝐵𝑂𝐴))
11	10	fneq1d 6654	. . 3 ⊢ (𝜑 → (◡𝐺 Fn (𝒫 𝐴 ↑m 𝐵) ↔ (𝐵𝑂𝐴) Fn (𝒫 𝐴 ↑m 𝐵)))
12	9, 11	mpbird 260	. 2 ⊢ (𝜑 → ◡𝐺 Fn (𝒫 𝐴 ↑m 𝐵))
13		dff1o4 6855	. 2 ⊢ (𝐺:(𝒫 𝐵 ↑m 𝐴)⟶1-1onto(𝒫 𝐴 ↑m 𝐵) ↔ (𝐺 Fn (𝒫 𝐵 ↑m 𝐴) ∧ ◡𝐺 Fn (𝒫 𝐴 ↑m 𝐵)))
14	6, 12, 13	sylanbrc 595	1 ⊢ (𝜑 → 𝐺:(𝒫 𝐵 ↑m 𝐴)⟶1-1onto(𝒫 𝐴 ↑m 𝐵))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  {crab 3416  Vcvv 3454  𝒫 cpw 4560   ↦ cmpt 5189  ^◡ccnv 5654   Fn wfn 6553  ⟶1-1ontowf1o 6557  ‘cfv 6558  (class class class)co 7443   ∈ cmpo 7445   ↑_m cmap 8875

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-ov 7446  df-oprab 7447  df-mpo 7448  df-1st 8025  df-2nd 8026  df-map 8877

This theorem is used by:  ntrneif1o  45267  clsneif1o  45296  clsneikex  45298  clsneinex  45299  neicvgf1o  45306  neicvgmex  45309  neicvgel1  45311