xpfi - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > xpfi		GIF version

Theorem xpfi 6565

Description: The Cartesian product of two finite sets is finite. Lemma 8.1.16 of [AczelRathjen], p. 74. (Contributed by Jeff Madsen, 2-Sep-2009.) (Revised by Mario Carneiro, 12-Mar-2015.)

**Assertion**
Ref	Expression
xpfi	⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin) → (𝐴 × 𝐵) ∈ Fin)

Proof of Theorem xpfi Dummy variables 𝑤 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		xpeq1 4415	. . . . 5 ⊢ (𝑥 = ∅ → (𝑥 × 𝐵) = (∅ × 𝐵))
2	1	eleq1d 2151	. . . 4 ⊢ (𝑥 = ∅ → ((𝑥 × 𝐵) ∈ Fin ↔ (∅ × 𝐵) ∈ Fin))
3	2	imbi2d 228	. . 3 ⊢ (𝑥 = ∅ → ((𝐵 ∈ Fin → (𝑥 × 𝐵) ∈ Fin) ↔ (𝐵 ∈ Fin → (∅ × 𝐵) ∈ Fin)))
4		xpeq1 4415	. . . . 5 ⊢ (𝑥 = (𝑦 ∖ {𝑧}) → (𝑥 × 𝐵) = ((𝑦 ∖ {𝑧}) × 𝐵))
5	4	eleq1d 2151	. . . 4 ⊢ (𝑥 = (𝑦 ∖ {𝑧}) → ((𝑥 × 𝐵) ∈ Fin ↔ ((𝑦 ∖ {𝑧}) × 𝐵) ∈ Fin))
6	5	imbi2d 228	. . 3 ⊢ (𝑥 = (𝑦 ∖ {𝑧}) → ((𝐵 ∈ Fin → (𝑥 × 𝐵) ∈ Fin) ↔ (𝐵 ∈ Fin → ((𝑦 ∖ {𝑧}) × 𝐵) ∈ Fin)))
7		xpeq1 4415	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝑥 × 𝐵) = (𝑦 × 𝐵))
8	7	eleq1d 2151	. . . 4 ⊢ (𝑥 = 𝑦 → ((𝑥 × 𝐵) ∈ Fin ↔ (𝑦 × 𝐵) ∈ Fin))
9	8	imbi2d 228	. . 3 ⊢ (𝑥 = 𝑦 → ((𝐵 ∈ Fin → (𝑥 × 𝐵) ∈ Fin) ↔ (𝐵 ∈ Fin → (𝑦 × 𝐵) ∈ Fin)))
10		xpeq1 4415	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 × 𝐵) = (𝐴 × 𝐵))
11	10	eleq1d 2151	. . . 4 ⊢ (𝑥 = 𝐴 → ((𝑥 × 𝐵) ∈ Fin ↔ (𝐴 × 𝐵) ∈ Fin))
12	11	imbi2d 228	. . 3 ⊢ (𝑥 = 𝐴 → ((𝐵 ∈ Fin → (𝑥 × 𝐵) ∈ Fin) ↔ (𝐵 ∈ Fin → (𝐴 × 𝐵) ∈ Fin)))
13		0xp 4476	. . . . 5 ⊢ (∅ × 𝐵) = ∅
14		0fin 6530	. . . . 5 ⊢ ∅ ∈ Fin
15	13, 14	eqeltri 2155	. . . 4 ⊢ (∅ × 𝐵) ∈ Fin
16	15	a1i 9	. . 3 ⊢ (𝐵 ∈ Fin → (∅ × 𝐵) ∈ Fin)
17		xpeq1 4415	. . . . . . . 8 ⊢ (𝑦 = ∅ → (𝑦 × 𝐵) = (∅ × 𝐵))
18	17, 15	syl6eqel 2173	. . . . . . 7 ⊢ (𝑦 = ∅ → (𝑦 × 𝐵) ∈ Fin)
19	18	a1i13 24	. . . . . 6 ⊢ ((𝑦 ∈ Fin ∧ 𝐵 ∈ Fin) → (𝑦 = ∅ → (∀𝑧 ∈ 𝑦 (𝐵 ∈ Fin → ((𝑦 ∖ {𝑧}) × 𝐵) ∈ Fin) → (𝑦 × 𝐵) ∈ Fin)))
20		sneq 3433	. . . . . . . . . . . . . . 15 ⊢ (𝑧 = 𝑤 → {𝑧} = {𝑤})
21	20	difeq2d 3102	. . . . . . . . . . . . . 14 ⊢ (𝑧 = 𝑤 → (𝑦 ∖ {𝑧}) = (𝑦 ∖ {𝑤}))
22	21	xpeq1d 4424	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝑤 → ((𝑦 ∖ {𝑧}) × 𝐵) = ((𝑦 ∖ {𝑤}) × 𝐵))
23	22	eleq1d 2151	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑤 → (((𝑦 ∖ {𝑧}) × 𝐵) ∈ Fin ↔ ((𝑦 ∖ {𝑤}) × 𝐵) ∈ Fin))
24	23	imbi2d 228	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑤 → ((𝐵 ∈ Fin → ((𝑦 ∖ {𝑧}) × 𝐵) ∈ Fin) ↔ (𝐵 ∈ Fin → ((𝑦 ∖ {𝑤}) × 𝐵) ∈ Fin)))
25	24	rspcv 2708	. . . . . . . . . 10 ⊢ (𝑤 ∈ 𝑦 → (∀𝑧 ∈ 𝑦 (𝐵 ∈ Fin → ((𝑦 ∖ {𝑧}) × 𝐵) ∈ Fin) → (𝐵 ∈ Fin → ((𝑦 ∖ {𝑤}) × 𝐵) ∈ Fin)))
26	25	adantl 271	. . . . . . . . 9 ⊢ (((𝑦 ∈ Fin ∧ 𝐵 ∈ Fin) ∧ 𝑤 ∈ 𝑦) → (∀𝑧 ∈ 𝑦 (𝐵 ∈ Fin → ((𝑦 ∖ {𝑧}) × 𝐵) ∈ Fin) → (𝐵 ∈ Fin → ((𝑦 ∖ {𝑤}) × 𝐵) ∈ Fin)))
27		pm2.27 39	. . . . . . . . . 10 ⊢ (𝐵 ∈ Fin → ((𝐵 ∈ Fin → ((𝑦 ∖ {𝑤}) × 𝐵) ∈ Fin) → ((𝑦 ∖ {𝑤}) × 𝐵) ∈ Fin))
28	27	ad2antlr 473	. . . . . . . . 9 ⊢ (((𝑦 ∈ Fin ∧ 𝐵 ∈ Fin) ∧ 𝑤 ∈ 𝑦) → ((𝐵 ∈ Fin → ((𝑦 ∖ {𝑤}) × 𝐵) ∈ Fin) → ((𝑦 ∖ {𝑤}) × 𝐵) ∈ Fin))
29		vex 2615	. . . . . . . . . . . . . . 15 ⊢ 𝑤 ∈ V
30	29	snex 3984	. . . . . . . . . . . . . 14 ⊢ {𝑤} ∈ V
31		xpexg 4510	. . . . . . . . . . . . . 14 ⊢ (({𝑤} ∈ V ∧ 𝐵 ∈ Fin) → ({𝑤} × 𝐵) ∈ V)
32	30, 31	mpan 415	. . . . . . . . . . . . 13 ⊢ (𝐵 ∈ Fin → ({𝑤} × 𝐵) ∈ V)
33		id 19	. . . . . . . . . . . . 13 ⊢ (𝐵 ∈ Fin → 𝐵 ∈ Fin)
34		2ndconst 5922	. . . . . . . . . . . . . 14 ⊢ (𝑤 ∈ V → (2^nd ↾ ({𝑤} × 𝐵)):({𝑤} × 𝐵)–1-1-onto→𝐵)
35	29, 34	mp1i 10	. . . . . . . . . . . . 13 ⊢ (𝐵 ∈ Fin → (2^nd ↾ ({𝑤} × 𝐵)):({𝑤} × 𝐵)–1-1-onto→𝐵)
36		f1oen2g 6402	. . . . . . . . . . . . 13 ⊢ ((({𝑤} × 𝐵) ∈ V ∧ 𝐵 ∈ Fin ∧ (2^nd ↾ ({𝑤} × 𝐵)):({𝑤} × 𝐵)–1-1-onto→𝐵) → ({𝑤} × 𝐵) ≈ 𝐵)
37	32, 33, 35, 36	syl3anc 1170	. . . . . . . . . . . 12 ⊢ (𝐵 ∈ Fin → ({𝑤} × 𝐵) ≈ 𝐵)
38		enfii 6520	. . . . . . . . . . . 12 ⊢ ((𝐵 ∈ Fin ∧ ({𝑤} × 𝐵) ≈ 𝐵) → ({𝑤} × 𝐵) ∈ Fin)
39	37, 38	mpdan 412	. . . . . . . . . . 11 ⊢ (𝐵 ∈ Fin → ({𝑤} × 𝐵) ∈ Fin)
40	39	ad2antlr 473	. . . . . . . . . 10 ⊢ (((𝑦 ∈ Fin ∧ 𝐵 ∈ Fin) ∧ 𝑤 ∈ 𝑦) → ({𝑤} × 𝐵) ∈ Fin)
41		incom 3176	. . . . . . . . . . . . . 14 ⊢ ({𝑤} ∩ (𝑦 ∖ {𝑤})) = ((𝑦 ∖ {𝑤}) ∩ {𝑤})
42		disjdif 3337	. . . . . . . . . . . . . 14 ⊢ ({𝑤} ∩ (𝑦 ∖ {𝑤})) = ∅
43	41, 42	eqtr3i 2105	. . . . . . . . . . . . 13 ⊢ ((𝑦 ∖ {𝑤}) ∩ {𝑤}) = ∅
44		xpdisj1 4809	. . . . . . . . . . . . 13 ⊢ (((𝑦 ∖ {𝑤}) ∩ {𝑤}) = ∅ → (((𝑦 ∖ {𝑤}) × 𝐵) ∩ ({𝑤} × 𝐵)) = ∅)
45	43, 44	ax-mp 7	. . . . . . . . . . . 12 ⊢ (((𝑦 ∖ {𝑤}) × 𝐵) ∩ ({𝑤} × 𝐵)) = ∅
46		unfidisj 6559	. . . . . . . . . . . 12 ⊢ ((((𝑦 ∖ {𝑤}) × 𝐵) ∈ Fin ∧ ({𝑤} × 𝐵) ∈ Fin ∧ (((𝑦 ∖ {𝑤}) × 𝐵) ∩ ({𝑤} × 𝐵)) = ∅) → (((𝑦 ∖ {𝑤}) × 𝐵) ∪ ({𝑤} × 𝐵)) ∈ Fin)
47	45, 46	mp3an3 1258	. . . . . . . . . . 11 ⊢ ((((𝑦 ∖ {𝑤}) × 𝐵) ∈ Fin ∧ ({𝑤} × 𝐵) ∈ Fin) → (((𝑦 ∖ {𝑤}) × 𝐵) ∪ ({𝑤} × 𝐵)) ∈ Fin)
48		xpundir 4453	. . . . . . . . . . . . 13 ⊢ (((𝑦 ∖ {𝑤}) ∪ {𝑤}) × 𝐵) = (((𝑦 ∖ {𝑤}) × 𝐵) ∪ ({𝑤} × 𝐵))
49		fidifsnid 6517	. . . . . . . . . . . . . . 15 ⊢ ((𝑦 ∈ Fin ∧ 𝑤 ∈ 𝑦) → ((𝑦 ∖ {𝑤}) ∪ {𝑤}) = 𝑦)
50	49	adantlr 461	. . . . . . . . . . . . . 14 ⊢ (((𝑦 ∈ Fin ∧ 𝐵 ∈ Fin) ∧ 𝑤 ∈ 𝑦) → ((𝑦 ∖ {𝑤}) ∪ {𝑤}) = 𝑦)
51	50	xpeq1d 4424	. . . . . . . . . . . . 13 ⊢ (((𝑦 ∈ Fin ∧ 𝐵 ∈ Fin) ∧ 𝑤 ∈ 𝑦) → (((𝑦 ∖ {𝑤}) ∪ {𝑤}) × 𝐵) = (𝑦 × 𝐵))
52	48, 51	syl5eqr 2129	. . . . . . . . . . . 12 ⊢ (((𝑦 ∈ Fin ∧ 𝐵 ∈ Fin) ∧ 𝑤 ∈ 𝑦) → (((𝑦 ∖ {𝑤}) × 𝐵) ∪ ({𝑤} × 𝐵)) = (𝑦 × 𝐵))
53	52	eleq1d 2151	. . . . . . . . . . 11 ⊢ (((𝑦 ∈ Fin ∧ 𝐵 ∈ Fin) ∧ 𝑤 ∈ 𝑦) → ((((𝑦 ∖ {𝑤}) × 𝐵) ∪ ({𝑤} × 𝐵)) ∈ Fin ↔ (𝑦 × 𝐵) ∈ Fin))
54	47, 53	syl5ib 152	. . . . . . . . . 10 ⊢ (((𝑦 ∈ Fin ∧ 𝐵 ∈ Fin) ∧ 𝑤 ∈ 𝑦) → ((((𝑦 ∖ {𝑤}) × 𝐵) ∈ Fin ∧ ({𝑤} × 𝐵) ∈ Fin) → (𝑦 × 𝐵) ∈ Fin))
55	40, 54	mpan2d 419	. . . . . . . . 9 ⊢ (((𝑦 ∈ Fin ∧ 𝐵 ∈ Fin) ∧ 𝑤 ∈ 𝑦) → (((𝑦 ∖ {𝑤}) × 𝐵) ∈ Fin → (𝑦 × 𝐵) ∈ Fin))
56	26, 28, 55	3syld 56	. . . . . . . 8 ⊢ (((𝑦 ∈ Fin ∧ 𝐵 ∈ Fin) ∧ 𝑤 ∈ 𝑦) → (∀𝑧 ∈ 𝑦 (𝐵 ∈ Fin → ((𝑦 ∖ {𝑧}) × 𝐵) ∈ Fin) → (𝑦 × 𝐵) ∈ Fin))
57	56	ex 113	. . . . . . 7 ⊢ ((𝑦 ∈ Fin ∧ 𝐵 ∈ Fin) → (𝑤 ∈ 𝑦 → (∀𝑧 ∈ 𝑦 (𝐵 ∈ Fin → ((𝑦 ∖ {𝑧}) × 𝐵) ∈ Fin) → (𝑦 × 𝐵) ∈ Fin)))
58	57	exlimdv 1742	. . . . . 6 ⊢ ((𝑦 ∈ Fin ∧ 𝐵 ∈ Fin) → (∃𝑤 𝑤 ∈ 𝑦 → (∀𝑧 ∈ 𝑦 (𝐵 ∈ Fin → ((𝑦 ∖ {𝑧}) × 𝐵) ∈ Fin) → (𝑦 × 𝐵) ∈ Fin)))
59		fin0or 6532	. . . . . . 7 ⊢ (𝑦 ∈ Fin → (𝑦 = ∅ ∨ ∃𝑤 𝑤 ∈ 𝑦))
60	59	adantr 270	. . . . . 6 ⊢ ((𝑦 ∈ Fin ∧ 𝐵 ∈ Fin) → (𝑦 = ∅ ∨ ∃𝑤 𝑤 ∈ 𝑦))
61	19, 58, 60	mpjaod 671	. . . . 5 ⊢ ((𝑦 ∈ Fin ∧ 𝐵 ∈ Fin) → (∀𝑧 ∈ 𝑦 (𝐵 ∈ Fin → ((𝑦 ∖ {𝑧}) × 𝐵) ∈ Fin) → (𝑦 × 𝐵) ∈ Fin))
62	61	ex 113	. . . 4 ⊢ (𝑦 ∈ Fin → (𝐵 ∈ Fin → (∀𝑧 ∈ 𝑦 (𝐵 ∈ Fin → ((𝑦 ∖ {𝑧}) × 𝐵) ∈ Fin) → (𝑦 × 𝐵) ∈ Fin)))
63	62	com23 77	. . 3 ⊢ (𝑦 ∈ Fin → (∀𝑧 ∈ 𝑦 (𝐵 ∈ Fin → ((𝑦 ∖ {𝑧}) × 𝐵) ∈ Fin) → (𝐵 ∈ Fin → (𝑦 × 𝐵) ∈ Fin)))
64	3, 6, 9, 12, 16, 63	findcard 6534	. 2 ⊢ (𝐴 ∈ Fin → (𝐵 ∈ Fin → (𝐴 × 𝐵) ∈ Fin))
65	64	imp 122	1 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin) → (𝐴 × 𝐵) ∈ Fin)

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 102 ∨ wo 662 = wceq 1285 ∃wex 1422 ∈ wcel 1434 ∀wral 2353 Vcvv 2612 ∖ cdif 2981 ∪ cun 2982 ∩ cin 2983 ∅c0 3269 {csn 3422 class class class wbr 3811 × cxp 4399 ↾ cres 4403 –1-1-onto→wf1o 4968 2^nd c2nd 5845 ≈ cen 6385 Fincfn 6387

This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-in1 577 ax-in2 578 ax-io 663 ax-5 1377 ax-7 1378 ax-gen 1379 ax-ie1 1423 ax-ie2 1424 ax-8 1436 ax-10 1437 ax-11 1438 ax-i12 1439 ax-bndl 1440 ax-4 1441 ax-13 1445 ax-14 1446 ax-17 1460 ax-i9 1464 ax-ial 1468 ax-i5r 1469 ax-ext 2065 ax-coll 3919 ax-sep 3922 ax-nul 3930 ax-pow 3974 ax-pr 4000 ax-un 4224 ax-setind 4316 ax-iinf 4366

This theorem depends on definitions: df-bi 115 df-dc 777 df-3or 921 df-3an 922 df-tru 1288 df-fal 1291 df-nf 1391 df-sb 1688 df-eu 1946 df-mo 1947 df-clab 2070 df-cleq 2076 df-clel 2079 df-nfc 2212 df-ne 2250 df-ral 2358 df-rex 2359 df-reu 2360 df-rab 2362 df-v 2614 df-sbc 2827 df-csb 2920 df-dif 2986 df-un 2988 df-in 2990 df-ss 2997 df-nul 3270 df-if 3374 df-pw 3408 df-sn 3428 df-pr 3429 df-op 3431 df-uni 3628 df-int 3663 df-iun 3706 df-br 3812 df-opab 3866 df-mpt 3867 df-tr 3902 df-id 4084 df-iord 4157 df-on 4159 df-suc 4162 df-iom 4369 df-xp 4407 df-rel 4408 df-cnv 4409 df-co 4410 df-dm 4411 df-rn 4412 df-res 4413 df-ima 4414 df-iota 4934 df-fun 4971 df-fn 4972 df-f 4973 df-f1 4974 df-fo 4975 df-f1o 4976 df-fv 4977 df-1st 5846 df-2nd 5847 df-1o 6113 df-er 6222 df-en 6388 df-fin 6390

This theorem is referenced by: 3xpfi 6566 hashxp 10069 crth 10980 phimullem 10981

W3C validator