xpfi - Intuitionistic Logic Explorer

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

Theorem xpfi 6771

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 4513	. . . . 5 ⊢ (𝑥 = ∅ → (𝑥 × 𝐵) = (∅ × 𝐵))
2	1	eleq1d 2183	. . . 4 ⊢ (𝑥 = ∅ → ((𝑥 × 𝐵) ∈ Fin ↔ (∅ × 𝐵) ∈ Fin))
3	2	imbi2d 229	. . 3 ⊢ (𝑥 = ∅ → ((𝐵 ∈ Fin → (𝑥 × 𝐵) ∈ Fin) ↔ (𝐵 ∈ Fin → (∅ × 𝐵) ∈ Fin)))
4		xpeq1 4513	. . . . 5 ⊢ (𝑥 = (𝑦 ∖ {𝑧}) → (𝑥 × 𝐵) = ((𝑦 ∖ {𝑧}) × 𝐵))
5	4	eleq1d 2183	. . . 4 ⊢ (𝑥 = (𝑦 ∖ {𝑧}) → ((𝑥 × 𝐵) ∈ Fin ↔ ((𝑦 ∖ {𝑧}) × 𝐵) ∈ Fin))
6	5	imbi2d 229	. . 3 ⊢ (𝑥 = (𝑦 ∖ {𝑧}) → ((𝐵 ∈ Fin → (𝑥 × 𝐵) ∈ Fin) ↔ (𝐵 ∈ Fin → ((𝑦 ∖ {𝑧}) × 𝐵) ∈ Fin)))
7		xpeq1 4513	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝑥 × 𝐵) = (𝑦 × 𝐵))
8	7	eleq1d 2183	. . . 4 ⊢ (𝑥 = 𝑦 → ((𝑥 × 𝐵) ∈ Fin ↔ (𝑦 × 𝐵) ∈ Fin))
9	8	imbi2d 229	. . 3 ⊢ (𝑥 = 𝑦 → ((𝐵 ∈ Fin → (𝑥 × 𝐵) ∈ Fin) ↔ (𝐵 ∈ Fin → (𝑦 × 𝐵) ∈ Fin)))
10		xpeq1 4513	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 × 𝐵) = (𝐴 × 𝐵))
11	10	eleq1d 2183	. . . 4 ⊢ (𝑥 = 𝐴 → ((𝑥 × 𝐵) ∈ Fin ↔ (𝐴 × 𝐵) ∈ Fin))
12	11	imbi2d 229	. . 3 ⊢ (𝑥 = 𝐴 → ((𝐵 ∈ Fin → (𝑥 × 𝐵) ∈ Fin) ↔ (𝐵 ∈ Fin → (𝐴 × 𝐵) ∈ Fin)))
13		0xp 4579	. . . . 5 ⊢ (∅ × 𝐵) = ∅
14		0fin 6731	. . . . 5 ⊢ ∅ ∈ Fin
15	13, 14	eqeltri 2187	. . . 4 ⊢ (∅ × 𝐵) ∈ Fin
16	15	a1i 9	. . 3 ⊢ (𝐵 ∈ Fin → (∅ × 𝐵) ∈ Fin)
17		xpeq1 4513	. . . . . . . 8 ⊢ (𝑦 = ∅ → (𝑦 × 𝐵) = (∅ × 𝐵))
18	17, 15	syl6eqel 2205	. . . . . . 7 ⊢ (𝑦 = ∅ → (𝑦 × 𝐵) ∈ Fin)
19	18	a1i13 24	. . . . . 6 ⊢ ((𝑦 ∈ Fin ∧ 𝐵 ∈ Fin) → (𝑦 = ∅ → (∀𝑧 ∈ 𝑦 (𝐵 ∈ Fin → ((𝑦 ∖ {𝑧}) × 𝐵) ∈ Fin) → (𝑦 × 𝐵) ∈ Fin)))
20		sneq 3504	. . . . . . . . . . . . . . 15 ⊢ (𝑧 = 𝑤 → {𝑧} = {𝑤})
21	20	difeq2d 3160	. . . . . . . . . . . . . 14 ⊢ (𝑧 = 𝑤 → (𝑦 ∖ {𝑧}) = (𝑦 ∖ {𝑤}))
22	21	xpeq1d 4522	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝑤 → ((𝑦 ∖ {𝑧}) × 𝐵) = ((𝑦 ∖ {𝑤}) × 𝐵))
23	22	eleq1d 2183	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑤 → (((𝑦 ∖ {𝑧}) × 𝐵) ∈ Fin ↔ ((𝑦 ∖ {𝑤}) × 𝐵) ∈ Fin))
24	23	imbi2d 229	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑤 → ((𝐵 ∈ Fin → ((𝑦 ∖ {𝑧}) × 𝐵) ∈ Fin) ↔ (𝐵 ∈ Fin → ((𝑦 ∖ {𝑤}) × 𝐵) ∈ Fin)))
25	24	rspcv 2756	. . . . . . . . . 10 ⊢ (𝑤 ∈ 𝑦 → (∀𝑧 ∈ 𝑦 (𝐵 ∈ Fin → ((𝑦 ∖ {𝑧}) × 𝐵) ∈ Fin) → (𝐵 ∈ Fin → ((𝑦 ∖ {𝑤}) × 𝐵) ∈ Fin)))
26	25	adantl 273	. . . . . . . . 9 ⊢ (((𝑦 ∈ Fin ∧ 𝐵 ∈ Fin) ∧ 𝑤 ∈ 𝑦) → (∀𝑧 ∈ 𝑦 (𝐵 ∈ Fin → ((𝑦 ∖ {𝑧}) × 𝐵) ∈ Fin) → (𝐵 ∈ Fin → ((𝑦 ∖ {𝑤}) × 𝐵) ∈ Fin)))
27		pm2.27 40	. . . . . . . . . 10 ⊢ (𝐵 ∈ Fin → ((𝐵 ∈ Fin → ((𝑦 ∖ {𝑤}) × 𝐵) ∈ Fin) → ((𝑦 ∖ {𝑤}) × 𝐵) ∈ Fin))
28	27	ad2antlr 478	. . . . . . . . 9 ⊢ (((𝑦 ∈ Fin ∧ 𝐵 ∈ Fin) ∧ 𝑤 ∈ 𝑦) → ((𝐵 ∈ Fin → ((𝑦 ∖ {𝑤}) × 𝐵) ∈ Fin) → ((𝑦 ∖ {𝑤}) × 𝐵) ∈ Fin))
29		vex 2660	. . . . . . . . . . . . . . 15 ⊢ 𝑤 ∈ V
30	29	snex 4069	. . . . . . . . . . . . . 14 ⊢ {𝑤} ∈ V
31		xpexg 4613	. . . . . . . . . . . . . 14 ⊢ (({𝑤} ∈ V ∧ 𝐵 ∈ Fin) → ({𝑤} × 𝐵) ∈ V)
32	30, 31	mpan 418	. . . . . . . . . . . . 13 ⊢ (𝐵 ∈ Fin → ({𝑤} × 𝐵) ∈ V)
33		id 19	. . . . . . . . . . . . 13 ⊢ (𝐵 ∈ Fin → 𝐵 ∈ Fin)
34		2ndconst 6073	. . . . . . . . . . . . . 14 ⊢ (𝑤 ∈ V → (2^nd ↾ ({𝑤} × 𝐵)):({𝑤} × 𝐵)–1-1-onto→𝐵)
35	29, 34	mp1i 10	. . . . . . . . . . . . 13 ⊢ (𝐵 ∈ Fin → (2^nd ↾ ({𝑤} × 𝐵)):({𝑤} × 𝐵)–1-1-onto→𝐵)
36		f1oen2g 6603	. . . . . . . . . . . . 13 ⊢ ((({𝑤} × 𝐵) ∈ V ∧ 𝐵 ∈ Fin ∧ (2^nd ↾ ({𝑤} × 𝐵)):({𝑤} × 𝐵)–1-1-onto→𝐵) → ({𝑤} × 𝐵) ≈ 𝐵)
37	32, 33, 35, 36	syl3anc 1199	. . . . . . . . . . . 12 ⊢ (𝐵 ∈ Fin → ({𝑤} × 𝐵) ≈ 𝐵)
38		enfii 6721	. . . . . . . . . . . 12 ⊢ ((𝐵 ∈ Fin ∧ ({𝑤} × 𝐵) ≈ 𝐵) → ({𝑤} × 𝐵) ∈ Fin)
39	37, 38	mpdan 415	. . . . . . . . . . 11 ⊢ (𝐵 ∈ Fin → ({𝑤} × 𝐵) ∈ Fin)
40	39	ad2antlr 478	. . . . . . . . . 10 ⊢ (((𝑦 ∈ Fin ∧ 𝐵 ∈ Fin) ∧ 𝑤 ∈ 𝑦) → ({𝑤} × 𝐵) ∈ Fin)
41		incom 3234	. . . . . . . . . . . . . 14 ⊢ ({𝑤} ∩ (𝑦 ∖ {𝑤})) = ((𝑦 ∖ {𝑤}) ∩ {𝑤})
42		disjdif 3401	. . . . . . . . . . . . . 14 ⊢ ({𝑤} ∩ (𝑦 ∖ {𝑤})) = ∅
43	41, 42	eqtr3i 2137	. . . . . . . . . . . . 13 ⊢ ((𝑦 ∖ {𝑤}) ∩ {𝑤}) = ∅
44		xpdisj1 4921	. . . . . . . . . . . . 13 ⊢ (((𝑦 ∖ {𝑤}) ∩ {𝑤}) = ∅ → (((𝑦 ∖ {𝑤}) × 𝐵) ∩ ({𝑤} × 𝐵)) = ∅)
45	43, 44	ax-mp 7	. . . . . . . . . . . 12 ⊢ (((𝑦 ∖ {𝑤}) × 𝐵) ∩ ({𝑤} × 𝐵)) = ∅
46		unfidisj 6763	. . . . . . . . . . . 12 ⊢ ((((𝑦 ∖ {𝑤}) × 𝐵) ∈ Fin ∧ ({𝑤} × 𝐵) ∈ Fin ∧ (((𝑦 ∖ {𝑤}) × 𝐵) ∩ ({𝑤} × 𝐵)) = ∅) → (((𝑦 ∖ {𝑤}) × 𝐵) ∪ ({𝑤} × 𝐵)) ∈ Fin)
47	45, 46	mp3an3 1287	. . . . . . . . . . 11 ⊢ ((((𝑦 ∖ {𝑤}) × 𝐵) ∈ Fin ∧ ({𝑤} × 𝐵) ∈ Fin) → (((𝑦 ∖ {𝑤}) × 𝐵) ∪ ({𝑤} × 𝐵)) ∈ Fin)
48		xpundir 4556	. . . . . . . . . . . . 13 ⊢ (((𝑦 ∖ {𝑤}) ∪ {𝑤}) × 𝐵) = (((𝑦 ∖ {𝑤}) × 𝐵) ∪ ({𝑤} × 𝐵))
49		fidifsnid 6718	. . . . . . . . . . . . . . 15 ⊢ ((𝑦 ∈ Fin ∧ 𝑤 ∈ 𝑦) → ((𝑦 ∖ {𝑤}) ∪ {𝑤}) = 𝑦)
50	49	adantlr 466	. . . . . . . . . . . . . 14 ⊢ (((𝑦 ∈ Fin ∧ 𝐵 ∈ Fin) ∧ 𝑤 ∈ 𝑦) → ((𝑦 ∖ {𝑤}) ∪ {𝑤}) = 𝑦)
51	50	xpeq1d 4522	. . . . . . . . . . . . 13 ⊢ (((𝑦 ∈ Fin ∧ 𝐵 ∈ Fin) ∧ 𝑤 ∈ 𝑦) → (((𝑦 ∖ {𝑤}) ∪ {𝑤}) × 𝐵) = (𝑦 × 𝐵))
52	48, 51	syl5eqr 2161	. . . . . . . . . . . 12 ⊢ (((𝑦 ∈ Fin ∧ 𝐵 ∈ Fin) ∧ 𝑤 ∈ 𝑦) → (((𝑦 ∖ {𝑤}) × 𝐵) ∪ ({𝑤} × 𝐵)) = (𝑦 × 𝐵))
53	52	eleq1d 2183	. . . . . . . . . . 11 ⊢ (((𝑦 ∈ Fin ∧ 𝐵 ∈ Fin) ∧ 𝑤 ∈ 𝑦) → ((((𝑦 ∖ {𝑤}) × 𝐵) ∪ ({𝑤} × 𝐵)) ∈ Fin ↔ (𝑦 × 𝐵) ∈ Fin))
54	47, 53	syl5ib 153	. . . . . . . . . 10 ⊢ (((𝑦 ∈ Fin ∧ 𝐵 ∈ Fin) ∧ 𝑤 ∈ 𝑦) → ((((𝑦 ∖ {𝑤}) × 𝐵) ∈ Fin ∧ ({𝑤} × 𝐵) ∈ Fin) → (𝑦 × 𝐵) ∈ Fin))
55	40, 54	mpan2d 422	. . . . . . . . 9 ⊢ (((𝑦 ∈ Fin ∧ 𝐵 ∈ Fin) ∧ 𝑤 ∈ 𝑦) → (((𝑦 ∖ {𝑤}) × 𝐵) ∈ Fin → (𝑦 × 𝐵) ∈ Fin))
56	26, 28, 55	3syld 57	. . . . . . . 8 ⊢ (((𝑦 ∈ Fin ∧ 𝐵 ∈ Fin) ∧ 𝑤 ∈ 𝑦) → (∀𝑧 ∈ 𝑦 (𝐵 ∈ Fin → ((𝑦 ∖ {𝑧}) × 𝐵) ∈ Fin) → (𝑦 × 𝐵) ∈ Fin))
57	56	ex 114	. . . . . . 7 ⊢ ((𝑦 ∈ Fin ∧ 𝐵 ∈ Fin) → (𝑤 ∈ 𝑦 → (∀𝑧 ∈ 𝑦 (𝐵 ∈ Fin → ((𝑦 ∖ {𝑧}) × 𝐵) ∈ Fin) → (𝑦 × 𝐵) ∈ Fin)))
58	57	exlimdv 1773	. . . . . 6 ⊢ ((𝑦 ∈ Fin ∧ 𝐵 ∈ Fin) → (∃𝑤 𝑤 ∈ 𝑦 → (∀𝑧 ∈ 𝑦 (𝐵 ∈ Fin → ((𝑦 ∖ {𝑧}) × 𝐵) ∈ Fin) → (𝑦 × 𝐵) ∈ Fin)))
59		fin0or 6733	. . . . . . 7 ⊢ (𝑦 ∈ Fin → (𝑦 = ∅ ∨ ∃𝑤 𝑤 ∈ 𝑦))
60	59	adantr 272	. . . . . 6 ⊢ ((𝑦 ∈ Fin ∧ 𝐵 ∈ Fin) → (𝑦 = ∅ ∨ ∃𝑤 𝑤 ∈ 𝑦))
61	19, 58, 60	mpjaod 690	. . . . 5 ⊢ ((𝑦 ∈ Fin ∧ 𝐵 ∈ Fin) → (∀𝑧 ∈ 𝑦 (𝐵 ∈ Fin → ((𝑦 ∖ {𝑧}) × 𝐵) ∈ Fin) → (𝑦 × 𝐵) ∈ Fin))
62	61	ex 114	. . . 4 ⊢ (𝑦 ∈ Fin → (𝐵 ∈ Fin → (∀𝑧 ∈ 𝑦 (𝐵 ∈ Fin → ((𝑦 ∖ {𝑧}) × 𝐵) ∈ Fin) → (𝑦 × 𝐵) ∈ Fin)))
63	62	com23 78	. . 3 ⊢ (𝑦 ∈ Fin → (∀𝑧 ∈ 𝑦 (𝐵 ∈ Fin → ((𝑦 ∖ {𝑧}) × 𝐵) ∈ Fin) → (𝐵 ∈ Fin → (𝑦 × 𝐵) ∈ Fin)))
64	3, 6, 9, 12, 16, 63	findcard 6735	. 2 ⊢ (𝐴 ∈ Fin → (𝐵 ∈ Fin → (𝐴 × 𝐵) ∈ Fin))
65	64	imp 123	1 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin) → (𝐴 × 𝐵) ∈ Fin)

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 103 ∨ wo 680 = wceq 1314 ∃wex 1451 ∈ wcel 1463 ∀wral 2390 Vcvv 2657 ∖ cdif 3034 ∪ cun 3035 ∩ cin 3036 ∅c0 3329 {csn 3493 class class class wbr 3895 × cxp 4497 ↾ cres 4501 –1-1-onto→wf1o 5080 2^nd c2nd 5991 ≈ cen 6586 Fincfn 6588

This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 586 ax-in2 587 ax-io 681 ax-5 1406 ax-7 1407 ax-gen 1408 ax-ie1 1452 ax-ie2 1453 ax-8 1465 ax-10 1466 ax-11 1467 ax-i12 1468 ax-bndl 1469 ax-4 1470 ax-13 1474 ax-14 1475 ax-17 1489 ax-i9 1493 ax-ial 1497 ax-i5r 1498 ax-ext 2097 ax-coll 4003 ax-sep 4006 ax-nul 4014 ax-pow 4058 ax-pr 4091 ax-un 4315 ax-setind 4412 ax-iinf 4462

This theorem depends on definitions: df-bi 116 df-dc 803 df-3or 946 df-3an 947 df-tru 1317 df-fal 1320 df-nf 1420 df-sb 1719 df-eu 1978 df-mo 1979 df-clab 2102 df-cleq 2108 df-clel 2111 df-nfc 2244 df-ne 2283 df-ral 2395 df-rex 2396 df-reu 2397 df-rab 2399 df-v 2659 df-sbc 2879 df-csb 2972 df-dif 3039 df-un 3041 df-in 3043 df-ss 3050 df-nul 3330 df-if 3441 df-pw 3478 df-sn 3499 df-pr 3500 df-op 3502 df-uni 3703 df-int 3738 df-iun 3781 df-br 3896 df-opab 3950 df-mpt 3951 df-tr 3987 df-id 4175 df-iord 4248 df-on 4250 df-suc 4253 df-iom 4465 df-xp 4505 df-rel 4506 df-cnv 4507 df-co 4508 df-dm 4509 df-rn 4510 df-res 4511 df-ima 4512 df-iota 5046 df-fun 5083 df-fn 5084 df-f 5085 df-f1 5086 df-fo 5087 df-f1o 5088 df-fv 5089 df-1st 5992 df-2nd 5993 df-1o 6267 df-er 6383 df-en 6589 df-fin 6591

This theorem is referenced by: 3xpfi 6772 hashxp 10465 fsum2dlemstep 11095 fisumcom2 11099 crth 11745 phimullem 11746

W3C validator