Theorem xpsneng 9026

Description: A set is equinumerous to its Cartesian product with a singleton. Proposition 4.22(c) of [Mendelson] p. 254. (Contributed by NM, 22-Oct-2004.)

Assertion

Ref	Expression
xpsneng	⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 × {𝐵}) ≈ 𝐴)

Proof of Theorem xpsneng

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		xpeq1 5652	. . 3 ⊢ (𝑥 = 𝐴 → (𝑥 × {𝑦}) = (𝐴 × {𝑦}))
2		id 22	. . 3 ⊢ (𝑥 = 𝐴 → 𝑥 = 𝐴)
3	1, 2	breq12d 5120	. 2 ⊢ (𝑥 = 𝐴 → ((𝑥 × {𝑦}) ≈ 𝑥 ↔ (𝐴 × {𝑦}) ≈ 𝐴))
4		sneq 4599	. . . 4 ⊢ (𝑦 = 𝐵 → {𝑦} = {𝐵})
5	4	xpeq2d 5668	. . 3 ⊢ (𝑦 = 𝐵 → (𝐴 × {𝑦}) = (𝐴 × {𝐵}))
6	5	breq1d 5117	. 2 ⊢ (𝑦 = 𝐵 → ((𝐴 × {𝑦}) ≈ 𝐴 ↔ (𝐴 × {𝐵}) ≈ 𝐴))
7		vex 3451	. . 3 ⊢ 𝑥 ∈ V
8		vex 3451	. . 3 ⊢ 𝑦 ∈ V
9	7, 8	xpsnen 9025	. 2 ⊢ (𝑥 × {𝑦}) ≈ 𝑥
10	3, 6, 9	vtocl2g 3540	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 × {𝐵}) ≈ 𝐴)

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1540   ∈ wcel 2109  {csn 4589   class class class wbr 5107   × cxp 5636   ≈ cen 8915

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-int 4911  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-en 8919

This theorem is referenced by:  xp1en  9027  xpsnen2g  9034  xpdom3  9039  disjen  9098  unxpdom2  9201  sucxpdom  9202  gchxpidm  10622  frlmiscvec  21758