ennnfonelemg - Intuitionistic Logic Explorer

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

Theorem ennnfonelemg 13294

Description: Lemma for ennnfone 13316. Closure for 𝐺. (Contributed by Jim Kingdon, 20-Jul-2023.)

**Hypotheses**
Ref	Expression
ennnfonelemh.dceq	⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
ennnfonelemh.f	⊢ (𝜑 → 𝐹:ω–onto→𝐴)
ennnfonelemh.ne	⊢ (𝜑 → ∀𝑛 ∈ ω ∃𝑘 ∈ ω ∀𝑗 ∈ suc 𝑛(𝐹‘𝑘) ≠ (𝐹‘𝑗))
ennnfonelemh.g	⊢ 𝐺 = (𝑥 ∈ (𝐴 ↑_pm ω), 𝑦 ∈ ω ↦ if((𝐹‘𝑦) ∈ (𝐹 “ 𝑦), 𝑥, (𝑥 ∪ {⟨dom 𝑥, (𝐹‘𝑦)⟩})))
ennnfonelemh.n	⊢ 𝑁 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)
ennnfonelemh.j	⊢ 𝐽 = (𝑥 ∈ ℕ₀ ↦ if(𝑥 = 0, ∅, (^◡𝑁‘(𝑥 − 1))))
ennnfonelemh.h	⊢ 𝐻 = seq0(𝐺, 𝐽)

**Assertion**
Ref	Expression
ennnfonelemg	⊢ ((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) → (𝑓𝐺𝑗) ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω})

Distinct variable groups: 𝐴,𝑔,𝑥,𝑦 𝑔,𝐹,𝑥,𝑦 𝑥,𝑁 𝑓,𝑔,𝑥,𝑦 𝑔,𝑗,𝑥,𝑦 𝜑,𝑥,𝑦 Allowed substitution hints: 𝜑(𝑓, 𝑔, 𝑗, 𝑘, 𝑛) 𝐴(𝑓, 𝑗, 𝑘, 𝑛) 𝐹(𝑓, 𝑗, 𝑘, 𝑛) 𝐺(𝑥, 𝑦, 𝑓, 𝑔, 𝑗, 𝑘, 𝑛) 𝐻(𝑥, 𝑦, 𝑓, 𝑔, 𝑗, 𝑘, 𝑛) 𝐽(𝑥, 𝑦, 𝑓, 𝑔, 𝑗, 𝑘, 𝑛) 𝑁(𝑦, 𝑓, 𝑔, 𝑗, 𝑘, 𝑛)

