ctiunctlemudc - Intuitionistic Logic Explorer

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

Theorem ctiunctlemudc 12597

Description: Lemma for ctiunct 12600. (Contributed by Jim Kingdon, 28-Oct-2023.)

**Hypotheses**
Ref	Expression
ctiunct.som	⊢ (𝜑 → 𝑆 ⊆ ω)
ctiunct.sdc	⊢ (𝜑 → ∀𝑛 ∈ ω DECID 𝑛 ∈ 𝑆)
ctiunct.f	⊢ (𝜑 → 𝐹:𝑆–onto→𝐴)
ctiunct.tom	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑇 ⊆ ω)
ctiunct.tdc	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ∀𝑛 ∈ ω DECID 𝑛 ∈ 𝑇)
ctiunct.g	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐺:𝑇–onto→𝐵)
ctiunct.j	⊢ (𝜑 → 𝐽:ω–1-1-onto→(ω × ω))
ctiunct.u	⊢ 𝑈 = {𝑧 ∈ ω ∣ ((1^st ‘(𝐽‘𝑧)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑧)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑧))) / 𝑥⦌𝑇)}

**Assertion**
Ref	Expression
ctiunctlemudc	⊢ (𝜑 → ∀𝑛 ∈ ω DECID 𝑛 ∈ 𝑈)

Distinct variable groups: 𝑥,𝐴 𝑛,𝐹,𝑥 𝑧,𝐹,𝑥 𝑛,𝐽,𝑥 𝑧,𝐽 𝑆,𝑛 𝑧,𝑆 𝑇,𝑛 𝑧,𝑇 𝑈,𝑛 𝜑,𝑥 Allowed substitution hints: 𝜑(𝑧,𝑛) 𝐴(𝑧,𝑛) 𝐵(𝑥,𝑧,𝑛) 𝑆(𝑥) 𝑇(𝑥) 𝑈(𝑥,𝑧) 𝐺(𝑥,𝑧,𝑛)

