ssnnctlemct - Intuitionistic Logic Explorer

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

Theorem ssnnctlemct 13057

Description: Lemma for ssnnct 13058. The result. (Contributed by Jim Kingdon, 29-Sep-2024.)

**Hypothesis**
Ref	Expression
ssnnctlem.g	⊢ 𝐺 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 1)

**Assertion**
Ref	Expression
ssnnctlemct	⊢ ((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥 ∈ 𝐴) → ∃𝑓 𝑓:ω–onto→(𝐴 ⊔ 1_o))

Distinct variable groups: 𝐴,𝑓 𝑥,𝐴 𝑓,𝐺 Allowed substitution hint: 𝐺(𝑥)

Proof of Theorem ssnnctlemct Dummy variables 𝑔 𝑧 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eleq1 2292	. . . . 5 ⊢ (𝑥 = 𝑧 → (𝑥 ∈ 𝐴 ↔ 𝑧 ∈ 𝐴))
2	1	dcbid 843	. . . 4 ⊢ (𝑥 = 𝑧 → (DECID 𝑥 ∈ 𝐴 ↔ DECID 𝑧 ∈ 𝐴))
3	2	cbvralv 2765	. . 3 ⊢ (∀𝑥 ∈ ℕ DECID 𝑥 ∈ 𝐴 ↔ ∀𝑧 ∈ ℕ DECID 𝑧 ∈ 𝐴)
4		imassrn 5085	. . . . 5 ⊢ (^◡𝐺 “ 𝐴) ⊆ ran ^◡𝐺
5		1z 9495	. . . . . . . . . 10 ⊢ 1 ∈ ℤ
6		id 19	. . . . . . . . . . 11 ⊢ (1 ∈ ℤ → 1 ∈ ℤ)
7		ssnnctlem.g	. . . . . . . . . . 11 ⊢ 𝐺 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 1)
8	6, 7	frec2uzf1od 10658	. . . . . . . . . 10 ⊢ (1 ∈ ℤ → 𝐺:ω–1-1-onto→(ℤ_≥‘1))
9	5, 8	ax-mp 5	. . . . . . . . 9 ⊢ 𝐺:ω–1-1-onto→(ℤ_≥‘1)
10		nnuz 9782	. . . . . . . . . 10 ⊢ ℕ = (ℤ_≥‘1)
11		f1oeq3 5570	. . . . . . . . . 10 ⊢ (ℕ = (ℤ_≥‘1) → (𝐺:ω–1-1-onto→ℕ ↔ 𝐺:ω–1-1-onto→(ℤ_≥‘1)))
12	10, 11	ax-mp 5	. . . . . . . . 9 ⊢ (𝐺:ω–1-1-onto→ℕ ↔ 𝐺:ω–1-1-onto→(ℤ_≥‘1))
13	9, 12	mpbir 146	. . . . . . . 8 ⊢ 𝐺:ω–1-1-onto→ℕ
14		f1ocnv 5593	. . . . . . . 8 ⊢ (𝐺:ω–1-1-onto→ℕ → ^◡𝐺:ℕ–1-1-onto→ω)
15	13, 14	ax-mp 5	. . . . . . 7 ⊢ ^◡𝐺:ℕ–1-1-onto→ω
16		dff1o5 5589	. . . . . . 7 ⊢ (^◡𝐺:ℕ–1-1-onto→ω ↔ (^◡𝐺:ℕ–1-1→ω ∧ ran ^◡𝐺 = ω))
17	15, 16	mpbi 145	. . . . . 6 ⊢ (^◡𝐺:ℕ–1-1→ω ∧ ran ^◡𝐺 = ω)
18	17	simpri 113	. . . . 5 ⊢ ran ^◡𝐺 = ω
19	4, 18	sseqtri 3259	. . . 4 ⊢ (^◡𝐺 “ 𝐴) ⊆ ω
20		eleq1 2292	. . . . . . . 8 ⊢ (𝑧 = (𝐺‘𝑦) → (𝑧 ∈ 𝐴 ↔ (𝐺‘𝑦) ∈ 𝐴))
21	20	dcbid 843	. . . . . . 7 ⊢ (𝑧 = (𝐺‘𝑦) → (DECID 𝑧 ∈ 𝐴 ↔ DECID (𝐺‘𝑦) ∈ 𝐴))
22		simplr 528	. . . . . . 7 ⊢ (((𝐴 ⊆ ℕ ∧ ∀𝑧 ∈ ℕ DECID 𝑧 ∈ 𝐴) ∧ 𝑦 ∈ ω) → ∀𝑧 ∈ ℕ DECID 𝑧 ∈ 𝐴)
23		f1of 5580	. . . . . . . . 9 ⊢ (𝐺:ω–1-1-onto→ℕ → 𝐺:ω⟶ℕ)
24	13, 23	mp1i 10	. . . . . . . 8 ⊢ (((𝐴 ⊆ ℕ ∧ ∀𝑧 ∈ ℕ DECID 𝑧 ∈ 𝐴) ∧ 𝑦 ∈ ω) → 𝐺:ω⟶ℕ)
25		simpr 110	. . . . . . . 8 ⊢ (((𝐴 ⊆ ℕ ∧ ∀𝑧 ∈ ℕ DECID 𝑧 ∈ 𝐴) ∧ 𝑦 ∈ ω) → 𝑦 ∈ ω)
26	24, 25	ffvelcdmd 5779	. . . . . . 7 ⊢ (((𝐴 ⊆ ℕ ∧ ∀𝑧 ∈ ℕ DECID 𝑧 ∈ 𝐴) ∧ 𝑦 ∈ ω) → (𝐺‘𝑦) ∈ ℕ)
27	21, 22, 26	rspcdva 2913	. . . . . 6 ⊢ (((𝐴 ⊆ ℕ ∧ ∀𝑧 ∈ ℕ DECID 𝑧 ∈ 𝐴) ∧ 𝑦 ∈ ω) → DECID (𝐺‘𝑦) ∈ 𝐴)
28		f1of1 5579	. . . . . . . . . 10 ⊢ (^◡𝐺:ℕ–1-1-onto→ω → ^◡𝐺:ℕ–1-1→ω)
29	15, 28	ax-mp 5	. . . . . . . . 9 ⊢ ^◡𝐺:ℕ–1-1→ω
30		simpll 527	. . . . . . . . 9 ⊢ (((𝐴 ⊆ ℕ ∧ ∀𝑧 ∈ ℕ DECID 𝑧 ∈ 𝐴) ∧ 𝑦 ∈ ω) → 𝐴 ⊆ ℕ)
31		f1elima 5909	. . . . . . . . 9 ⊢ ((^◡𝐺:ℕ–1-1→ω ∧ (𝐺‘𝑦) ∈ ℕ ∧ 𝐴 ⊆ ℕ) → ((^◡𝐺‘(𝐺‘𝑦)) ∈ (^◡𝐺 “ 𝐴) ↔ (𝐺‘𝑦) ∈ 𝐴))
32	29, 26, 30, 31	mp3an2i 1376	. . . . . . . 8 ⊢ (((𝐴 ⊆ ℕ ∧ ∀𝑧 ∈ ℕ DECID 𝑧 ∈ 𝐴) ∧ 𝑦 ∈ ω) → ((^◡𝐺‘(𝐺‘𝑦)) ∈ (^◡𝐺 “ 𝐴) ↔ (𝐺‘𝑦) ∈ 𝐴))
33		f1ocnvfv1 5913	. . . . . . . . . . 11 ⊢ ((𝐺:ω–1-1-onto→ℕ ∧ 𝑦 ∈ ω) → (^◡𝐺‘(𝐺‘𝑦)) = 𝑦)
34	13, 33	mpan 424	. . . . . . . . . 10 ⊢ (𝑦 ∈ ω → (^◡𝐺‘(𝐺‘𝑦)) = 𝑦)
35	34	adantl 277	. . . . . . . . 9 ⊢ (((𝐴 ⊆ ℕ ∧ ∀𝑧 ∈ ℕ DECID 𝑧 ∈ 𝐴) ∧ 𝑦 ∈ ω) → (^◡𝐺‘(𝐺‘𝑦)) = 𝑦)
36	35	eleq1d 2298	. . . . . . . 8 ⊢ (((𝐴 ⊆ ℕ ∧ ∀𝑧 ∈ ℕ DECID 𝑧 ∈ 𝐴) ∧ 𝑦 ∈ ω) → ((^◡𝐺‘(𝐺‘𝑦)) ∈ (^◡𝐺 “ 𝐴) ↔ 𝑦 ∈ (^◡𝐺 “ 𝐴)))
37	32, 36	bitr3d 190	. . . . . . 7 ⊢ (((𝐴 ⊆ ℕ ∧ ∀𝑧 ∈ ℕ DECID 𝑧 ∈ 𝐴) ∧ 𝑦 ∈ ω) → ((𝐺‘𝑦) ∈ 𝐴 ↔ 𝑦 ∈ (^◡𝐺 “ 𝐴)))
38	37	dcbid 843	. . . . . 6 ⊢ (((𝐴 ⊆ ℕ ∧ ∀𝑧 ∈ ℕ DECID 𝑧 ∈ 𝐴) ∧ 𝑦 ∈ ω) → (DECID (𝐺‘𝑦) ∈ 𝐴 ↔ DECID 𝑦 ∈ (^◡𝐺 “ 𝐴)))
39	27, 38	mpbid 147	. . . . 5 ⊢ (((𝐴 ⊆ ℕ ∧ ∀𝑧 ∈ ℕ DECID 𝑧 ∈ 𝐴) ∧ 𝑦 ∈ ω) → DECID 𝑦 ∈ (^◡𝐺 “ 𝐴))
40	39	ralrimiva 2603	. . . 4 ⊢ ((𝐴 ⊆ ℕ ∧ ∀𝑧 ∈ ℕ DECID 𝑧 ∈ 𝐴) → ∀𝑦 ∈ ω DECID 𝑦 ∈ (^◡𝐺 “ 𝐴))
41		ssomct 13056	. . . 4 ⊢ (((^◡𝐺 “ 𝐴) ⊆ ω ∧ ∀𝑦 ∈ ω DECID 𝑦 ∈ (^◡𝐺 “ 𝐴)) → ∃𝑔 𝑔:ω–onto→((^◡𝐺 “ 𝐴) ⊔ 1_o))
42	19, 40, 41	sylancr 414	. . 3 ⊢ ((𝐴 ⊆ ℕ ∧ ∀𝑧 ∈ ℕ DECID 𝑧 ∈ 𝐴) → ∃𝑔 𝑔:ω–onto→((^◡𝐺 “ 𝐴) ⊔ 1_o))
43	3, 42	sylan2b 287	. 2 ⊢ ((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥 ∈ 𝐴) → ∃𝑔 𝑔:ω–onto→((^◡𝐺 “ 𝐴) ⊔ 1_o))
44		nnex 9139	. . . . . 6 ⊢ ℕ ∈ V
45	44	ssex 4224	. . . . 5 ⊢ (𝐴 ⊆ ℕ → 𝐴 ∈ V)
46		f1ores 5595	. . . . . 6 ⊢ ((^◡𝐺:ℕ–1-1→ω ∧ 𝐴 ⊆ ℕ) → (^◡𝐺 ↾ 𝐴):𝐴–1-1-onto→(^◡𝐺 “ 𝐴))
47	29, 46	mpan 424	. . . . 5 ⊢ (𝐴 ⊆ ℕ → (^◡𝐺 ↾ 𝐴):𝐴–1-1-onto→(^◡𝐺 “ 𝐴))
48		f1oeng 6925	. . . . 5 ⊢ ((𝐴 ∈ V ∧ (^◡𝐺 ↾ 𝐴):𝐴–1-1-onto→(^◡𝐺 “ 𝐴)) → 𝐴 ≈ (^◡𝐺 “ 𝐴))
49	45, 47, 48	syl2anc 411	. . . 4 ⊢ (𝐴 ⊆ ℕ → 𝐴 ≈ (^◡𝐺 “ 𝐴))
50		enct 13044	. . . 4 ⊢ (𝐴 ≈ (^◡𝐺 “ 𝐴) → (∃𝑓 𝑓:ω–onto→(𝐴 ⊔ 1_o) ↔ ∃𝑔 𝑔:ω–onto→((^◡𝐺 “ 𝐴) ⊔ 1_o)))
51	49, 50	syl 14	. . 3 ⊢ (𝐴 ⊆ ℕ → (∃𝑓 𝑓:ω–onto→(𝐴 ⊔ 1_o) ↔ ∃𝑔 𝑔:ω–onto→((^◡𝐺 “ 𝐴) ⊔ 1_o)))
52	51	adantr 276	. 2 ⊢ ((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥 ∈ 𝐴) → (∃𝑓 𝑓:ω–onto→(𝐴 ⊔ 1_o) ↔ ∃𝑔 𝑔:ω–onto→((^◡𝐺 “ 𝐴) ⊔ 1_o)))
53	43, 52	mpbird 167	1 ⊢ ((𝐴 ⊆ ℕ ∧ ∀𝑥 ∈ ℕ DECID 𝑥 ∈ 𝐴) → ∃𝑓 𝑓:ω–onto→(𝐴 ⊔ 1_o))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 DECID wdc 839 = wceq 1395 ∃wex 1538 ∈ wcel 2200 ∀wral 2508 Vcvv 2800 ⊆ wss 3198 class class class wbr 4086 ↦ cmpt 4148 ωcom 4686 ^◡ccnv 4722 ran crn 4724 ↾ cres 4725 “ cima 4726 ⟶wf 5320 –1-1→wf1 5321 –onto→wfo 5322 –1-1-onto→wf1o 5323 ‘cfv 5324 (class class class)co 6013 freccfrec 6551 1_oc1o 6570 ≈ cen 6902 ⊔ cdju 7227 1c1 8023 + caddc 8025 ℕcn 9133 ℤcz 9469 ℤ_≥cuz 9745

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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4202 ax-sep 4205 ax-nul 4213 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-iinf 4684 ax-cnex 8113 ax-resscn 8114 ax-1cn 8115 ax-1re 8116 ax-icn 8117 ax-addcl 8118 ax-addrcl 8119 ax-mulcl 8120 ax-addcom 8122 ax-addass 8124 ax-distr 8126 ax-i2m1 8127 ax-0lt1 8128 ax-0id 8130 ax-rnegex 8131 ax-cnre 8133 ax-pre-ltirr 8134 ax-pre-ltwlin 8135 ax-pre-lttrn 8136 ax-pre-ltadd 8138

This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2802 df-sbc 3030 df-csb 3126 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-nul 3493 df-if 3604 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-int 3927 df-iun 3970 df-br 4087 df-opab 4149 df-mpt 4150 df-tr 4186 df-id 4388 df-iord 4461 df-on 4463 df-ilim 4464 df-suc 4466 df-iom 4687 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-f1 5329 df-fo 5330 df-f1o 5331 df-fv 5332 df-riota 5966 df-ov 6016 df-oprab 6017 df-mpo 6018 df-1st 6298 df-2nd 6299 df-recs 6466 df-frec 6552 df-1o 6577 df-er 6697 df-en 6905 df-dju 7228 df-inl 7237 df-inr 7238 df-case 7274 df-pnf 8206 df-mnf 8207 df-xr 8208 df-ltxr 8209 df-le 8210 df-sub 8342 df-neg 8343 df-inn 9134 df-n0 9393 df-z 9470 df-uz 9746

This theorem is referenced by: ssnnct 13058

W3C validator