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

Theorem ennnfonelemg 11916
Description: Lemma for ennnfone 11938. 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 𝐽 = (𝑥 ∈ ℕ0 ↦ if(𝑥 = 0, ∅, (𝑁‘(𝑥 − 1))))
ennnfonelemh.h 𝐻 = seq0(𝐺, 𝐽)
Assertion
Ref Expression
ennnfonelemg ((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) → (𝑓𝐺𝑗) ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω})
Distinct variable groups:   𝐴,𝑔,𝑥,𝑦   𝑔,𝐹,𝑥,𝑦   𝑥,𝑁   𝑓,𝑔,𝑥,𝑦   𝑔,𝑗,𝑥,𝑦   𝜑,𝑥,𝑦
Allowed substitution hints:   𝜑(𝑓,𝑔,𝑗,𝑘,𝑛)   𝐴(𝑓,𝑗,𝑘,𝑛)   𝐹(𝑓,𝑗,𝑘,𝑛)   𝐺(𝑥,𝑦,𝑓,𝑔,𝑗,𝑘,𝑛)   𝐻(𝑥,𝑦,𝑓,𝑔,𝑗,𝑘,𝑛)   𝐽(𝑥,𝑦,𝑓,𝑔,𝑗,𝑘,𝑛)   𝑁(𝑦,𝑓,𝑔,𝑗,𝑘,𝑛)