Proof of Theorem ctiunctlemudc Dummy variable 𝑚 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eleq1 2256	. . . . . . . . 9 ⊢ (𝑛 = (1^st ‘(𝐽‘𝑚)) → (𝑛 ∈ 𝑆 ↔ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆))
2	1	dcbid 839	. . . . . . . 8 ⊢ (𝑛 = (1^st ‘(𝐽‘𝑚)) → (DECID 𝑛 ∈ 𝑆 ↔ DECID (1^st ‘(𝐽‘𝑚)) ∈ 𝑆))
3		ctiunct.sdc	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑛 ∈ ω DECID 𝑛 ∈ 𝑆)
4	3	adantr 276	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑚 ∈ ω) → ∀𝑛 ∈ ω DECID 𝑛 ∈ 𝑆)
5		ctiunct.j	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐽:ω–1-1-onto→(ω × ω))
6	5	adantr 276	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑚 ∈ ω) → 𝐽:ω–1-1-onto→(ω × ω))
7		f1of 5501	. . . . . . . . . . 11 ⊢ (𝐽:ω–1-1-onto→(ω × ω) → 𝐽:ω⟶(ω × ω))
8	6, 7	syl 14	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑚 ∈ ω) → 𝐽:ω⟶(ω × ω))
9		simpr 110	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑚 ∈ ω) → 𝑚 ∈ ω)
10	8, 9	ffvelcdmd 5695	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑚 ∈ ω) → (𝐽‘𝑚) ∈ (ω × ω))
11		xp1st 6220	. . . . . . . . 9 ⊢ ((𝐽‘𝑚) ∈ (ω × ω) → (1^st ‘(𝐽‘𝑚)) ∈ ω)
12	10, 11	syl 14	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑚 ∈ ω) → (1^st ‘(𝐽‘𝑚)) ∈ ω)
13	2, 4, 12	rspcdva 2870	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑚 ∈ ω) → DECID (1^st ‘(𝐽‘𝑚)) ∈ 𝑆)
14	13	adantr 276	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ ω) ∧ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆) → DECID (1^st ‘(𝐽‘𝑚)) ∈ 𝑆)
15		eleq1 2256	. . . . . . . 8 ⊢ (𝑛 = (2^nd ‘(𝐽‘𝑚)) → (𝑛 ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇 ↔ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇))
16	15	dcbid 839	. . . . . . 7 ⊢ (𝑛 = (2^nd ‘(𝐽‘𝑚)) → (DECID 𝑛 ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇 ↔ DECID (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇))
17		ctiunct.f	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐹:𝑆–onto→𝐴)
18		fof 5477	. . . . . . . . . . 11 ⊢ (𝐹:𝑆–onto→𝐴 → 𝐹:𝑆⟶𝐴)
19	17, 18	syl 14	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹:𝑆⟶𝐴)
20	19	ad2antrr 488	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑚 ∈ ω) ∧ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆) → 𝐹:𝑆⟶𝐴)
21		simpr 110	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑚 ∈ ω) ∧ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆) → (1^st ‘(𝐽‘𝑚)) ∈ 𝑆)
22	20, 21	ffvelcdmd 5695	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ ω) ∧ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆) → (𝐹‘(1^st ‘(𝐽‘𝑚))) ∈ 𝐴)
23		ctiunct.tdc	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ∀𝑛 ∈ ω DECID 𝑛 ∈ 𝑇)
24	23	ralrimiva 2567	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑛 ∈ ω DECID 𝑛 ∈ 𝑇)
25	24	ad2antrr 488	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ ω) ∧ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆) → ∀𝑥 ∈ 𝐴 ∀𝑛 ∈ ω DECID 𝑛 ∈ 𝑇)
26		nfcv 2336	. . . . . . . . . 10 ⊢ Ⅎ𝑥ω
27		nfcsb1v 3114	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇
28	27	nfcri 2330	. . . . . . . . . . 11 ⊢ Ⅎ𝑥 𝑛 ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇
29	28	nfdc 1670	. . . . . . . . . 10 ⊢ Ⅎ𝑥DECID 𝑛 ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇
30	26, 29	nfralya 2534	. . . . . . . . 9 ⊢ Ⅎ𝑥∀𝑛 ∈ ω DECID 𝑛 ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇
31		csbeq1a 3090	. . . . . . . . . . . 12 ⊢ (𝑥 = (𝐹‘(1^st ‘(𝐽‘𝑚))) → 𝑇 = ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇)
32	31	eleq2d 2263	. . . . . . . . . . 11 ⊢ (𝑥 = (𝐹‘(1^st ‘(𝐽‘𝑚))) → (𝑛 ∈ 𝑇 ↔ 𝑛 ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇))
33	32	dcbid 839	. . . . . . . . . 10 ⊢ (𝑥 = (𝐹‘(1^st ‘(𝐽‘𝑚))) → (DECID 𝑛 ∈ 𝑇 ↔ DECID 𝑛 ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇))
34	33	ralbidv 2494	. . . . . . . . 9 ⊢ (𝑥 = (𝐹‘(1^st ‘(𝐽‘𝑚))) → (∀𝑛 ∈ ω DECID 𝑛 ∈ 𝑇 ↔ ∀𝑛 ∈ ω DECID 𝑛 ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇))
35	30, 34	rspc 2859	. . . . . . . 8 ⊢ ((𝐹‘(1^st ‘(𝐽‘𝑚))) ∈ 𝐴 → (∀𝑥 ∈ 𝐴 ∀𝑛 ∈ ω DECID 𝑛 ∈ 𝑇 → ∀𝑛 ∈ ω DECID 𝑛 ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇))
36	22, 25, 35	sylc 62	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ω) ∧ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆) → ∀𝑛 ∈ ω DECID 𝑛 ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇)
37	10	adantr 276	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ ω) ∧ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆) → (𝐽‘𝑚) ∈ (ω × ω))
38		xp2nd 6221	. . . . . . . 8 ⊢ ((𝐽‘𝑚) ∈ (ω × ω) → (2^nd ‘(𝐽‘𝑚)) ∈ ω)
39	37, 38	syl 14	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ω) ∧ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆) → (2^nd ‘(𝐽‘𝑚)) ∈ ω)
40	16, 36, 39	rspcdva 2870	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ ω) ∧ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆) → DECID (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇)
41		dcan2 936	. . . . . 6 ⊢ (DECID (1^st ‘(𝐽‘𝑚)) ∈ 𝑆 → (DECID (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇 → DECID ((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇)))
42	14, 40, 41	sylc 62	. . . . 5 ⊢ (((𝜑 ∧ 𝑚 ∈ ω) ∧ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆) → DECID ((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇))
43		simpr 110	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ ω) ∧ ¬ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆) → ¬ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆)
44	43	intnanrd 933	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ω) ∧ ¬ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆) → ¬ ((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇))
45	44	olcd 735	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ ω) ∧ ¬ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆) → (((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇) ∨ ¬ ((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇)))
46		df-dc 836	. . . . . 6 ⊢ (DECID ((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇) ↔ (((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇) ∨ ¬ ((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇)))
47	45, 46	sylibr 134	. . . . 5 ⊢ (((𝜑 ∧ 𝑚 ∈ ω) ∧ ¬ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆) → DECID ((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇))
48		exmiddc 837	. . . . . 6 ⊢ (DECID (1^st ‘(𝐽‘𝑚)) ∈ 𝑆 → ((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∨ ¬ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆))
49	13, 48	syl 14	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ ω) → ((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∨ ¬ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆))
50	42, 47, 49	mpjaodan 799	. . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ ω) → DECID ((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇))
51		2fveq3 5560	. . . . . . . . 9 ⊢ (𝑧 = 𝑚 → (1^st ‘(𝐽‘𝑧)) = (1^st ‘(𝐽‘𝑚)))
52	51	eleq1d 2262	. . . . . . . 8 ⊢ (𝑧 = 𝑚 → ((1^st ‘(𝐽‘𝑧)) ∈ 𝑆 ↔ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆))
53		2fveq3 5560	. . . . . . . . 9 ⊢ (𝑧 = 𝑚 → (2^nd ‘(𝐽‘𝑧)) = (2^nd ‘(𝐽‘𝑚)))
54	51	fveq2d 5559	. . . . . . . . . 10 ⊢ (𝑧 = 𝑚 → (𝐹‘(1^st ‘(𝐽‘𝑧))) = (𝐹‘(1^st ‘(𝐽‘𝑚))))
55	54	csbeq1d 3088	. . . . . . . . 9 ⊢ (𝑧 = 𝑚 → ⦋(𝐹‘(1^st ‘(𝐽‘𝑧))) / 𝑥⦌𝑇 = ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇)
56	53, 55	eleq12d 2264	. . . . . . . 8 ⊢ (𝑧 = 𝑚 → ((2^nd ‘(𝐽‘𝑧)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑧))) / 𝑥⦌𝑇 ↔ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇))
57	52, 56	anbi12d 473	. . . . . . 7 ⊢ (𝑧 = 𝑚 → (((1^st ‘(𝐽‘𝑧)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑧)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑧))) / 𝑥⦌𝑇) ↔ ((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇)))
58		ctiunct.u	. . . . . . 7 ⊢ 𝑈 = {𝑧 ∈ ω ∣ ((1^st ‘(𝐽‘𝑧)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑧)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑧))) / 𝑥⦌𝑇)}
59	57, 58	elrab2 2920	. . . . . 6 ⊢ (𝑚 ∈ 𝑈 ↔ (𝑚 ∈ ω ∧ ((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇)))
60		ibar 301	. . . . . . 7 ⊢ (𝑚 ∈ ω → (((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇) ↔ (𝑚 ∈ ω ∧ ((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇))))
61	60	adantl 277	. . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ ω) → (((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇) ↔ (𝑚 ∈ ω ∧ ((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇))))
62	59, 61	bitr4id 199	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ ω) → (𝑚 ∈ 𝑈 ↔ ((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇)))
63	62	dcbid 839	. . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ ω) → (DECID 𝑚 ∈ 𝑈 ↔ DECID ((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇)))
64	50, 63	mpbird 167	. . 3 ⊢ ((𝜑 ∧ 𝑚 ∈ ω) → DECID 𝑚 ∈ 𝑈)
65	64	ralrimiva 2567	. 2 ⊢ (𝜑 → ∀𝑚 ∈ ω DECID 𝑚 ∈ 𝑈)
66		eleq1 2256	. . . 4 ⊢ (𝑚 = 𝑛 → (𝑚 ∈ 𝑈 ↔ 𝑛 ∈ 𝑈))
67	66	dcbid 839	. . 3 ⊢ (𝑚 = 𝑛 → (DECID 𝑚 ∈ 𝑈 ↔ DECID 𝑛 ∈ 𝑈))
68	67	cbvralv 2726	. 2 ⊢ (∀𝑚 ∈ ω DECID 𝑚 ∈ 𝑈 ↔ ∀𝑛 ∈ ω DECID 𝑛 ∈ 𝑈)
69	65, 68	sylib 122	1 ⊢ (𝜑 → ∀𝑛 ∈ ω DECID 𝑛 ∈ 𝑈)

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 709 DECID wdc 835 = wceq 1364 ∈ wcel 2164 ∀wral 2472 {crab 2476 ⦋csb 3081 ⊆ wss 3154 ωcom 4623 × cxp 4658 ⟶wf 5251 –onto→wfo 5253 –1-1-onto→wf1o 5254 ‘cfv 5255 1^st c1st 6193 2^nd c2nd 6194

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 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-sep 4148 ax-pow 4204 ax-pr 4239 ax-un 4465

This theorem depends on definitions: df-bi 117 df-dc 836 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ral 2477 df-rex 2478 df-rab 2481 df-v 2762 df-sbc 2987 df-csb 3082 df-un 3158 df-in 3160 df-ss 3167 df-pw 3604 df-sn 3625 df-pr 3626 df-op 3628 df-uni 3837 df-br 4031 df-opab 4092 df-mpt 4093 df-id 4325 df-xp 4666 df-rel 4667 df-cnv 4668 df-co 4669 df-dm 4670 df-rn 4671 df-iota 5216 df-fun 5257 df-fn 5258 df-f 5259 df-f1 5260 df-fo 5261 df-f1o 5262 df-fv 5263 df-1st 6195 df-2nd 6196

This theorem is referenced by: ctiunct 12600

W3C validator