Theorem fidcenumlemrk 7158

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

Hypotheses

Ref	Expression
fidcenumlemr.dc	⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
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 323	. 2 ⊢ (𝜑 → (𝜑 ∧ 𝐾 ⊆ 𝑁))
4		sseq1 3249	. . . . 5 ⊢ (𝑤 = ∅ → (𝑤 ⊆ 𝑁 ↔ ∅ ⊆ 𝑁))
5	4	anbi2d 464	. . . 4 ⊢ (𝑤 = ∅ → ((𝜑 ∧ 𝑤 ⊆ 𝑁) ↔ (𝜑 ∧ ∅ ⊆ 𝑁)))
6		imaeq2 5074	. . . . . 6 ⊢ (𝑤 = ∅ → (𝐹 “ 𝑤) = (𝐹 “ ∅))
7	6	eleq2d 2300	. . . . 5 ⊢ (𝑤 = ∅ → (𝑋 ∈ (𝐹 “ 𝑤) ↔ 𝑋 ∈ (𝐹 “ ∅)))
8	7	notbid 673	. . . . 5 ⊢ (𝑤 = ∅ → (¬ 𝑋 ∈ (𝐹 “ 𝑤) ↔ ¬ 𝑋 ∈ (𝐹 “ ∅)))
9	7, 8	orbi12d 800	. . . 4 ⊢ (𝑤 = ∅ → ((𝑋 ∈ (𝐹 “ 𝑤) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑤)) ↔ (𝑋 ∈ (𝐹 “ ∅) ∨ ¬ 𝑋 ∈ (𝐹 “ ∅))))
10	5, 9	imbi12d 234	. . 3 ⊢ (𝑤 = ∅ → (((𝜑 ∧ 𝑤 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝑤) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑤))) ↔ ((𝜑 ∧ ∅ ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ ∅) ∨ ¬ 𝑋 ∈ (𝐹 “ ∅)))))
11		sseq1 3249	. . . . 5 ⊢ (𝑤 = 𝑗 → (𝑤 ⊆ 𝑁 ↔ 𝑗 ⊆ 𝑁))
12	11	anbi2d 464	. . . 4 ⊢ (𝑤 = 𝑗 → ((𝜑 ∧ 𝑤 ⊆ 𝑁) ↔ (𝜑 ∧ 𝑗 ⊆ 𝑁)))
13		imaeq2 5074	. . . . . 6 ⊢ (𝑤 = 𝑗 → (𝐹 “ 𝑤) = (𝐹 “ 𝑗))
14	13	eleq2d 2300	. . . . 5 ⊢ (𝑤 = 𝑗 → (𝑋 ∈ (𝐹 “ 𝑤) ↔ 𝑋 ∈ (𝐹 “ 𝑗)))
15	14	notbid 673	. . . . 5 ⊢ (𝑤 = 𝑗 → (¬ 𝑋 ∈ (𝐹 “ 𝑤) ↔ ¬ 𝑋 ∈ (𝐹 “ 𝑗)))
16	14, 15	orbi12d 800	. . . 4 ⊢ (𝑤 = 𝑗 → ((𝑋 ∈ (𝐹 “ 𝑤) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑤)) ↔ (𝑋 ∈ (𝐹 “ 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑗))))
17	12, 16	imbi12d 234	. . 3 ⊢ (𝑤 = 𝑗 → (((𝜑 ∧ 𝑤 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝑤) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑤))) ↔ ((𝜑 ∧ 𝑗 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑗)))))
18		sseq1 3249	. . . . 5 ⊢ (𝑤 = suc 𝑗 → (𝑤 ⊆ 𝑁 ↔ suc 𝑗 ⊆ 𝑁))
19	18	anbi2d 464	. . . 4 ⊢ (𝑤 = suc 𝑗 → ((𝜑 ∧ 𝑤 ⊆ 𝑁) ↔ (𝜑 ∧ suc 𝑗 ⊆ 𝑁)))
20		imaeq2 5074	. . . . . 6 ⊢ (𝑤 = suc 𝑗 → (𝐹 “ 𝑤) = (𝐹 “ suc 𝑗))
21	20	eleq2d 2300	. . . . 5 ⊢ (𝑤 = suc 𝑗 → (𝑋 ∈ (𝐹 “ 𝑤) ↔ 𝑋 ∈ (𝐹 “ suc 𝑗)))
22	21	notbid 673	. . . . 5 ⊢ (𝑤 = suc 𝑗 → (¬ 𝑋 ∈ (𝐹 “ 𝑤) ↔ ¬ 𝑋 ∈ (𝐹 “ suc 𝑗)))
23	21, 22	orbi12d 800	. . . 4 ⊢ (𝑤 = suc 𝑗 → ((𝑋 ∈ (𝐹 “ 𝑤) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑤)) ↔ (𝑋 ∈ (𝐹 “ suc 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ suc 𝑗))))
24	19, 23	imbi12d 234	. . 3 ⊢ (𝑤 = suc 𝑗 → (((𝜑 ∧ 𝑤 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝑤) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑤))) ↔ ((𝜑 ∧ suc 𝑗 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ suc 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ suc 𝑗)))))
25		sseq1 3249	. . . . 5 ⊢ (𝑤 = 𝐾 → (𝑤 ⊆ 𝑁 ↔ 𝐾 ⊆ 𝑁))
26	25	anbi2d 464	. . . 4 ⊢ (𝑤 = 𝐾 → ((𝜑 ∧ 𝑤 ⊆ 𝑁) ↔ (𝜑 ∧ 𝐾 ⊆ 𝑁)))
27		imaeq2 5074	. . . . . 6 ⊢ (𝑤 = 𝐾 → (𝐹 “ 𝑤) = (𝐹 “ 𝐾))
28	27	eleq2d 2300	. . . . 5 ⊢ (𝑤 = 𝐾 → (𝑋 ∈ (𝐹 “ 𝑤) ↔ 𝑋 ∈ (𝐹 “ 𝐾)))
29	28	notbid 673	. . . . 5 ⊢ (𝑤 = 𝐾 → (¬ 𝑋 ∈ (𝐹 “ 𝑤) ↔ ¬ 𝑋 ∈ (𝐹 “ 𝐾)))
30	28, 29	orbi12d 800	. . . 4 ⊢ (𝑤 = 𝐾 → ((𝑋 ∈ (𝐹 “ 𝑤) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑤)) ↔ (𝑋 ∈ (𝐹 “ 𝐾) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝐾))))
31	26, 30	imbi12d 234	. . 3 ⊢ (𝑤 = 𝐾 → (((𝜑 ∧ 𝑤 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝑤) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑤))) ↔ ((𝜑 ∧ 𝐾 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝐾) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝐾)))))
32		noel 3497	. . . . . 6 ⊢ ¬ 𝑋 ∈ ∅
33		ima0 5097	. . . . . . 7 ⊢ (𝐹 “ ∅) = ∅
34	33	eleq2i 2297	. . . . . 6 ⊢ (𝑋 ∈ (𝐹 “ ∅) ↔ 𝑋 ∈ ∅)
35	32, 34	mtbir 677	. . . . 5 ⊢ ¬ 𝑋 ∈ (𝐹 “ ∅)
36	35	a1i 9	. . . 4 ⊢ ((𝜑 ∧ ∅ ⊆ 𝑁) → ¬ 𝑋 ∈ (𝐹 “ ∅))
37	36	olcd 741	. . 3 ⊢ ((𝜑 ∧ ∅ ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ ∅) ∨ ¬ 𝑋 ∈ (𝐹 “ ∅)))
38		fidcenumlemr.dc	. . . . . 6 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
39	38	ad2antrl 490	. . . . 5 ⊢ (((𝑗 ∈ ω ∧ ((𝜑 ∧ 𝑗 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑗)))) ∧ (𝜑 ∧ suc 𝑗 ⊆ 𝑁)) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
40		fidcenumlemr.f	. . . . . 6 ⊢ (𝜑 → 𝐹:𝑁–onto→𝐴)
41	40	ad2antrl 490	. . . . 5 ⊢ (((𝑗 ∈ ω ∧ ((𝜑 ∧ 𝑗 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑗)))) ∧ (𝜑 ∧ suc 𝑗 ⊆ 𝑁)) → 𝐹:𝑁–onto→𝐴)
42		simpll 527	. . . . 5 ⊢ (((𝑗 ∈ ω ∧ ((𝜑 ∧ 𝑗 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑗)))) ∧ (𝜑 ∧ suc 𝑗 ⊆ 𝑁)) → 𝑗 ∈ ω)
43		simprr 533	. . . . 5 ⊢ (((𝑗 ∈ ω ∧ ((𝜑 ∧ 𝑗 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑗)))) ∧ (𝜑 ∧ suc 𝑗 ⊆ 𝑁)) → suc 𝑗 ⊆ 𝑁)
44		simprl 531	. . . . . 6 ⊢ (((𝑗 ∈ ω ∧ ((𝜑 ∧ 𝑗 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑗)))) ∧ (𝜑 ∧ suc 𝑗 ⊆ 𝑁)) → 𝜑)
45		sssucid 4514	. . . . . . 7 ⊢ 𝑗 ⊆ suc 𝑗
46	45, 43	sstrid 3237	. . . . . 6 ⊢ (((𝑗 ∈ ω ∧ ((𝜑 ∧ 𝑗 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑗)))) ∧ (𝜑 ∧ suc 𝑗 ⊆ 𝑁)) → 𝑗 ⊆ 𝑁)
47		simplr 529	. . . . . 6 ⊢ (((𝑗 ∈ ω ∧ ((𝜑 ∧ 𝑗 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑗)))) ∧ (𝜑 ∧ suc 𝑗 ⊆ 𝑁)) → ((𝜑 ∧ 𝑗 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑗))))
48	44, 46, 47	mp2and 433	. . . . 5 ⊢ (((𝑗 ∈ ω ∧ ((𝜑 ∧ 𝑗 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑗)))) ∧ (𝜑 ∧ suc 𝑗 ⊆ 𝑁)) → (𝑋 ∈ (𝐹 “ 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑗)))
49		fidcenumlemrk.x	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ 𝐴)
50	49	ad2antrl 490	. . . . 5 ⊢ (((𝑗 ∈ ω ∧ ((𝜑 ∧ 𝑗 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑗)))) ∧ (𝜑 ∧ suc 𝑗 ⊆ 𝑁)) → 𝑋 ∈ 𝐴)
51	39, 41, 42, 43, 48, 50	fidcenumlemrks 7157	. . . 4 ⊢ (((𝑗 ∈ ω ∧ ((𝜑 ∧ 𝑗 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑗)))) ∧ (𝜑 ∧ suc 𝑗 ⊆ 𝑁)) → (𝑋 ∈ (𝐹 “ suc 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ suc 𝑗)))
52	51	exp31 364	. . 3 ⊢ (𝑗 ∈ ω → (((𝜑 ∧ 𝑗 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝑗))) → ((𝜑 ∧ suc 𝑗 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ suc 𝑗) ∨ ¬ 𝑋 ∈ (𝐹 “ suc 𝑗)))))
53	10, 17, 24, 31, 37, 52	finds 4700	. 2 ⊢ (𝐾 ∈ ω → ((𝜑 ∧ 𝐾 ⊆ 𝑁) → (𝑋 ∈ (𝐹 “ 𝐾) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝐾))))
54	1, 3, 53	sylc 62	1 ⊢ (𝜑 → (𝑋 ∈ (𝐹 “ 𝐾) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝐾)))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ∨ wo 715  DECID wdc 841   = wceq 1397   ∈ wcel 2201  ∀wral 2509   ⊆ wss 3199  ∅c0 3493  suc csuc 4464  ωcom 4690   “ cima 4730  –onto→wfo 5326

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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2203  ax-14 2204  ax-ext 2212  ax-sep 4208  ax-nul 4216  ax-pow 4266  ax-pr 4301  ax-un 4532  ax-iinf 4688

This theorem depends on definitions:  df-bi 117  df-dc 842  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1810  df-eu 2081  df-mo 2082  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-ral 2514  df-rex 2515  df-v 2803  df-sbc 3031  df-dif 3201  df-un 3203  df-in 3205  df-ss 3212  df-nul 3494  df-pw 3655  df-sn 3676  df-pr 3677  df-op 3679  df-uni 3895  df-int 3930  df-br 4090  df-opab 4152  df-id 4392  df-suc 4470  df-iom 4691  df-xp 4733  df-rel 4734  df-cnv 4735  df-co 4736  df-dm 4737  df-rn 4738  df-res 4739  df-ima 4740  df-iota 5288  df-fun 5330  df-fn 5331  df-f 5332  df-fo 5334  df-fv 5336

This theorem is referenced by:  fidcenumlemr  7159  ennnfonelemdc  13043