xpcomen - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > xpcomen		Structured version Visualization version GIF version

Theorem xpcomen 9008

Description: Commutative law for equinumerosity of Cartesian product. Proposition 4.22(d) of [Mendelson] p. 254. (Contributed by NM, 5-Jan-2004.) (Revised by Mario Carneiro, 15-Nov-2014.)

**Hypotheses**
Ref	Expression
xpcomen.1	⊢ 𝐴 ∈ V
xpcomen.2	⊢ 𝐵 ∈ V

**Assertion**
Ref	Expression
xpcomen	⊢ (𝐴 × 𝐵) ≈ (𝐵 × 𝐴)

Proof of Theorem xpcomen Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		xpcomen.1	. . 3 ⊢ 𝐴 ∈ V
2		xpcomen.2	. . 3 ⊢ 𝐵 ∈ V
3	1, 2	xpex 7708	. 2 ⊢ (𝐴 × 𝐵) ∈ V
4	2, 1	xpex 7708	. 2 ⊢ (𝐵 × 𝐴) ∈ V
5		eqid 2737	. . 3 ⊢ (𝑥 ∈ (𝐴 × 𝐵) ↦ ∪ ^◡{𝑥}) = (𝑥 ∈ (𝐴 × 𝐵) ↦ ∪ ^◡{𝑥})
6	5	xpcomf1o 9006	. 2 ⊢ (𝑥 ∈ (𝐴 × 𝐵) ↦ ∪ ^◡{𝑥}):(𝐴 × 𝐵)–1-1-onto→(𝐵 × 𝐴)
7		f1oen2g 8917	. 2 ⊢ (((𝐴 × 𝐵) ∈ V ∧ (𝐵 × 𝐴) ∈ V ∧ (𝑥 ∈ (𝐴 × 𝐵) ↦ ∪ ^◡{𝑥}):(𝐴 × 𝐵)–1-1-onto→(𝐵 × 𝐴)) → (𝐴 × 𝐵) ≈ (𝐵 × 𝐴))
8	3, 4, 6, 7	mp3an 1464	1 ⊢ (𝐴 × 𝐵) ≈ (𝐵 × 𝐴)

Colors of variables: wff setvar class

Syntax hints: ∈ wcel 2114 Vcvv 3442 {csn 4582 ∪ cuni 4865 class class class wbr 5100 ↦ cmpt 5181 × cxp 5630 ^◡ccnv 5631 –1-1-onto→wf1o 6499 ≈ cen 8892

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-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690

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-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-1st 7943 df-2nd 7944 df-en 8896

This theorem is referenced by: xpcomeng 9009 ackbij1lem5 10145 hashxplem 14368

W3C validator