Theorem enrelmap 42733

Description: The set of all possible relations between two sets is equinumerous to the set of all mappings from one set to the powerset of the other. See rfovf1od 42742 for a demonstration of a natural one-to-one onto mapping. (Contributed by RP, 27-Apr-2021.)

Assertion

Ref	Expression
enrelmap	⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 𝒫 (𝐴 × 𝐵) ≈ (𝒫 𝐵 ↑m 𝐴))

Proof of Theorem enrelmap

Step	Hyp	Ref	Expression
1		xpcomeng 9060	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 × 𝐵) ≈ (𝐵 × 𝐴))
2		pwen 9146	. . . 4 ⊢ ((𝐴 × 𝐵) ≈ (𝐵 × 𝐴) → 𝒫 (𝐴 × 𝐵) ≈ 𝒫 (𝐵 × 𝐴))
3	1, 2	syl 17	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 𝒫 (𝐴 × 𝐵) ≈ 𝒫 (𝐵 × 𝐴))
4		xpexg 7733	. . . . 5 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉) → (𝐵 × 𝐴) ∈ V)
5	4	ancoms 459	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐵 × 𝐴) ∈ V)
6		pw2eng 9074	. . . 4 ⊢ ((𝐵 × 𝐴) ∈ V → 𝒫 (𝐵 × 𝐴) ≈ (2o ↑m (𝐵 × 𝐴)))
7	5, 6	syl 17	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 𝒫 (𝐵 × 𝐴) ≈ (2o ↑m (𝐵 × 𝐴)))
8		entr 8998	. . 3 ⊢ ((𝒫 (𝐴 × 𝐵) ≈ 𝒫 (𝐵 × 𝐴) ∧ 𝒫 (𝐵 × 𝐴) ≈ (2o ↑m (𝐵 × 𝐴))) → 𝒫 (𝐴 × 𝐵) ≈ (2o ↑m (𝐵 × 𝐴)))
9	3, 7, 8	syl2anc 584	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 𝒫 (𝐴 × 𝐵) ≈ (2o ↑m (𝐵 × 𝐴)))
10		pw2eng 9074	. . . . 5 ⊢ (𝐵 ∈ 𝑊 → 𝒫 𝐵 ≈ (2o ↑m 𝐵))
11		enrefg 8976	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ≈ 𝐴)
12		mapen 9137	. . . . 5 ⊢ ((𝒫 𝐵 ≈ (2o ↑m 𝐵) ∧ 𝐴 ≈ 𝐴) → (𝒫 𝐵 ↑m 𝐴) ≈ ((2o ↑m 𝐵) ↑m 𝐴))
13	10, 11, 12	syl2anr 597	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝒫 𝐵 ↑m 𝐴) ≈ ((2o ↑m 𝐵) ↑m 𝐴))
14		2on 8476	. . . . 5 ⊢ 2o ∈ On
15		simpr 485	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 𝐵 ∈ 𝑊)
16		simpl 483	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 𝐴 ∈ 𝑉)
17		mapxpen 9139	. . . . 5 ⊢ ((2o ∈ On ∧ 𝐵 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉) → ((2o ↑m 𝐵) ↑m 𝐴) ≈ (2o ↑m (𝐵 × 𝐴)))
18	14, 15, 16, 17	mp3an2i 1466	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((2o ↑m 𝐵) ↑m 𝐴) ≈ (2o ↑m (𝐵 × 𝐴)))
19		entr 8998	. . . 4 ⊢ (((𝒫 𝐵 ↑m 𝐴) ≈ ((2o ↑m 𝐵) ↑m 𝐴) ∧ ((2o ↑m 𝐵) ↑m 𝐴) ≈ (2o ↑m (𝐵 × 𝐴))) → (𝒫 𝐵 ↑m 𝐴) ≈ (2o ↑m (𝐵 × 𝐴)))
20	13, 18, 19	syl2anc 584	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝒫 𝐵 ↑m 𝐴) ≈ (2o ↑m (𝐵 × 𝐴)))
21	20	ensymd 8997	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (2o ↑m (𝐵 × 𝐴)) ≈ (𝒫 𝐵 ↑m 𝐴))
22		entr 8998	. 2 ⊢ ((𝒫 (𝐴 × 𝐵) ≈ (2o ↑m (𝐵 × 𝐴)) ∧ (2o ↑m (𝐵 × 𝐴)) ≈ (𝒫 𝐵 ↑m 𝐴)) → 𝒫 (𝐴 × 𝐵) ≈ (𝒫 𝐵 ↑m 𝐴))
23	9, 21, 22	syl2anc 584	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 𝒫 (𝐴 × 𝐵) ≈ (𝒫 𝐵 ↑m 𝐴))

Syntax hints:   → wi 4   ∧ wa 396   ∈ wcel 2106  Vcvv 3474  𝒫 cpw 4601   class class class wbr 5147   × cxp 5673  Oncon0 6361  (class class class)co 7405  2_oc2o 8456   ↑_m cmap 8816   ≈ cen 8932

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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5298  ax-nul 5305  ax-pow 5362  ax-pr 5426  ax-un 7721

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3966  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-iun 4998  df-br 5148  df-opab 5210  df-mpt 5231  df-tr 5265  df-id 5573  df-eprel 5579  df-po 5587  df-so 5588  df-fr 5630  df-we 5632  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6492  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7408  df-oprab 7409  df-mpo 7410  df-om 7852  df-1st 7971  df-2nd 7972  df-1o 8462  df-2o 8463  df-er 8699  df-map 8818  df-en 8936

This theorem is referenced by:  enrelmapr  42734  enmappw  42735