Theorem xpsnen 8796

Description: A set is equinumerous to its Cartesian product with a singleton. Proposition 4.22(c) of [Mendelson] p. 254. (Contributed by NM, 4-Jan-2004.) (Revised by Mario Carneiro, 15-Nov-2014.)

Hypotheses

Ref	Expression
xpsnen.1	⊢ 𝐴 ∈ V
xpsnen.2	⊢ 𝐵 ∈ V

Assertion

Ref	Expression
xpsnen	⊢ (𝐴 × {𝐵}) ≈ 𝐴

Proof of Theorem xpsnen

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

Step	Hyp	Ref	Expression
1		xpsnen.1	. . 3 ⊢ 𝐴 ∈ V
2		snex 5349	. . 3 ⊢ {𝐵} ∈ V
3	1, 2	xpex 7581	. 2 ⊢ (𝐴 × {𝐵}) ∈ V
4		elxp 5603	. . 3 ⊢ (𝑦 ∈ (𝐴 × {𝐵}) ↔ ∃𝑥∃𝑧(𝑦 = ⟨𝑥, 𝑧⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ {𝐵})))
5		inteq 4879	. . . . . . . 8 ⊢ (𝑦 = ⟨𝑥, 𝑧⟩ → ∩ 𝑦 = ∩ ⟨𝑥, 𝑧⟩)
6	5	inteqd 4881	. . . . . . 7 ⊢ (𝑦 = ⟨𝑥, 𝑧⟩ → ∩ ∩ 𝑦 = ∩ ∩ ⟨𝑥, 𝑧⟩)
7		vex 3426	. . . . . . . 8 ⊢ 𝑥 ∈ V
8		vex 3426	. . . . . . . 8 ⊢ 𝑧 ∈ V
9	7, 8	op1stb 5380	. . . . . . 7 ⊢ ∩ ∩ ⟨𝑥, 𝑧⟩ = 𝑥
10	6, 9	eqtrdi 2795	. . . . . 6 ⊢ (𝑦 = ⟨𝑥, 𝑧⟩ → ∩ ∩ 𝑦 = 𝑥)
11	10, 7	eqeltrdi 2847	. . . . 5 ⊢ (𝑦 = ⟨𝑥, 𝑧⟩ → ∩ ∩ 𝑦 ∈ V)
12	11	adantr 480	. . . 4 ⊢ ((𝑦 = ⟨𝑥, 𝑧⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ {𝐵})) → ∩ ∩ 𝑦 ∈ V)
13	12	exlimivv 1936	. . 3 ⊢ (∃𝑥∃𝑧(𝑦 = ⟨𝑥, 𝑧⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ {𝐵})) → ∩ ∩ 𝑦 ∈ V)
14	4, 13	sylbi 216	. 2 ⊢ (𝑦 ∈ (𝐴 × {𝐵}) → ∩ ∩ 𝑦 ∈ V)
15		opex 5373	. . 3 ⊢ ⟨𝑥, 𝐵⟩ ∈ V
16	15	a1i 11	. 2 ⊢ (𝑥 ∈ 𝐴 → ⟨𝑥, 𝐵⟩ ∈ V)
17		eqvisset 3439	. . . . 5 ⊢ (𝑥 = ∩ ∩ 𝑦 → ∩ ∩ 𝑦 ∈ V)
18		ancom 460	. . . . . . . . . . 11 ⊢ (((𝑦 = ⟨𝑥, 𝑧⟩ ∧ 𝑥 ∈ 𝐴) ∧ 𝑧 ∈ {𝐵}) ↔ (𝑧 ∈ {𝐵} ∧ (𝑦 = ⟨𝑥, 𝑧⟩ ∧ 𝑥 ∈ 𝐴)))
19		anass 468	. . . . . . . . . . 11 ⊢ (((𝑦 = ⟨𝑥, 𝑧⟩ ∧ 𝑥 ∈ 𝐴) ∧ 𝑧 ∈ {𝐵}) ↔ (𝑦 = ⟨𝑥, 𝑧⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ {𝐵})))
20		velsn 4574	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ {𝐵} ↔ 𝑧 = 𝐵)
21	20	anbi1i 623	. . . . . . . . . . 11 ⊢ ((𝑧 ∈ {𝐵} ∧ (𝑦 = ⟨𝑥, 𝑧⟩ ∧ 𝑥 ∈ 𝐴)) ↔ (𝑧 = 𝐵 ∧ (𝑦 = ⟨𝑥, 𝑧⟩ ∧ 𝑥 ∈ 𝐴)))
22	18, 19, 21	3bitr3i 300	. . . . . . . . . 10 ⊢ ((𝑦 = ⟨𝑥, 𝑧⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ {𝐵})) ↔ (𝑧 = 𝐵 ∧ (𝑦 = ⟨𝑥, 𝑧⟩ ∧ 𝑥 ∈ 𝐴)))
23	22	exbii 1851	. . . . . . . . 9 ⊢ (∃𝑧(𝑦 = ⟨𝑥, 𝑧⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ {𝐵})) ↔ ∃𝑧(𝑧 = 𝐵 ∧ (𝑦 = ⟨𝑥, 𝑧⟩ ∧ 𝑥 ∈ 𝐴)))
24		xpsnen.2	. . . . . . . . . 10 ⊢ 𝐵 ∈ V
25		opeq2 4802	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝐵 → ⟨𝑥, 𝑧⟩ = ⟨𝑥, 𝐵⟩)
26	25	eqeq2d 2749	. . . . . . . . . . 11 ⊢ (𝑧 = 𝐵 → (𝑦 = ⟨𝑥, 𝑧⟩ ↔ 𝑦 = ⟨𝑥, 𝐵⟩))
27	26	anbi1d 629	. . . . . . . . . 10 ⊢ (𝑧 = 𝐵 → ((𝑦 = ⟨𝑥, 𝑧⟩ ∧ 𝑥 ∈ 𝐴) ↔ (𝑦 = ⟨𝑥, 𝐵⟩ ∧ 𝑥 ∈ 𝐴)))
28	24, 27	ceqsexv 3469	. . . . . . . . 9 ⊢ (∃𝑧(𝑧 = 𝐵 ∧ (𝑦 = ⟨𝑥, 𝑧⟩ ∧ 𝑥 ∈ 𝐴)) ↔ (𝑦 = ⟨𝑥, 𝐵⟩ ∧ 𝑥 ∈ 𝐴))
29		inteq 4879	. . . . . . . . . . . . . 14 ⊢ (𝑦 = ⟨𝑥, 𝐵⟩ → ∩ 𝑦 = ∩ ⟨𝑥, 𝐵⟩)
30	29	inteqd 4881	. . . . . . . . . . . . 13 ⊢ (𝑦 = ⟨𝑥, 𝐵⟩ → ∩ ∩ 𝑦 = ∩ ∩ ⟨𝑥, 𝐵⟩)
31	7, 24	op1stb 5380	. . . . . . . . . . . . 13 ⊢ ∩ ∩ ⟨𝑥, 𝐵⟩ = 𝑥
32	30, 31	eqtr2di 2796	. . . . . . . . . . . 12 ⊢ (𝑦 = ⟨𝑥, 𝐵⟩ → 𝑥 = ∩ ∩ 𝑦)
33	32	pm4.71ri 560	. . . . . . . . . . 11 ⊢ (𝑦 = ⟨𝑥, 𝐵⟩ ↔ (𝑥 = ∩ ∩ 𝑦 ∧ 𝑦 = ⟨𝑥, 𝐵⟩))
34	33	anbi1i 623	. . . . . . . . . 10 ⊢ ((𝑦 = ⟨𝑥, 𝐵⟩ ∧ 𝑥 ∈ 𝐴) ↔ ((𝑥 = ∩ ∩ 𝑦 ∧ 𝑦 = ⟨𝑥, 𝐵⟩) ∧ 𝑥 ∈ 𝐴))
35		anass 468	. . . . . . . . . 10 ⊢ (((𝑥 = ∩ ∩ 𝑦 ∧ 𝑦 = ⟨𝑥, 𝐵⟩) ∧ 𝑥 ∈ 𝐴) ↔ (𝑥 = ∩ ∩ 𝑦 ∧ (𝑦 = ⟨𝑥, 𝐵⟩ ∧ 𝑥 ∈ 𝐴)))
36	34, 35	bitri 274	. . . . . . . . 9 ⊢ ((𝑦 = ⟨𝑥, 𝐵⟩ ∧ 𝑥 ∈ 𝐴) ↔ (𝑥 = ∩ ∩ 𝑦 ∧ (𝑦 = ⟨𝑥, 𝐵⟩ ∧ 𝑥 ∈ 𝐴)))
37	23, 28, 36	3bitri 296	. . . . . . . 8 ⊢ (∃𝑧(𝑦 = ⟨𝑥, 𝑧⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ {𝐵})) ↔ (𝑥 = ∩ ∩ 𝑦 ∧ (𝑦 = ⟨𝑥, 𝐵⟩ ∧ 𝑥 ∈ 𝐴)))
38	37	exbii 1851	. . . . . . 7 ⊢ (∃𝑥∃𝑧(𝑦 = ⟨𝑥, 𝑧⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝑧 ∈ {𝐵})) ↔ ∃𝑥(𝑥 = ∩ ∩ 𝑦 ∧ (𝑦 = ⟨𝑥, 𝐵⟩ ∧ 𝑥 ∈ 𝐴)))
39	4, 38	bitri 274	. . . . . 6 ⊢ (𝑦 ∈ (𝐴 × {𝐵}) ↔ ∃𝑥(𝑥 = ∩ ∩ 𝑦 ∧ (𝑦 = ⟨𝑥, 𝐵⟩ ∧ 𝑥 ∈ 𝐴)))
40		opeq1 4801	. . . . . . . . 9 ⊢ (𝑥 = ∩ ∩ 𝑦 → ⟨𝑥, 𝐵⟩ = ⟨∩ ∩ 𝑦, 𝐵⟩)
41	40	eqeq2d 2749	. . . . . . . 8 ⊢ (𝑥 = ∩ ∩ 𝑦 → (𝑦 = ⟨𝑥, 𝐵⟩ ↔ 𝑦 = ⟨∩ ∩ 𝑦, 𝐵⟩))
42		eleq1 2826	. . . . . . . 8 ⊢ (𝑥 = ∩ ∩ 𝑦 → (𝑥 ∈ 𝐴 ↔ ∩ ∩ 𝑦 ∈ 𝐴))
43	41, 42	anbi12d 630	. . . . . . 7 ⊢ (𝑥 = ∩ ∩ 𝑦 → ((𝑦 = ⟨𝑥, 𝐵⟩ ∧ 𝑥 ∈ 𝐴) ↔ (𝑦 = ⟨∩ ∩ 𝑦, 𝐵⟩ ∧ ∩ ∩ 𝑦 ∈ 𝐴)))
44	43	ceqsexgv 3576	. . . . . 6 ⊢ (∩ ∩ 𝑦 ∈ V → (∃𝑥(𝑥 = ∩ ∩ 𝑦 ∧ (𝑦 = ⟨𝑥, 𝐵⟩ ∧ 𝑥 ∈ 𝐴)) ↔ (𝑦 = ⟨∩ ∩ 𝑦, 𝐵⟩ ∧ ∩ ∩ 𝑦 ∈ 𝐴)))
45	39, 44	syl5bb 282	. . . . 5 ⊢ (∩ ∩ 𝑦 ∈ V → (𝑦 ∈ (𝐴 × {𝐵}) ↔ (𝑦 = ⟨∩ ∩ 𝑦, 𝐵⟩ ∧ ∩ ∩ 𝑦 ∈ 𝐴)))
46	17, 45	syl 17	. . . 4 ⊢ (𝑥 = ∩ ∩ 𝑦 → (𝑦 ∈ (𝐴 × {𝐵}) ↔ (𝑦 = ⟨∩ ∩ 𝑦, 𝐵⟩ ∧ ∩ ∩ 𝑦 ∈ 𝐴)))
47	46	pm5.32ri 575	. . 3 ⊢ ((𝑦 ∈ (𝐴 × {𝐵}) ∧ 𝑥 = ∩ ∩ 𝑦) ↔ ((𝑦 = ⟨∩ ∩ 𝑦, 𝐵⟩ ∧ ∩ ∩ 𝑦 ∈ 𝐴) ∧ 𝑥 = ∩ ∩ 𝑦))
48	32	adantr 480	. . . . 5 ⊢ ((𝑦 = ⟨𝑥, 𝐵⟩ ∧ 𝑥 ∈ 𝐴) → 𝑥 = ∩ ∩ 𝑦)
49	48	pm4.71i 559	. . . 4 ⊢ ((𝑦 = ⟨𝑥, 𝐵⟩ ∧ 𝑥 ∈ 𝐴) ↔ ((𝑦 = ⟨𝑥, 𝐵⟩ ∧ 𝑥 ∈ 𝐴) ∧ 𝑥 = ∩ ∩ 𝑦))
50	43	pm5.32ri 575	. . . 4 ⊢ (((𝑦 = ⟨𝑥, 𝐵⟩ ∧ 𝑥 ∈ 𝐴) ∧ 𝑥 = ∩ ∩ 𝑦) ↔ ((𝑦 = ⟨∩ ∩ 𝑦, 𝐵⟩ ∧ ∩ ∩ 𝑦 ∈ 𝐴) ∧ 𝑥 = ∩ ∩ 𝑦))
51	49, 50	bitr2i 275	. . 3 ⊢ (((𝑦 = ⟨∩ ∩ 𝑦, 𝐵⟩ ∧ ∩ ∩ 𝑦 ∈ 𝐴) ∧ 𝑥 = ∩ ∩ 𝑦) ↔ (𝑦 = ⟨𝑥, 𝐵⟩ ∧ 𝑥 ∈ 𝐴))
52		ancom 460	. . 3 ⊢ ((𝑦 = ⟨𝑥, 𝐵⟩ ∧ 𝑥 ∈ 𝐴) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 = ⟨𝑥, 𝐵⟩))
53	47, 51, 52	3bitri 296	. 2 ⊢ ((𝑦 ∈ (𝐴 × {𝐵}) ∧ 𝑥 = ∩ ∩ 𝑦) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 = ⟨𝑥, 𝐵⟩))
54	3, 1, 14, 16, 53	en2i 8733	1 ⊢ (𝐴 × {𝐵}) ≈ 𝐴

Syntax hints:   ↔ wb 205   ∧ wa 395   = wceq 1539  ∃wex 1783   ∈ wcel 2108  Vcvv 3422  {csn 4558  ⟨cop 4564  ∩ cint 4876   class class class wbr 5070   × cxp 5578   ≈ cen 8688

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-int 4877  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-en 8692

This theorem is referenced by:  xpsneng  8797  endisj  8799  infxpenlem  9700  hashxplem  14076  rexpen  15865  heiborlem3  35898