**Proof of Theorem ennnfonelemg**
Step	Hyp	Ref	Expression
1		ennnfonelemh.g	. . . 4 ⊢ 𝐺 = (𝑥 ∈ (𝐴 ↑_pm ω), 𝑦 ∈ ω ↦ if((𝐹‘𝑦) ∈ (𝐹 “ 𝑦), 𝑥, (𝑥 ∪ {⟨dom 𝑥, (𝐹‘𝑦)⟩})))
2	1	a1i 9	. . 3 ⊢ ((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) → 𝐺 = (𝑥 ∈ (𝐴 ↑_pm ω), 𝑦 ∈ ω ↦ if((𝐹‘𝑦) ∈ (𝐹 “ 𝑦), 𝑥, (𝑥 ∪ {⟨dom 𝑥, (𝐹‘𝑦)⟩}))))
3		simpr 110	. . . . . . 7 ⊢ ((𝑥 = 𝑓 ∧ 𝑦 = 𝑗) → 𝑦 = 𝑗)
4	3	fveq2d 5699	. . . . . 6 ⊢ ((𝑥 = 𝑓 ∧ 𝑦 = 𝑗) → (𝐹‘𝑦) = (𝐹‘𝑗))
5	3	imaeq2d 5126	. . . . . 6 ⊢ ((𝑥 = 𝑓 ∧ 𝑦 = 𝑗) → (𝐹 “ 𝑦) = (𝐹 “ 𝑗))
6	4, 5	eleq12d 2309	. . . . 5 ⊢ ((𝑥 = 𝑓 ∧ 𝑦 = 𝑗) → ((𝐹‘𝑦) ∈ (𝐹 “ 𝑦) ↔ (𝐹‘𝑗) ∈ (𝐹 “ 𝑗)))
7		simpl 109	. . . . 5 ⊢ ((𝑥 = 𝑓 ∧ 𝑦 = 𝑗) → 𝑥 = 𝑓)
8	7	dmeqd 4983	. . . . . . . 8 ⊢ ((𝑥 = 𝑓 ∧ 𝑦 = 𝑗) → dom 𝑥 = dom 𝑓)
9	8, 4	opeq12d 3912	. . . . . . 7 ⊢ ((𝑥 = 𝑓 ∧ 𝑦 = 𝑗) → ⟨dom 𝑥, (𝐹‘𝑦)⟩ = ⟨dom 𝑓, (𝐹‘𝑗)⟩)
10	9	sneqd 3722	. . . . . 6 ⊢ ((𝑥 = 𝑓 ∧ 𝑦 = 𝑗) → {⟨dom 𝑥, (𝐹‘𝑦)⟩} = {⟨dom 𝑓, (𝐹‘𝑗)⟩})
11	7, 10	uneq12d 3384	. . . . 5 ⊢ ((𝑥 = 𝑓 ∧ 𝑦 = 𝑗) → (𝑥 ∪ {⟨dom 𝑥, (𝐹‘𝑦)⟩}) = (𝑓 ∪ {⟨dom 𝑓, (𝐹‘𝑗)⟩}))
12	6, 7, 11	ifbieq12d 3667	. . . 4 ⊢ ((𝑥 = 𝑓 ∧ 𝑦 = 𝑗) → if((𝐹‘𝑦) ∈ (𝐹 “ 𝑦), 𝑥, (𝑥 ∪ {⟨dom 𝑥, (𝐹‘𝑦)⟩})) = if((𝐹‘𝑗) ∈ (𝐹 “ 𝑗), 𝑓, (𝑓 ∪ {⟨dom 𝑓, (𝐹‘𝑗)⟩})))
13	12	adantl 277	. . 3 ⊢ (((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) ∧ (𝑥 = 𝑓 ∧ 𝑦 = 𝑗)) → if((𝐹‘𝑦) ∈ (𝐹 “ 𝑦), 𝑥, (𝑥 ∪ {⟨dom 𝑥, (𝐹‘𝑦)⟩})) = if((𝐹‘𝑗) ∈ (𝐹 “ 𝑗), 𝑓, (𝑓 ∪ {⟨dom 𝑓, (𝐹‘𝑗)⟩})))
14		ssrab2 3333	. . . 4 ⊢ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ⊆ (𝐴 ↑_pm ω)
15		simprl 535	. . . 4 ⊢ ((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) → 𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω})
16	14, 15	sselid 3246	. . 3 ⊢ ((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) → 𝑓 ∈ (𝐴 ↑_pm ω))
17		simprr 537	. . 3 ⊢ ((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) → 𝑗 ∈ ω)
18		simplrl 541	. . . 4 ⊢ (((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) ∧ (𝐹‘𝑗) ∈ (𝐹 “ 𝑗)) → 𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω})
19		dmeq 4981	. . . . . 6 ⊢ (𝑔 = (𝑓 ∪ {⟨dom 𝑓, (𝐹‘𝑗)⟩}) → dom 𝑔 = dom (𝑓 ∪ {⟨dom 𝑓, (𝐹‘𝑗)⟩}))
20	19	eleq1d 2307	. . . . 5 ⊢ (𝑔 = (𝑓 ∪ {⟨dom 𝑓, (𝐹‘𝑗)⟩}) → (dom 𝑔 ∈ ω ↔ dom (𝑓 ∪ {⟨dom 𝑓, (𝐹‘𝑗)⟩}) ∈ ω))
21		omex 4740	. . . . . . . 8 ⊢ ω ∈ V
22		ennnfonelemh.f	. . . . . . . 8 ⊢ (𝜑 → 𝐹:ω–onto→𝐴)
23		focdmex 6344	. . . . . . . 8 ⊢ (ω ∈ V → (𝐹:ω–onto→𝐴 → 𝐴 ∈ V))
24	21, 22, 23	mpsyl 65	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ V)
25	24	ad2antrr 492	. . . . . 6 ⊢ (((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) ∧ ¬ (𝐹‘𝑗) ∈ (𝐹 “ 𝑗)) → 𝐴 ∈ V)
26	21	a1i 9	. . . . . 6 ⊢ (((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) ∧ ¬ (𝐹‘𝑗) ∈ (𝐹 “ 𝑗)) → ω ∈ V)
27		simplrl 541	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) ∧ ¬ (𝐹‘𝑗) ∈ (𝐹 “ 𝑗)) → 𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω})
28		elrabi 2979	. . . . . . . . . 10 ⊢ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} → 𝑓 ∈ (𝐴 ↑_pm ω))
29		elpmi 6941	. . . . . . . . . 10 ⊢ (𝑓 ∈ (𝐴 ↑_pm ω) → (𝑓:dom 𝑓⟶𝐴 ∧ dom 𝑓 ⊆ ω))
30	28, 29	syl 14	. . . . . . . . 9 ⊢ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} → (𝑓:dom 𝑓⟶𝐴 ∧ dom 𝑓 ⊆ ω))
31	30	simpld 112	. . . . . . . 8 ⊢ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} → 𝑓:dom 𝑓⟶𝐴)
32	27, 31	syl 14	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) ∧ ¬ (𝐹‘𝑗) ∈ (𝐹 “ 𝑗)) → 𝑓:dom 𝑓⟶𝐴)
33		dmeq 4981	. . . . . . . . . . 11 ⊢ (𝑔 = 𝑓 → dom 𝑔 = dom 𝑓)
34	33	eleq1d 2307	. . . . . . . . . 10 ⊢ (𝑔 = 𝑓 → (dom 𝑔 ∈ ω ↔ dom 𝑓 ∈ ω))
35	34	elrab 2982	. . . . . . . . 9 ⊢ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ↔ (𝑓 ∈ (𝐴 ↑_pm ω) ∧ dom 𝑓 ∈ ω))
36	35	simprbi 275	. . . . . . . 8 ⊢ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} → dom 𝑓 ∈ ω)
37	27, 36	syl 14	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) ∧ ¬ (𝐹‘𝑗) ∈ (𝐹 “ 𝑗)) → dom 𝑓 ∈ ω)
38		nnord 4759	. . . . . . . . 9 ⊢ (dom 𝑓 ∈ ω → Ord dom 𝑓)
39	37, 38	syl 14	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) ∧ ¬ (𝐹‘𝑗) ∈ (𝐹 “ 𝑗)) → Ord dom 𝑓)
40		ordirr 4689	. . . . . . . 8 ⊢ (Ord dom 𝑓 → ¬ dom 𝑓 ∈ dom 𝑓)
41	39, 40	syl 14	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) ∧ ¬ (𝐹‘𝑗) ∈ (𝐹 “ 𝑗)) → ¬ dom 𝑓 ∈ dom 𝑓)
42	22	adantr 276	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) → 𝐹:ω–onto→𝐴)
43		fof 5615	. . . . . . . . . 10 ⊢ (𝐹:ω–onto→𝐴 → 𝐹:ω⟶𝐴)
44	42, 43	syl 14	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) → 𝐹:ω⟶𝐴)
45	44, 17	ffvelcdmd 5844	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) → (𝐹‘𝑗) ∈ 𝐴)
46	45	adantr 276	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) ∧ ¬ (𝐹‘𝑗) ∈ (𝐹 “ 𝑗)) → (𝐹‘𝑗) ∈ 𝐴)
47		fsnunf 5915	. . . . . . 7 ⊢ ((𝑓:dom 𝑓⟶𝐴 ∧ (dom 𝑓 ∈ ω ∧ ¬ dom 𝑓 ∈ dom 𝑓) ∧ (𝐹‘𝑗) ∈ 𝐴) → (𝑓 ∪ {⟨dom 𝑓, (𝐹‘𝑗)⟩}):(dom 𝑓 ∪ {dom 𝑓})⟶𝐴)
48	32, 37, 41, 46, 47	syl121anc 1283	. . . . . 6 ⊢ (((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) ∧ ¬ (𝐹‘𝑗) ∈ (𝐹 “ 𝑗)) → (𝑓 ∪ {⟨dom 𝑓, (𝐹‘𝑗)⟩}):(dom 𝑓 ∪ {dom 𝑓})⟶𝐴)
49		df-suc 4516	. . . . . . . . 9 ⊢ suc dom 𝑓 = (dom 𝑓 ∪ {dom 𝑓})
50		peano2 4742	. . . . . . . . 9 ⊢ (dom 𝑓 ∈ ω → suc dom 𝑓 ∈ ω)
51	49, 50	eqeltrrid 2326	. . . . . . . 8 ⊢ (dom 𝑓 ∈ ω → (dom 𝑓 ∪ {dom 𝑓}) ∈ ω)
52	37, 51	syl 14	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) ∧ ¬ (𝐹‘𝑗) ∈ (𝐹 “ 𝑗)) → (dom 𝑓 ∪ {dom 𝑓}) ∈ ω)
53		elomssom 4752	. . . . . . 7 ⊢ ((dom 𝑓 ∪ {dom 𝑓}) ∈ ω → (dom 𝑓 ∪ {dom 𝑓}) ⊆ ω)
54	52, 53	syl 14	. . . . . 6 ⊢ (((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) ∧ ¬ (𝐹‘𝑗) ∈ (𝐹 “ 𝑗)) → (dom 𝑓 ∪ {dom 𝑓}) ⊆ ω)
55		elpm2r 6940	. . . . . 6 ⊢ (((𝐴 ∈ V ∧ ω ∈ V) ∧ ((𝑓 ∪ {⟨dom 𝑓, (𝐹‘𝑗)⟩}):(dom 𝑓 ∪ {dom 𝑓})⟶𝐴 ∧ (dom 𝑓 ∪ {dom 𝑓}) ⊆ ω)) → (𝑓 ∪ {⟨dom 𝑓, (𝐹‘𝑗)⟩}) ∈ (𝐴 ↑_pm ω))
56	25, 26, 48, 54, 55	syl22anc 1279	. . . . 5 ⊢ (((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) ∧ ¬ (𝐹‘𝑗) ∈ (𝐹 “ 𝑗)) → (𝑓 ∪ {⟨dom 𝑓, (𝐹‘𝑗)⟩}) ∈ (𝐴 ↑_pm ω))
57	48	fdmd 5540	. . . . . 6 ⊢ (((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) ∧ ¬ (𝐹‘𝑗) ∈ (𝐹 “ 𝑗)) → dom (𝑓 ∪ {⟨dom 𝑓, (𝐹‘𝑗)⟩}) = (dom 𝑓 ∪ {dom 𝑓}))
58	57, 52	eqeltrd 2315	. . . . 5 ⊢ (((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) ∧ ¬ (𝐹‘𝑗) ∈ (𝐹 “ 𝑗)) → dom (𝑓 ∪ {⟨dom 𝑓, (𝐹‘𝑗)⟩}) ∈ ω)
59	20, 56, 58	elrabd 2984	. . . 4 ⊢ (((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) ∧ ¬ (𝐹‘𝑗) ∈ (𝐹 “ 𝑗)) → (𝑓 ∪ {⟨dom 𝑓, (𝐹‘𝑗)⟩}) ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω})
60		ennnfonelemh.dceq	. . . . . 6 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
61	60	adantr 276	. . . . 5 ⊢ ((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
62	61, 42, 17	ennnfonelemdc 13290	. . . 4 ⊢ ((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) → DECID (𝐹‘𝑗) ∈ (𝐹 “ 𝑗))
63	18, 59, 62	ifcldadc 3670	. . 3 ⊢ ((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) → if((𝐹‘𝑗) ∈ (𝐹 “ 𝑗), 𝑓, (𝑓 ∪ {⟨dom 𝑓, (𝐹‘𝑗)⟩})) ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω})
64	2, 13, 16, 17, 63	ovmpod 6216	. 2 ⊢ ((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) → (𝑓𝐺𝑗) = if((𝐹‘𝑗) ∈ (𝐹 “ 𝑗), 𝑓, (𝑓 ∪ {⟨dom 𝑓, (𝐹‘𝑗)⟩})))
65	64, 63	eqeltrd 2315	1 ⊢ ((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) → (𝑓𝐺𝑗) ∈ {𝑔 ∈ (𝐴 ↑_pm ω) ∣ dom 𝑔 ∈ ω})

Colors of variables: wff set class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 104 DECID wdc 846 = wceq 1402 ∈ wcel 2209 ≠ wne 2420 ∀wral 2528 ∃wrex 2529 {crab 2532 Vcvv 2821 ∪ cun 3218 ⊆ wss 3220 ∅c0 3520 ifcif 3638 {csn 3709 ⟨cop 3712 ↦ cmpt 4192 Ord word 4507 suc csuc 4510 ωcom 4737 ^◡ccnv 4773 dom cdm 4774 “ cima 4777 ⟶wf 5373 –onto→wfo 5375 ‘cfv 5377 (class class class)co 6085 ∈ cmpo 6087 freccfrec 6661 ↑_pm cpm 6923 0cc0 8179 1c1 8180 + caddc 8182 − cmin 8497 ℕ₀cn0 9563 ℤcz 9644 seqcseq 10884

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4246 ax-sep 4249 ax-nul 4259 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-iinf 4735

This proof depends on definitions: df-bi 117 df-dc 847 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-tr 4230 df-id 4438 df-iord 4511 df-on 4513 df-suc 4516 df-iom 4738 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-ov 6088 df-oprab 6089 df-mpo 6090 df-pm 6925

This theorem is used by: ennnfonelemh 13295 ennnfonelem0 13296 ennnfonelemp1 13297 ennnfonelemom 13299

W3C validator