Proof of Theorem ennnfonelemg
StepHypRef Expression
1 ennnfonelemh.g . . . 4 𝐺 = (𝑥 ∈ (𝐴pm ω), 𝑦 ∈ ω ↦ if((𝐹𝑦) ∈ (𝐹𝑦), 𝑥, (𝑥 ∪ {⟨dom 𝑥, (𝐹𝑦)⟩})))
21a1i 9 . . 3 ((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) → 𝐺 = (𝑥 ∈ (𝐴pm ω), 𝑦 ∈ ω ↦ if((𝐹𝑦) ∈ (𝐹𝑦), 𝑥, (𝑥 ∪ {⟨dom 𝑥, (𝐹𝑦)⟩}))))
3 simpr 109 . . . . . . 7 ((𝑥 = 𝑓𝑦 = 𝑗) → 𝑦 = 𝑗)
43fveq2d 5425 . . . . . 6 ((𝑥 = 𝑓𝑦 = 𝑗) → (𝐹𝑦) = (𝐹𝑗))
53imaeq2d 4881 . . . . . 6 ((𝑥 = 𝑓𝑦 = 𝑗) → (𝐹𝑦) = (𝐹𝑗))
64, 5eleq12d 2210 . . . . 5 ((𝑥 = 𝑓𝑦 = 𝑗) → ((𝐹𝑦) ∈ (𝐹𝑦) ↔ (𝐹𝑗) ∈ (𝐹𝑗)))
7 simpl 108 . . . . 5 ((𝑥 = 𝑓𝑦 = 𝑗) → 𝑥 = 𝑓)
87dmeqd 4741 . . . . . . . 8 ((𝑥 = 𝑓𝑦 = 𝑗) → dom 𝑥 = dom 𝑓)
98, 4opeq12d 3713 . . . . . . 7 ((𝑥 = 𝑓𝑦 = 𝑗) → ⟨dom 𝑥, (𝐹𝑦)⟩ = ⟨dom 𝑓, (𝐹𝑗)⟩)
109sneqd 3540 . . . . . 6 ((𝑥 = 𝑓𝑦 = 𝑗) → {⟨dom 𝑥, (𝐹𝑦)⟩} = {⟨dom 𝑓, (𝐹𝑗)⟩})
117, 10uneq12d 3231 . . . . 5 ((𝑥 = 𝑓𝑦 = 𝑗) → (𝑥 ∪ {⟨dom 𝑥, (𝐹𝑦)⟩}) = (𝑓 ∪ {⟨dom 𝑓, (𝐹𝑗)⟩}))
126, 7, 11ifbieq12d 3498 . . . 4 ((𝑥 = 𝑓𝑦 = 𝑗) → if((𝐹𝑦) ∈ (𝐹𝑦), 𝑥, (𝑥 ∪ {⟨dom 𝑥, (𝐹𝑦)⟩})) = if((𝐹𝑗) ∈ (𝐹𝑗), 𝑓, (𝑓 ∪ {⟨dom 𝑓, (𝐹𝑗)⟩})))
1312adantl 275 . . 3 (((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) ∧ (𝑥 = 𝑓𝑦 = 𝑗)) → if((𝐹𝑦) ∈ (𝐹𝑦), 𝑥, (𝑥 ∪ {⟨dom 𝑥, (𝐹𝑦)⟩})) = if((𝐹𝑗) ∈ (𝐹𝑗), 𝑓, (𝑓 ∪ {⟨dom 𝑓, (𝐹𝑗)⟩})))
14 ssrab2 3182 . . . 4 {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} ⊆ (𝐴pm ω)
15 simprl 520 . . . 4 ((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) → 𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω})
1614, 15sseldi 3095 . . 3 ((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) → 𝑓 ∈ (𝐴pm ω))
17 simprr 521 . . 3 ((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) → 𝑗 ∈ ω)
18 simplrl 524 . . . 4 (((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) ∧ (𝐹𝑗) ∈ (𝐹𝑗)) → 𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω})
19 dmeq 4739 . . . . . 6 (𝑔 = (𝑓 ∪ {⟨dom 𝑓, (𝐹𝑗)⟩}) → dom 𝑔 = dom (𝑓 ∪ {⟨dom 𝑓, (𝐹𝑗)⟩}))
2019eleq1d 2208 . . . . 5 (𝑔 = (𝑓 ∪ {⟨dom 𝑓, (𝐹𝑗)⟩}) → (dom 𝑔 ∈ ω ↔ dom (𝑓 ∪ {⟨dom 𝑓, (𝐹𝑗)⟩}) ∈ ω))
21 omex 4507 . . . . . . . 8 ω ∈ V
22 ennnfonelemh.f . . . . . . . 8 (𝜑𝐹:ω–onto𝐴)
23 focdmex 10533 . . . . . . . 8 ((ω ∈ V ∧ 𝐹:ω–onto𝐴) → 𝐴 ∈ V)
2421, 22, 23sylancr 410 . . . . . . 7 (𝜑𝐴 ∈ V)
2524ad2antrr 479 . . . . . 6 (((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) ∧ ¬ (𝐹𝑗) ∈ (𝐹𝑗)) → 𝐴 ∈ V)
2621a1i 9 . . . . . 6 (((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) ∧ ¬ (𝐹𝑗) ∈ (𝐹𝑗)) → ω ∈ V)
27 simplrl 524 . . . . . . . 8 (((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) ∧ ¬ (𝐹𝑗) ∈ (𝐹𝑗)) → 𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω})
28 elrabi 2837 . . . . . . . . . 10 (𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} → 𝑓 ∈ (𝐴pm ω))
29 elpmi 6561 . . . . . . . . . 10 (𝑓 ∈ (𝐴pm ω) → (𝑓:dom 𝑓𝐴 ∧ dom 𝑓 ⊆ ω))
3028, 29syl 14 . . . . . . . . 9 (𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} → (𝑓:dom 𝑓𝐴 ∧ dom 𝑓 ⊆ ω))
3130simpld 111 . . . . . . . 8 (𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} → 𝑓:dom 𝑓𝐴)
3227, 31syl 14 . . . . . . 7 (((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) ∧ ¬ (𝐹𝑗) ∈ (𝐹𝑗)) → 𝑓:dom 𝑓𝐴)
33 dmeq 4739 . . . . . . . . . . 11 (𝑔 = 𝑓 → dom 𝑔 = dom 𝑓)
3433eleq1d 2208 . . . . . . . . . 10 (𝑔 = 𝑓 → (dom 𝑔 ∈ ω ↔ dom 𝑓 ∈ ω))
3534elrab 2840 . . . . . . . . 9 (𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} ↔ (𝑓 ∈ (𝐴pm ω) ∧ dom 𝑓 ∈ ω))
3635simprbi 273 . . . . . . . 8 (𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} → dom 𝑓 ∈ ω)
3727, 36syl 14 . . . . . . 7 (((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) ∧ ¬ (𝐹𝑗) ∈ (𝐹𝑗)) → dom 𝑓 ∈ ω)
38 nnord 4525 . . . . . . . . 9 (dom 𝑓 ∈ ω → Ord dom 𝑓)
3937, 38syl 14 . . . . . . . 8 (((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) ∧ ¬ (𝐹𝑗) ∈ (𝐹𝑗)) → Ord dom 𝑓)
40 ordirr 4457 . . . . . . . 8 (Ord dom 𝑓 → ¬ dom 𝑓 ∈ dom 𝑓)
4139, 40syl 14 . . . . . . 7 (((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) ∧ ¬ (𝐹𝑗) ∈ (𝐹𝑗)) → ¬ dom 𝑓 ∈ dom 𝑓)
4222adantr 274 . . . . . . . . . 10 ((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) → 𝐹:ω–onto𝐴)
43 fof 5345 . . . . . . . . . 10 (𝐹:ω–onto𝐴𝐹:ω⟶𝐴)
4442, 43syl 14 . . . . . . . . 9 ((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) → 𝐹:ω⟶𝐴)
4544, 17ffvelrnd 5556 . . . . . . . 8 ((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) → (𝐹𝑗) ∈ 𝐴)
4645adantr 274 . . . . . . 7 (((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) ∧ ¬ (𝐹𝑗) ∈ (𝐹𝑗)) → (𝐹𝑗) ∈ 𝐴)
47 fsnunf 5620 . . . . . . 7 ((𝑓:dom 𝑓𝐴 ∧ (dom 𝑓 ∈ ω ∧ ¬ dom 𝑓 ∈ dom 𝑓) ∧ (𝐹𝑗) ∈ 𝐴) → (𝑓 ∪ {⟨dom 𝑓, (𝐹𝑗)⟩}):(dom 𝑓 ∪ {dom 𝑓})⟶𝐴)
4832, 37, 41, 46, 47syl121anc 1221 . . . . . 6 (((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) ∧ ¬ (𝐹𝑗) ∈ (𝐹𝑗)) → (𝑓 ∪ {⟨dom 𝑓, (𝐹𝑗)⟩}):(dom 𝑓 ∪ {dom 𝑓})⟶𝐴)
49 df-suc 4293 . . . . . . . . 9 suc dom 𝑓 = (dom 𝑓 ∪ {dom 𝑓})
50 peano2 4509 . . . . . . . . 9 (dom 𝑓 ∈ ω → suc dom 𝑓 ∈ ω)
5149, 50eqeltrrid 2227 . . . . . . . 8 (dom 𝑓 ∈ ω → (dom 𝑓 ∪ {dom 𝑓}) ∈ ω)
5237, 51syl 14 . . . . . . 7 (((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) ∧ ¬ (𝐹𝑗) ∈ (𝐹𝑗)) → (dom 𝑓 ∪ {dom 𝑓}) ∈ ω)
53 omelon 4522 . . . . . . . 8 ω ∈ On
5453onelssi 4351 . . . . . . 7 ((dom 𝑓 ∪ {dom 𝑓}) ∈ ω → (dom 𝑓 ∪ {dom 𝑓}) ⊆ ω)
5552, 54syl 14 . . . . . 6 (((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) ∧ ¬ (𝐹𝑗) ∈ (𝐹𝑗)) → (dom 𝑓 ∪ {dom 𝑓}) ⊆ ω)
56 elpm2r 6560 . . . . . 6 (((𝐴 ∈ V ∧ ω ∈ V) ∧ ((𝑓 ∪ {⟨dom 𝑓, (𝐹𝑗)⟩}):(dom 𝑓 ∪ {dom 𝑓})⟶𝐴 ∧ (dom 𝑓 ∪ {dom 𝑓}) ⊆ ω)) → (𝑓 ∪ {⟨dom 𝑓, (𝐹𝑗)⟩}) ∈ (𝐴pm ω))
5725, 26, 48, 55, 56syl22anc 1217 . . . . 5 (((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) ∧ ¬ (𝐹𝑗) ∈ (𝐹𝑗)) → (𝑓 ∪ {⟨dom 𝑓, (𝐹𝑗)⟩}) ∈ (𝐴pm ω))
5848fdmd 5279 . . . . . 6 (((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) ∧ ¬ (𝐹𝑗) ∈ (𝐹𝑗)) → dom (𝑓 ∪ {⟨dom 𝑓, (𝐹𝑗)⟩}) = (dom 𝑓 ∪ {dom 𝑓}))
5958, 52eqeltrd 2216 . . . . 5 (((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) ∧ ¬ (𝐹𝑗) ∈ (𝐹𝑗)) → dom (𝑓 ∪ {⟨dom 𝑓, (𝐹𝑗)⟩}) ∈ ω)
6020, 57, 59elrabd 2842 . . . 4 (((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) ∧ ¬ (𝐹𝑗) ∈ (𝐹𝑗)) → (𝑓 ∪ {⟨dom 𝑓, (𝐹𝑗)⟩}) ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω})
61 ennnfonelemh.dceq . . . . . 6 (𝜑 → ∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦)
6261adantr 274 . . . . 5 ((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) → ∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦)
6362, 42, 17ennnfonelemdc 11912 . . . 4 ((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) → DECID (𝐹𝑗) ∈ (𝐹𝑗))
6418, 60, 63ifcldadc 3501 . . 3 ((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) → if((𝐹𝑗) ∈ (𝐹𝑗), 𝑓, (𝑓 ∪ {⟨dom 𝑓, (𝐹𝑗)⟩})) ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω})
652, 13, 16, 17, 64ovmpod 5898 . 2 ((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) → (𝑓𝐺𝑗) = if((𝐹𝑗) ∈ (𝐹𝑗), 𝑓, (𝑓 ∪ {⟨dom 𝑓, (𝐹𝑗)⟩})))
6665, 64eqeltrd 2216 1 ((𝜑 ∧ (𝑓 ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω} ∧ 𝑗 ∈ ω)) → (𝑓𝐺𝑗) ∈ {𝑔 ∈ (𝐴pm ω) ∣ dom 𝑔 ∈ ω})
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 103  DECID wdc 819   = wceq 1331  wcel 1480  wne 2308  wral 2416  wrex 2417  {crab 2420  Vcvv 2686  cun 3069  wss 3071  c0 3363  ifcif 3474  {csn 3527  cop 3530  cmpt 3989  Ord word 4284  suc csuc 4287  ωcom 4504  ccnv 4538  dom cdm 4539  cima 4542  wf 5119  ontowfo 5121  cfv 5123  (class class class)co 5774  cmpo 5776  freccfrec 6287  pm cpm 6543  0cc0 7620  1c1 7621   + caddc 7623  cmin 7933  0cn0 8977  cz 9054  seqcseq 10218
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-coll 4043  ax-sep 4046  ax-nul 4054  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-setind 4452  ax-iinf 4502
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-ne 2309  df-ral 2421  df-rex 2422  df-reu 2423  df-rab 2425  df-v 2688  df-sbc 2910  df-csb 3004  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-nul 3364  df-if 3475  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-int 3772  df-iun 3815  df-br 3930  df-opab 3990  df-mpt 3991  df-tr 4027  df-id 4215  df-iord 4288  df-on 4290  df-suc 4293  df-iom 4505  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  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-ov 5777  df-oprab 5778  df-mpo 5779  df-pm 6545
This theorem is referenced by:  ennnfonelemh  11917  ennnfonelem0  11918  ennnfonelemp1  11919  ennnfonelemom  11921
  Copyright terms: Public domain W3C validator