nnf1o - Intuitionistic Logic Explorer

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

Theorem nnf1o 12062

Description: Lemma for sum and product theorems. (Contributed by Jim Kingdon, 15-Aug-2022.)

**Hypotheses**
Ref	Expression
nnf1o.mn	⊢ (𝜑 → (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ))
nnf1o.m	⊢ (𝜑 → 𝐹:(1...𝑀)–1-1-onto→𝐴)
nnf1o.n	⊢ (𝜑 → 𝐺:(1...𝑁)–1-1-onto→𝐴)

**Assertion**
Ref	Expression
nnf1o	⊢ (𝜑 → 𝑁 = 𝑀)

**Proof of Theorem nnf1o**
Step	Hyp	Ref	Expression
1		1zzd 9604	. . . 4 ⊢ (𝜑 → 1 ∈ ℤ)
2		nnf1o.mn	. . . . . 6 ⊢ (𝜑 → (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ))
3	2	simprd 114	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℕ)
4	3	nnzd 9699	. . . 4 ⊢ (𝜑 → 𝑁 ∈ ℤ)
5	1, 4	fzfigd 10793	. . 3 ⊢ (𝜑 → (1...𝑁) ∈ Fin)
6		nnf1o.m	. . . . 5 ⊢ (𝜑 → 𝐹:(1...𝑀)–1-1-onto→𝐴)
7		f1ocnv 5627	. . . . 5 ⊢ (𝐹:(1...𝑀)–1-1-onto→𝐴 → ^◡𝐹:𝐴–1-1-onto→(1...𝑀))
8	6, 7	syl 14	. . . 4 ⊢ (𝜑 → ^◡𝐹:𝐴–1-1-onto→(1...𝑀))
9		nnf1o.n	. . . 4 ⊢ (𝜑 → 𝐺:(1...𝑁)–1-1-onto→𝐴)
10		f1oco 5637	. . . 4 ⊢ ((^◡𝐹:𝐴–1-1-onto→(1...𝑀) ∧ 𝐺:(1...𝑁)–1-1-onto→𝐴) → (^◡𝐹 ∘ 𝐺):(1...𝑁)–1-1-onto→(1...𝑀))
11	8, 9, 10	syl2anc 411	. . 3 ⊢ (𝜑 → (^◡𝐹 ∘ 𝐺):(1...𝑁)–1-1-onto→(1...𝑀))
12	5, 11	fihasheqf1od 11152	. 2 ⊢ (𝜑 → (♯‘(1...𝑁)) = (♯‘(1...𝑀)))
13		nnnn0 9503	. . 3 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℕ₀)
14		hashfz1 11146	. . 3 ⊢ (𝑁 ∈ ℕ₀ → (♯‘(1...𝑁)) = 𝑁)
15	3, 13, 14	3syl 17	. 2 ⊢ (𝜑 → (♯‘(1...𝑁)) = 𝑁)
16	2	simpld 112	. . 3 ⊢ (𝜑 → 𝑀 ∈ ℕ)
17		nnnn0 9503	. . 3 ⊢ (𝑀 ∈ ℕ → 𝑀 ∈ ℕ₀)
18		hashfz1 11146	. . 3 ⊢ (𝑀 ∈ ℕ₀ → (♯‘(1...𝑀)) = 𝑀)
19	16, 17, 18	3syl 17	. 2 ⊢ (𝜑 → (♯‘(1...𝑀)) = 𝑀)
20	12, 15, 19	3eqtr3d 2273	1 ⊢ (𝜑 → 𝑁 = 𝑀)

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2203 ^◡ccnv 4748 ∘ ccom 4753 –1-1-onto→wf1o 5351 ‘cfv 5352 (class class class)co 6050 1c1 8128 ℕcn 9237 ℕ₀cn0 9496 ...cfz 10342 ♯chash 11138

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-coll 4225 ax-sep 4228 ax-nul 4236 ax-pow 4287 ax-pr 4322 ax-un 4554 ax-setind 4659 ax-iinf 4710 ax-cnex 8218 ax-resscn 8219 ax-1cn 8220 ax-1re 8221 ax-icn 8222 ax-addcl 8223 ax-addrcl 8224 ax-mulcl 8225 ax-addcom 8227 ax-addass 8229 ax-distr 8231 ax-i2m1 8232 ax-0lt1 8233 ax-0id 8235 ax-rnegex 8236 ax-cnre 8238 ax-pre-ltirr 8239 ax-pre-ltwlin 8240 ax-pre-lttrn 8241 ax-pre-apti 8242 ax-pre-ltadd 8243

This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-nel 2508 df-ral 2525 df-rex 2526 df-reu 2527 df-rab 2529 df-v 2815 df-sbc 3043 df-csb 3139 df-dif 3213 df-un 3215 df-in 3217 df-ss 3224 df-nul 3509 df-if 3621 df-pw 3671 df-sn 3695 df-pr 3696 df-op 3698 df-uni 3915 df-int 3950 df-iun 3993 df-br 4110 df-opab 4172 df-mpt 4173 df-tr 4209 df-id 4414 df-iord 4487 df-on 4489 df-ilim 4490 df-suc 4492 df-iom 4713 df-xp 4755 df-rel 4756 df-cnv 4757 df-co 4758 df-dm 4759 df-rn 4760 df-res 4761 df-ima 4762 df-iota 5312 df-fun 5354 df-fn 5355 df-f 5356 df-f1 5357 df-fo 5358 df-f1o 5359 df-fv 5360 df-riota 6003 df-ov 6053 df-oprab 6054 df-mpo 6055 df-1st 6334 df-2nd 6335 df-recs 6536 df-frec 6622 df-1o 6647 df-er 6767 df-en 6976 df-dom 6977 df-fin 6978 df-pnf 8310 df-mnf 8311 df-xr 8312 df-ltxr 8313 df-le 8314 df-sub 8446 df-neg 8447 df-inn 9238 df-n0 9497 df-z 9578 df-uz 9854 df-fz 10343 df-ihash 11139

This theorem is referenced by: summodclem3 12066 prodmodclem3 12261

W3C validator