Theorem fsovf1od 44960

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

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 44956	. . 3 ⊢ (𝜑 → 𝐺:(𝒫 𝐵 ↑m 𝐴)⟶(𝒫 𝐴 ↑m 𝐵))
6	5	ffnd 6698	. 2 ⊢ (𝜑 → 𝐺 Fn (𝒫 𝐵 ↑m 𝐴))
7		eqid 2760	. . . . 5 ⊢ (𝐵𝑂𝐴) = (𝐵𝑂𝐴)
8	1, 3, 2, 7	fsovfd 44956	. . . 4 ⊢ (𝜑 → (𝐵𝑂𝐴):(𝒫 𝐴 ↑m 𝐵)⟶(𝒫 𝐵 ↑m 𝐴))
9	8	ffnd 6698	. . 3 ⊢ (𝜑 → (𝐵𝑂𝐴) Fn (𝒫 𝐴 ↑m 𝐵))
10	1, 2, 3, 4, 7	fsovcnvd 44958	. . . 4 ⊢ (𝜑 → ◡𝐺 = (𝐵𝑂𝐴))
11	10	fneq1d 6620	. . 3 ⊢ (𝜑 → (◡𝐺 Fn (𝒫 𝐴 ↑m 𝐵) ↔ (𝐵𝑂𝐴) Fn (𝒫 𝐴 ↑m 𝐵)))
12	9, 11	mpbird 260	. 2 ⊢ (𝜑 → ◡𝐺 Fn (𝒫 𝐴 ↑m 𝐵))
13		dff1o4 6821	. 2 ⊢ (𝐺:(𝒫 𝐵 ↑m 𝐴)–1-1-onto→(𝒫 𝐴 ↑m 𝐵) ↔ (𝐺 Fn (𝒫 𝐵 ↑m 𝐴) ∧ ◡𝐺 Fn (𝒫 𝐴 ↑m 𝐵)))
14	6, 12, 13	sylanbrc 595	1 ⊢ (𝜑 → 𝐺:(𝒫 𝐵 ↑m 𝐴)–1-1-onto→(𝒫 𝐴 ↑m 𝐵))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  {crab 3412  Vcvv 3450  𝒫 cpw 4556   ↦ cmpt 5185  ^◡ccnv 5646   Fn wfn 6522  –1-1-onto→wf1o 6526  ‘cfv 6527  (class class class)co 7408   ∈ cmpo 7410   ↑_m cmap 8825

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7734

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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-f1 6532  df-fo 6533  df-f1o 6534  df-fv 6535  df-ov 7411  df-oprab 7412  df-mpo 7413  df-1st 7984  df-2nd 7985  df-map 8827

This theorem is used by:  ntrneif1o  45019  clsneif1o  45048  clsneikex  45050  clsneinex  45051  neicvgf1o  45058  neicvgmex  45061  neicvgel1  45063