Theorem fidcenumlemrk 6661

Description: Lemma for fidcenum 6663. (Contributed by Jim Kingdon, 20-Oct-2022.)

Hypotheses

Ref	Expression
fidcenumlemr.dc	⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
fidcenumlemr.n	⊢ (𝜑 → 𝑁 ∈ ω)
fidcenumlemr.f	⊢ (𝜑 → 𝐹:𝑁–onto→𝐴)
fidcenumlemrk.k	⊢ (𝜑 → 𝐾 ∈ ω)
fidcenumlemrk.kn	⊢ (𝜑 → 𝐾 ⊆ 𝑁)
fidcenumlemrk.x	⊢ (𝜑 → 𝑋 ∈ 𝐴)

Assertion

Ref	Expression
fidcenumlemrk	⊢ (𝜑 → (𝑋 ∈ (𝐹 “ 𝐾) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝐾)))

Distinct variable groups:   𝑥,𝐹,𝑦   𝑥,𝑋,𝑦   𝑥,𝐴,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦)   𝐾(𝑥,𝑦)   𝑁(𝑥,𝑦)

Proof of Theorem fidcenumlemrk

Dummy variables 𝑗 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fidcenumlemrk.k	. 2 ⊢ (𝜑 → 𝐾 ∈ ω)
2		fidcenumlemrk.kn	. . 3 ⊢ (𝜑 → 𝐾 ⊆ 𝑁)
3	2	ancli 316	. 2 ⊢ (𝜑 → (𝜑 ∧ 𝐾 ⊆ 𝑁))
4		sseq1 3047	. . . . 5 ⊢ (𝑤 = ∅ → (𝑤 ⊆ 𝑁 ↔ ∅ ⊆ 𝑁))
5	4	anbi2d 452	. . . 4 ⊢ (𝑤 = ∅ → ((𝜑 ∧ 𝑤 ⊆ 𝑁) ↔ (𝜑 ∧ ∅ ⊆ 𝑁)))
6		imaeq2 4770	. . . . . 6 ⊢ (𝑤 = ∅ → (𝐹 “ 𝑤) = (𝐹 “ ∅))
7	6	eleq2d 2157	. . . . 5 ⊢ (𝑤 = ∅ → (𝑋 ∈ (𝐹 “ 𝑤) ↔ 𝑋 ∈ (𝐹 “ ∅)))
8	7	notbid 627	. . . . 5 ⊢ (𝑤 = ∅ → (¬ 𝑋 ∈ (𝐹 “ 𝑤) ↔ ¬ 𝑋 ∈ (𝐹 “ ∅)))
9	7, 8	orbi12d 742	. . . 4 ⊢ (𝑤 = ∅ → ((𝑋 ∈ (𝐹 “ 𝑤) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑤)) ↔ (𝑋 ∈ (𝐹 “ ∅) ∨ ¬ 𝑋 ∈ (𝐹 “ ∅))))
10	5, 9	imbi12d 232	. . 3 ⊢ (𝑤 = ∅ → (((𝜑 ∧ 𝑤 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝑤) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑤))) ↔ ((𝜑 ∧ ∅ ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ ∅) ∨ ¬ 𝑋 ∈ (𝐹 “ ∅)))))
11		sseq1 3047	. . . . 5 ⊢ (𝑤 = 𝑗 → (𝑤 ⊆ 𝑁 ↔ 𝑗 ⊆ 𝑁))
12	11	anbi2d 452	. . . 4 ⊢ (𝑤 = 𝑗 → ((𝜑 ∧ 𝑤 ⊆ 𝑁) ↔ (𝜑 ∧ 𝑗 ⊆ 𝑁)))
13		imaeq2 4770	. . . . . 6 ⊢ (𝑤 = 𝑗 → (𝐹 “ 𝑤) = (𝐹 “ 𝑗))
14	13	eleq2d 2157	. . . . 5 ⊢ (𝑤 = 𝑗 → (𝑋 ∈ (𝐹 “ 𝑤) ↔ 𝑋 ∈ (𝐹 “ 𝑗)))
15	14	notbid 627	. . . . 5 ⊢ (𝑤 = 𝑗 → (¬ 𝑋 ∈ (𝐹 “ 𝑤) ↔ ¬ 𝑋 ∈ (𝐹 “ 𝑗)))
16	14, 15	orbi12d 742	. . . 4 ⊢ (𝑤 = 𝑗 → ((𝑋 ∈ (𝐹 “ 𝑤) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑤)) ↔ (𝑋 ∈ (𝐹 “ 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑗))))
17	12, 16	imbi12d 232	. . 3 ⊢ (𝑤 = 𝑗 → (((𝜑 ∧ 𝑤 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝑤) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑤))) ↔ ((𝜑 ∧ 𝑗 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑗)))))
18		sseq1 3047	. . . . 5 ⊢ (𝑤 = suc 𝑗 → (𝑤 ⊆ 𝑁 ↔ suc 𝑗 ⊆ 𝑁))
19	18	anbi2d 452	. . . 4 ⊢ (𝑤 = suc 𝑗 → ((𝜑 ∧ 𝑤 ⊆ 𝑁) ↔ (𝜑 ∧ suc 𝑗 ⊆ 𝑁)))
20		imaeq2 4770	. . . . . 6 ⊢ (𝑤 = suc 𝑗 → (𝐹 “ 𝑤) = (𝐹 “ suc 𝑗))
21	20	eleq2d 2157	. . . . 5 ⊢ (𝑤 = suc 𝑗 → (𝑋 ∈ (𝐹 “ 𝑤) ↔ 𝑋 ∈ (𝐹 “ suc 𝑗)))
22	21	notbid 627	. . . . 5 ⊢ (𝑤 = suc 𝑗 → (¬ 𝑋 ∈ (𝐹 “ 𝑤) ↔ ¬ 𝑋 ∈ (𝐹 “ suc 𝑗)))
23	21, 22	orbi12d 742	. . . 4 ⊢ (𝑤 = suc 𝑗 → ((𝑋 ∈ (𝐹 “ 𝑤) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑤)) ↔ (𝑋 ∈ (𝐹 “ suc 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ suc 𝑗))))
24	19, 23	imbi12d 232	. . 3 ⊢ (𝑤 = suc 𝑗 → (((𝜑 ∧ 𝑤 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝑤) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑤))) ↔ ((𝜑 ∧ suc 𝑗 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ suc 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ suc 𝑗)))))
25		sseq1 3047	. . . . 5 ⊢ (𝑤 = 𝐾 → (𝑤 ⊆ 𝑁 ↔ 𝐾 ⊆ 𝑁))
26	25	anbi2d 452	. . . 4 ⊢ (𝑤 = 𝐾 → ((𝜑 ∧ 𝑤 ⊆ 𝑁) ↔ (𝜑 ∧ 𝐾 ⊆ 𝑁)))
27		imaeq2 4770	. . . . . 6 ⊢ (𝑤 = 𝐾 → (𝐹 “ 𝑤) = (𝐹 “ 𝐾))
28	27	eleq2d 2157	. . . . 5 ⊢ (𝑤 = 𝐾 → (𝑋 ∈ (𝐹 “ 𝑤) ↔ 𝑋 ∈ (𝐹 “ 𝐾)))
29	28	notbid 627	. . . . 5 ⊢ (𝑤 = 𝐾 → (¬ 𝑋 ∈ (𝐹 “ 𝑤) ↔ ¬ 𝑋 ∈ (𝐹 “ 𝐾)))
30	28, 29	orbi12d 742	. . . 4 ⊢ (𝑤 = 𝐾 → ((𝑋 ∈ (𝐹 “ 𝑤) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑤)) ↔ (𝑋 ∈ (𝐹 “ 𝐾) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝐾))))
31	26, 30	imbi12d 232	. . 3 ⊢ (𝑤 = 𝐾 → (((𝜑 ∧ 𝑤 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝑤) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑤))) ↔ ((𝜑 ∧ 𝐾 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝐾) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝐾)))))
32		noel 3290	. . . . . 6 ⊢ ¬ 𝑋 ∈ ∅
33		ima0 4791	. . . . . . 7 ⊢ (𝐹 “ ∅) = ∅
34	33	eleq2i 2154	. . . . . 6 ⊢ (𝑋 ∈ (𝐹 “ ∅) ↔ 𝑋 ∈ ∅)
35	32, 34	mtbir 631	. . . . 5 ⊢ ¬ 𝑋 ∈ (𝐹 “ ∅)
36	35	a1i 9	. . . 4 ⊢ ((𝜑 ∧ ∅ ⊆ 𝑁) → ¬ 𝑋 ∈ (𝐹 “ ∅))
37	36	olcd 688	. . 3 ⊢ ((𝜑 ∧ ∅ ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ ∅) ∨ ¬ 𝑋 ∈ (𝐹 “ ∅)))
38		fidcenumlemr.dc	. . . . . 6 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
39	38	ad2antrl 474	. . . . 5 ⊢ (((𝑗 ∈ ω ∧ ((𝜑 ∧ 𝑗 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑗)))) ∧ (𝜑 ∧ suc 𝑗 ⊆ 𝑁)) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
40		fidcenumlemr.n	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ω)
41	40	ad2antrl 474	. . . . 5 ⊢ (((𝑗 ∈ ω ∧ ((𝜑 ∧ 𝑗 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑗)))) ∧ (𝜑 ∧ suc 𝑗 ⊆ 𝑁)) → 𝑁 ∈ ω)
42		fidcenumlemr.f	. . . . . 6 ⊢ (𝜑 → 𝐹:𝑁–onto→𝐴)
43	42	ad2antrl 474	. . . . 5 ⊢ (((𝑗 ∈ ω ∧ ((𝜑 ∧ 𝑗 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑗)))) ∧ (𝜑 ∧ suc 𝑗 ⊆ 𝑁)) → 𝐹:𝑁–onto→𝐴)
44		simpll 496	. . . . 5 ⊢ (((𝑗 ∈ ω ∧ ((𝜑 ∧ 𝑗 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑗)))) ∧ (𝜑 ∧ suc 𝑗 ⊆ 𝑁)) → 𝑗 ∈ ω)
45		simprr 499	. . . . 5 ⊢ (((𝑗 ∈ ω ∧ ((𝜑 ∧ 𝑗 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑗)))) ∧ (𝜑 ∧ suc 𝑗 ⊆ 𝑁)) → suc 𝑗 ⊆ 𝑁)
46		simprl 498	. . . . . 6 ⊢ (((𝑗 ∈ ω ∧ ((𝜑 ∧ 𝑗 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑗)))) ∧ (𝜑 ∧ suc 𝑗 ⊆ 𝑁)) → 𝜑)
47		sssucid 4242	. . . . . . 7 ⊢ 𝑗 ⊆ suc 𝑗
48	47, 45	syl5ss 3036	. . . . . 6 ⊢ (((𝑗 ∈ ω ∧ ((𝜑 ∧ 𝑗 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑗)))) ∧ (𝜑 ∧ suc 𝑗 ⊆ 𝑁)) → 𝑗 ⊆ 𝑁)
49		simplr 497	. . . . . 6 ⊢ (((𝑗 ∈ ω ∧ ((𝜑 ∧ 𝑗 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑗)))) ∧ (𝜑 ∧ suc 𝑗 ⊆ 𝑁)) → ((𝜑 ∧ 𝑗 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑗))))
50	46, 48, 49	mp2and 424	. . . . 5 ⊢ (((𝑗 ∈ ω ∧ ((𝜑 ∧ 𝑗 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑗)))) ∧ (𝜑 ∧ suc 𝑗 ⊆ 𝑁)) → (𝑋 ∈ (𝐹 “ 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑗)))
51		fidcenumlemrk.x	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ 𝐴)
52	51	ad2antrl 474	. . . . 5 ⊢ (((𝑗 ∈ ω ∧ ((𝜑 ∧ 𝑗 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑗)))) ∧ (𝜑 ∧ suc 𝑗 ⊆ 𝑁)) → 𝑋 ∈ 𝐴)
53	39, 41, 43, 44, 45, 50, 52	fidcenumlemrks 6660	. . . 4 ⊢ (((𝑗 ∈ ω ∧ ((𝜑 ∧ 𝑗 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑗)))) ∧ (𝜑 ∧ suc 𝑗 ⊆ 𝑁)) → (𝑋 ∈ (𝐹 “ suc 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ suc 𝑗)))
54	53	exp31 356	. . 3 ⊢ (𝑗 ∈ ω → (((𝜑 ∧ 𝑗 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑗))) → ((𝜑 ∧ suc 𝑗 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ suc 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ suc 𝑗)))))
55	10, 17, 24, 31, 37, 54	finds 4415	. 2 ⊢ (𝐾 ∈ ω → ((𝜑 ∧ 𝐾 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝐾) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝐾))))
56	1, 3, 55	sylc 61	1 ⊢ (𝜑 → (𝑋 ∈ (𝐹 “ 𝐾) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝐾)))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 102   ∨ wo 664  DECID wdc 780   = wceq 1289   ∈ wcel 1438  ∀wral 2359   ⊆ wss 2999  ∅c0 3286  suc csuc 4192  ωcom 4405   “ cima 4441  –onto→wfo 5013

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 579  ax-in2 580  ax-io 665  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-8 1440  ax-10 1441  ax-11 1442  ax-i12 1443  ax-bndl 1444  ax-4 1445  ax-13 1449  ax-14 1450  ax-17 1464  ax-i9 1468  ax-ial 1472  ax-i5r 1473  ax-ext 2070  ax-sep 3957  ax-nul 3965  ax-pow 4009  ax-pr 4036  ax-un 4260  ax-iinf 4403

This theorem depends on definitions:  df-bi 115  df-dc 781  df-3an 926  df-tru 1292  df-fal 1295  df-nf 1395  df-sb 1693  df-eu 1951  df-mo 1952  df-clab 2075  df-cleq 2081  df-clel 2084  df-nfc 2217  df-ral 2364  df-rex 2365  df-v 2621  df-sbc 2841  df-dif 3001  df-un 3003  df-in 3005  df-ss 3012  df-nul 3287  df-pw 3431  df-sn 3452  df-pr 3453  df-op 3455  df-uni 3654  df-int 3689  df-br 3846  df-opab 3900  df-id 4120  df-suc 4198  df-iom 4406  df-xp 4444  df-rel 4445  df-cnv 4446  df-co 4447  df-dm 4448  df-rn 4449  df-res 4450  df-ima 4451  df-iota 4980  df-fun 5017  df-fn 5018  df-f 5019  df-fo 5021  df-fv 5023

This theorem is referenced by:  fidcenumlemr  6662