ctiunctlemudc - Intuitionistic Logic Explorer

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

Theorem ctiunctlemudc 11950

Description: Lemma for ctiunct 11953. (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 2202	. . . . . . . . 9 ⊢ (𝑛 = (1^st ‘(𝐽‘𝑚)) → (𝑛 ∈ 𝑆 ↔ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆))
2	1	dcbid 823	. . . . . . . 8 ⊢ (𝑛 = (1^st ‘(𝐽‘𝑚)) → (DECID 𝑛 ∈ 𝑆 ↔ DECID (1^st ‘(𝐽‘𝑚)) ∈ 𝑆))
3		ctiunct.sdc	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑛 ∈ ω DECID 𝑛 ∈ 𝑆)
4	3	adantr 274	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑚 ∈ ω) → ∀𝑛 ∈ ω DECID 𝑛 ∈ 𝑆)
5		ctiunct.j	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐽:ω–1-1-onto→(ω × ω))
6	5	adantr 274	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑚 ∈ ω) → 𝐽:ω–1-1-onto→(ω × ω))
7		f1of 5367	. . . . . . . . . . 11 ⊢ (𝐽:ω–1-1-onto→(ω × ω) → 𝐽:ω⟶(ω × ω))
8	6, 7	syl 14	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑚 ∈ ω) → 𝐽:ω⟶(ω × ω))
9		simpr 109	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑚 ∈ ω) → 𝑚 ∈ ω)
10	8, 9	ffvelrnd 5556	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑚 ∈ ω) → (𝐽‘𝑚) ∈ (ω × ω))
11		xp1st 6063	. . . . . . . . 9 ⊢ ((𝐽‘𝑚) ∈ (ω × ω) → (1^st ‘(𝐽‘𝑚)) ∈ ω)
12	10, 11	syl 14	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑚 ∈ ω) → (1^st ‘(𝐽‘𝑚)) ∈ ω)
13	2, 4, 12	rspcdva 2794	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑚 ∈ ω) → DECID (1^st ‘(𝐽‘𝑚)) ∈ 𝑆)
14	13	adantr 274	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ ω) ∧ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆) → DECID (1^st ‘(𝐽‘𝑚)) ∈ 𝑆)
15		eleq1 2202	. . . . . . . 8 ⊢ (𝑛 = (2^nd ‘(𝐽‘𝑚)) → (𝑛 ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇 ↔ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇))
16	15	dcbid 823	. . . . . . 7 ⊢ (𝑛 = (2^nd ‘(𝐽‘𝑚)) → (DECID 𝑛 ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇 ↔ DECID (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇))
17		ctiunct.f	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐹:𝑆–onto→𝐴)
18		fof 5345	. . . . . . . . . . 11 ⊢ (𝐹:𝑆–onto→𝐴 → 𝐹:𝑆⟶𝐴)
19	17, 18	syl 14	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹:𝑆⟶𝐴)
20	19	ad2antrr 479	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑚 ∈ ω) ∧ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆) → 𝐹:𝑆⟶𝐴)
21		simpr 109	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑚 ∈ ω) ∧ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆) → (1^st ‘(𝐽‘𝑚)) ∈ 𝑆)
22	20, 21	ffvelrnd 5556	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ ω) ∧ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆) → (𝐹‘(1^st ‘(𝐽‘𝑚))) ∈ 𝐴)
23		ctiunct.tdc	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ∀𝑛 ∈ ω DECID 𝑛 ∈ 𝑇)
24	23	ralrimiva 2505	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑛 ∈ ω DECID 𝑛 ∈ 𝑇)
25	24	ad2antrr 479	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ ω) ∧ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆) → ∀𝑥 ∈ 𝐴 ∀𝑛 ∈ ω DECID 𝑛 ∈ 𝑇)
26		nfcv 2281	. . . . . . . . . 10 ⊢ Ⅎ𝑥ω
27		nfcsb1v 3035	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇
28	27	nfcri 2275	. . . . . . . . . . 11 ⊢ Ⅎ𝑥 𝑛 ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇
29	28	nfdc 1637	. . . . . . . . . 10 ⊢ Ⅎ𝑥DECID 𝑛 ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇
30	26, 29	nfralya 2473	. . . . . . . . 9 ⊢ Ⅎ𝑥∀𝑛 ∈ ω DECID 𝑛 ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇
31		csbeq1a 3012	. . . . . . . . . . . 12 ⊢ (𝑥 = (𝐹‘(1^st ‘(𝐽‘𝑚))) → 𝑇 = ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇)
32	31	eleq2d 2209	. . . . . . . . . . 11 ⊢ (𝑥 = (𝐹‘(1^st ‘(𝐽‘𝑚))) → (𝑛 ∈ 𝑇 ↔ 𝑛 ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇))
33	32	dcbid 823	. . . . . . . . . 10 ⊢ (𝑥 = (𝐹‘(1^st ‘(𝐽‘𝑚))) → (DECID 𝑛 ∈ 𝑇 ↔ DECID 𝑛 ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇))
34	33	ralbidv 2437	. . . . . . . . 9 ⊢ (𝑥 = (𝐹‘(1^st ‘(𝐽‘𝑚))) → (∀𝑛 ∈ ω DECID 𝑛 ∈ 𝑇 ↔ ∀𝑛 ∈ ω DECID 𝑛 ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇))
35	30, 34	rspc 2783	. . . . . . . 8 ⊢ ((𝐹‘(1^st ‘(𝐽‘𝑚))) ∈ 𝐴 → (∀𝑥 ∈ 𝐴 ∀𝑛 ∈ ω DECID 𝑛 ∈ 𝑇 → ∀𝑛 ∈ ω DECID 𝑛 ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇))
36	22, 25, 35	sylc 62	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ω) ∧ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆) → ∀𝑛 ∈ ω DECID 𝑛 ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇)
37	10	adantr 274	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ ω) ∧ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆) → (𝐽‘𝑚) ∈ (ω × ω))
38		xp2nd 6064	. . . . . . . 8 ⊢ ((𝐽‘𝑚) ∈ (ω × ω) → (2^nd ‘(𝐽‘𝑚)) ∈ ω)
39	37, 38	syl 14	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ω) ∧ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆) → (2^nd ‘(𝐽‘𝑚)) ∈ ω)
40	16, 36, 39	rspcdva 2794	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ ω) ∧ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆) → DECID (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇)
41		dcan 918	. . . . . 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 109	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑚 ∈ ω) ∧ ¬ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆) → ¬ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆)
44	43	intnanrd 917	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑚 ∈ ω) ∧ ¬ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆) → ¬ ((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇))
45	44	olcd 723	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ ω) ∧ ¬ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆) → (((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇) ∨ ¬ ((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇)))
46		df-dc 820	. . . . . 6 ⊢ (DECID ((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇) ↔ (((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇) ∨ ¬ ((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇)))
47	45, 46	sylibr 133	. . . . 5 ⊢ (((𝜑 ∧ 𝑚 ∈ ω) ∧ ¬ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆) → DECID ((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇))
48		exmiddc 821	. . . . . 6 ⊢ (DECID (1^st ‘(𝐽‘𝑚)) ∈ 𝑆 → ((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∨ ¬ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆))
49	13, 48	syl 14	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ ω) → ((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∨ ¬ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆))
50	42, 47, 49	mpjaodan 787	. . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ ω) → DECID ((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇))
51		ibar 299	. . . . . . 7 ⊢ (𝑚 ∈ ω → (((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇) ↔ (𝑚 ∈ ω ∧ ((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇))))
52	51	adantl 275	. . . . . 6 ⊢ ((𝜑 ∧ 𝑚 ∈ ω) → (((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇) ↔ (𝑚 ∈ ω ∧ ((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇))))
53		2fveq3 5426	. . . . . . . . 9 ⊢ (𝑧 = 𝑚 → (1^st ‘(𝐽‘𝑧)) = (1^st ‘(𝐽‘𝑚)))
54	53	eleq1d 2208	. . . . . . . 8 ⊢ (𝑧 = 𝑚 → ((1^st ‘(𝐽‘𝑧)) ∈ 𝑆 ↔ (1^st ‘(𝐽‘𝑚)) ∈ 𝑆))
55		2fveq3 5426	. . . . . . . . 9 ⊢ (𝑧 = 𝑚 → (2^nd ‘(𝐽‘𝑧)) = (2^nd ‘(𝐽‘𝑚)))
56	53	fveq2d 5425	. . . . . . . . . 10 ⊢ (𝑧 = 𝑚 → (𝐹‘(1^st ‘(𝐽‘𝑧))) = (𝐹‘(1^st ‘(𝐽‘𝑚))))
57	56	csbeq1d 3010	. . . . . . . . 9 ⊢ (𝑧 = 𝑚 → ⦋(𝐹‘(1^st ‘(𝐽‘𝑧))) / 𝑥⦌𝑇 = ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇)
58	55, 57	eleq12d 2210	. . . . . . . 8 ⊢ (𝑧 = 𝑚 → ((2^nd ‘(𝐽‘𝑧)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑧))) / 𝑥⦌𝑇 ↔ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇))
59	54, 58	anbi12d 464	. . . . . . 7 ⊢ (𝑧 = 𝑚 → (((1^st ‘(𝐽‘𝑧)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑧)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑧))) / 𝑥⦌𝑇) ↔ ((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇)))
60		ctiunct.u	. . . . . . 7 ⊢ 𝑈 = {𝑧 ∈ ω ∣ ((1^st ‘(𝐽‘𝑧)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑧)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑧))) / 𝑥⦌𝑇)}
61	59, 60	elrab2 2843	. . . . . 6 ⊢ (𝑚 ∈ 𝑈 ↔ (𝑚 ∈ ω ∧ ((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇)))
62	52, 61	syl6rbbr 198	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ ω) → (𝑚 ∈ 𝑈 ↔ ((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇)))
63	62	dcbid 823	. . . 4 ⊢ ((𝜑 ∧ 𝑚 ∈ ω) → (DECID 𝑚 ∈ 𝑈 ↔ DECID ((1^st ‘(𝐽‘𝑚)) ∈ 𝑆 ∧ (2^nd ‘(𝐽‘𝑚)) ∈ ⦋(𝐹‘(1^st ‘(𝐽‘𝑚))) / 𝑥⦌𝑇)))
64	50, 63	mpbird 166	. . 3 ⊢ ((𝜑 ∧ 𝑚 ∈ ω) → DECID 𝑚 ∈ 𝑈)
65	64	ralrimiva 2505	. 2 ⊢ (𝜑 → ∀𝑚 ∈ ω DECID 𝑚 ∈ 𝑈)
66		eleq1 2202	. . . 4 ⊢ (𝑚 = 𝑛 → (𝑚 ∈ 𝑈 ↔ 𝑛 ∈ 𝑈))
67	66	dcbid 823	. . 3 ⊢ (𝑚 = 𝑛 → (DECID 𝑚 ∈ 𝑈 ↔ DECID 𝑛 ∈ 𝑈))
68	67	cbvralv 2654	. 2 ⊢ (∀𝑚 ∈ ω DECID 𝑚 ∈ 𝑈 ↔ ∀𝑛 ∈ ω DECID 𝑛 ∈ 𝑈)
69	65, 68	sylib 121	1 ⊢ (𝜑 → ∀𝑛 ∈ ω DECID 𝑛 ∈ 𝑈)

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 103 ↔ wb 104 ∨ wo 697 DECID wdc 819 = wceq 1331 ∈ wcel 1480 ∀wral 2416 {crab 2420 ⦋csb 3003 ⊆ wss 3071 ωcom 4504 × cxp 4537 ⟶wf 5119 –onto→wfo 5121 –1-1-onto→wf1o 5122 ‘cfv 5123 1^st c1st 6036 2^nd c2nd 6037

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-sep 4046 ax-pow 4098 ax-pr 4131 ax-un 4355

This theorem depends on definitions: df-bi 116 df-dc 820 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ral 2421 df-rex 2422 df-rab 2425 df-v 2688 df-sbc 2910 df-csb 3004 df-un 3075 df-in 3077 df-ss 3084 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-br 3930 df-opab 3990 df-mpt 3991 df-id 4215 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-rn 4550 df-iota 5088 df-fun 5125 df-fn 5126 df-f 5127 df-f1 5128 df-fo 5129 df-f1o 5130 df-fv 5131 df-1st 6038 df-2nd 6039

This theorem is referenced by: ctiunct 11953

W3C validator