Theorem fidcenumlemrks 6849

Description: Lemma for fidcenum 6852. Induction step for fidcenumlemrk 6850. (Contributed by Jim Kingdon, 20-Oct-2022.)

Hypotheses

Ref	Expression
fidcenumlemr.dc	⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
fidcenumlemr.f	⊢ (𝜑 → 𝐹:𝑁–onto→𝐴)
fidcenumlemrks.j	⊢ (𝜑 → 𝐽 ∈ ω)
fidcenumlemrks.jn	⊢ (𝜑 → suc 𝐽 ⊆ 𝑁)
fidcenumlemrks.h	⊢ (𝜑 → (𝑋 ∈ (𝐹 “ 𝐽) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝐽)))
fidcenumlemrks.x	⊢ (𝜑 → 𝑋 ∈ 𝐴)

Assertion

Ref	Expression
fidcenumlemrks	⊢ (𝜑 → (𝑋 ∈ (𝐹 “ suc 𝐽) ∨ ¬ 𝑋 ∈ (𝐹 “ suc 𝐽)))

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

Allowed substitution hints:   𝜑(𝑥,𝑦)   𝐹(𝑥)   𝐽(𝑥)   𝑁(𝑥,𝑦)

Proof of Theorem fidcenumlemrks

Step	Hyp	Ref	Expression
1		simpr 109	. . . . 5 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝐹 “ 𝐽)) → 𝑋 ∈ (𝐹 “ 𝐽))
2		elun1 3248	. . . . 5 ⊢ (𝑋 ∈ (𝐹 “ 𝐽) → 𝑋 ∈ ((𝐹 “ 𝐽) ∪ (𝐹 “ {𝐽})))
3	1, 2	syl 14	. . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝐹 “ 𝐽)) → 𝑋 ∈ ((𝐹 “ 𝐽) ∪ (𝐹 “ {𝐽})))
4		df-suc 4301	. . . . . . 7 ⊢ suc 𝐽 = (𝐽 ∪ {𝐽})
5	4	imaeq2i 4887	. . . . . 6 ⊢ (𝐹 “ suc 𝐽) = (𝐹 “ (𝐽 ∪ {𝐽}))
6		imaundi 4959	. . . . . 6 ⊢ (𝐹 “ (𝐽 ∪ {𝐽})) = ((𝐹 “ 𝐽) ∪ (𝐹 “ {𝐽}))
7	5, 6	eqtri 2161	. . . . 5 ⊢ (𝐹 “ suc 𝐽) = ((𝐹 “ 𝐽) ∪ (𝐹 “ {𝐽}))
8	7	eleq2i 2207	. . . 4 ⊢ (𝑋 ∈ (𝐹 “ suc 𝐽) ↔ 𝑋 ∈ ((𝐹 “ 𝐽) ∪ (𝐹 “ {𝐽})))
9	3, 8	sylibr 133	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝐹 “ 𝐽)) → 𝑋 ∈ (𝐹 “ suc 𝐽))
10	9	orcd 723	. 2 ⊢ ((𝜑 ∧ 𝑋 ∈ (𝐹 “ 𝐽)) → (𝑋 ∈ (𝐹 “ suc 𝐽) ∨ ¬ 𝑋 ∈ (𝐹 “ suc 𝐽)))
11		simpr 109	. . . . . . 7 ⊢ (((𝜑 ∧ ¬ 𝑋 ∈ (𝐹 “ 𝐽)) ∧ 𝑋 = (𝐹‘𝐽)) → 𝑋 = (𝐹‘𝐽))
12		fidcenumlemrks.x	. . . . . . . . . 10 ⊢ (𝜑 → 𝑋 ∈ 𝐴)
13		elsng 3547	. . . . . . . . . 10 ⊢ (𝑋 ∈ 𝐴 → (𝑋 ∈ {(𝐹‘𝐽)} ↔ 𝑋 = (𝐹‘𝐽)))
14	12, 13	syl 14	. . . . . . . . 9 ⊢ (𝜑 → (𝑋 ∈ {(𝐹‘𝐽)} ↔ 𝑋 = (𝐹‘𝐽)))
15		fidcenumlemr.f	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐹:𝑁–onto→𝐴)
16		fofn 5355	. . . . . . . . . . . 12 ⊢ (𝐹:𝑁–onto→𝐴 → 𝐹 Fn 𝑁)
17	15, 16	syl 14	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐹 Fn 𝑁)
18		fidcenumlemrks.jn	. . . . . . . . . . . 12 ⊢ (𝜑 → suc 𝐽 ⊆ 𝑁)
19		fidcenumlemrks.j	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐽 ∈ ω)
20		sucidg 4346	. . . . . . . . . . . . 13 ⊢ (𝐽 ∈ ω → 𝐽 ∈ suc 𝐽)
21	19, 20	syl 14	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐽 ∈ suc 𝐽)
22	18, 21	sseldd 3103	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐽 ∈ 𝑁)
23		fnsnfv 5488	. . . . . . . . . . 11 ⊢ ((𝐹 Fn 𝑁 ∧ 𝐽 ∈ 𝑁) → {(𝐹‘𝐽)} = (𝐹 “ {𝐽}))
24	17, 22, 23	syl2anc 409	. . . . . . . . . 10 ⊢ (𝜑 → {(𝐹‘𝐽)} = (𝐹 “ {𝐽}))
25	24	eleq2d 2210	. . . . . . . . 9 ⊢ (𝜑 → (𝑋 ∈ {(𝐹‘𝐽)} ↔ 𝑋 ∈ (𝐹 “ {𝐽})))
26	14, 25	bitr3d 189	. . . . . . . 8 ⊢ (𝜑 → (𝑋 = (𝐹‘𝐽) ↔ 𝑋 ∈ (𝐹 “ {𝐽})))
27	26	ad2antrr 480	. . . . . . 7 ⊢ (((𝜑 ∧ ¬ 𝑋 ∈ (𝐹 “ 𝐽)) ∧ 𝑋 = (𝐹‘𝐽)) → (𝑋 = (𝐹‘𝐽) ↔ 𝑋 ∈ (𝐹 “ {𝐽})))
28	11, 27	mpbid 146	. . . . . 6 ⊢ (((𝜑 ∧ ¬ 𝑋 ∈ (𝐹 “ 𝐽)) ∧ 𝑋 = (𝐹‘𝐽)) → 𝑋 ∈ (𝐹 “ {𝐽}))
29		elun2 3249	. . . . . 6 ⊢ (𝑋 ∈ (𝐹 “ {𝐽}) → 𝑋 ∈ ((𝐹 “ 𝐽) ∪ (𝐹 “ {𝐽})))
30	28, 29	syl 14	. . . . 5 ⊢ (((𝜑 ∧ ¬ 𝑋 ∈ (𝐹 “ 𝐽)) ∧ 𝑋 = (𝐹‘𝐽)) → 𝑋 ∈ ((𝐹 “ 𝐽) ∪ (𝐹 “ {𝐽})))
31	30, 8	sylibr 133	. . . 4 ⊢ (((𝜑 ∧ ¬ 𝑋 ∈ (𝐹 “ 𝐽)) ∧ 𝑋 = (𝐹‘𝐽)) → 𝑋 ∈ (𝐹 “ suc 𝐽))
32	31	orcd 723	. . 3 ⊢ (((𝜑 ∧ ¬ 𝑋 ∈ (𝐹 “ 𝐽)) ∧ 𝑋 = (𝐹‘𝐽)) → (𝑋 ∈ (𝐹 “ suc 𝐽) ∨ ¬ 𝑋 ∈ (𝐹 “ suc 𝐽)))
33		simplr 520	. . . . . . 7 ⊢ (((𝜑 ∧ ¬ 𝑋 ∈ (𝐹 “ 𝐽)) ∧ ¬ 𝑋 = (𝐹‘𝐽)) → ¬ 𝑋 ∈ (𝐹 “ 𝐽))
34		simpr 109	. . . . . . . 8 ⊢ (((𝜑 ∧ ¬ 𝑋 ∈ (𝐹 “ 𝐽)) ∧ ¬ 𝑋 = (𝐹‘𝐽)) → ¬ 𝑋 = (𝐹‘𝐽))
35	26	ad2antrr 480	. . . . . . . 8 ⊢ (((𝜑 ∧ ¬ 𝑋 ∈ (𝐹 “ 𝐽)) ∧ ¬ 𝑋 = (𝐹‘𝐽)) → (𝑋 = (𝐹‘𝐽) ↔ 𝑋 ∈ (𝐹 “ {𝐽})))
36	34, 35	mtbid 662	. . . . . . 7 ⊢ (((𝜑 ∧ ¬ 𝑋 ∈ (𝐹 “ 𝐽)) ∧ ¬ 𝑋 = (𝐹‘𝐽)) → ¬ 𝑋 ∈ (𝐹 “ {𝐽}))
37		ioran 742	. . . . . . 7 ⊢ (¬ (𝑋 ∈ (𝐹 “ 𝐽) ∨ 𝑋 ∈ (𝐹 “ {𝐽})) ↔ (¬ 𝑋 ∈ (𝐹 “ 𝐽) ∧ ¬ 𝑋 ∈ (𝐹 “ {𝐽})))
38	33, 36, 37	sylanbrc 414	. . . . . 6 ⊢ (((𝜑 ∧ ¬ 𝑋 ∈ (𝐹 “ 𝐽)) ∧ ¬ 𝑋 = (𝐹‘𝐽)) → ¬ (𝑋 ∈ (𝐹 “ 𝐽) ∨ 𝑋 ∈ (𝐹 “ {𝐽})))
39		elun 3222	. . . . . 6 ⊢ (𝑋 ∈ ((𝐹 “ 𝐽) ∪ (𝐹 “ {𝐽})) ↔ (𝑋 ∈ (𝐹 “ 𝐽) ∨ 𝑋 ∈ (𝐹 “ {𝐽})))
40	38, 39	sylnibr 667	. . . . 5 ⊢ (((𝜑 ∧ ¬ 𝑋 ∈ (𝐹 “ 𝐽)) ∧ ¬ 𝑋 = (𝐹‘𝐽)) → ¬ 𝑋 ∈ ((𝐹 “ 𝐽) ∪ (𝐹 “ {𝐽})))
41	40, 8	sylnibr 667	. . . 4 ⊢ (((𝜑 ∧ ¬ 𝑋 ∈ (𝐹 “ 𝐽)) ∧ ¬ 𝑋 = (𝐹‘𝐽)) → ¬ 𝑋 ∈ (𝐹 “ suc 𝐽))
42	41	olcd 724	. . 3 ⊢ (((𝜑 ∧ ¬ 𝑋 ∈ (𝐹 “ 𝐽)) ∧ ¬ 𝑋 = (𝐹‘𝐽)) → (𝑋 ∈ (𝐹 “ suc 𝐽) ∨ ¬ 𝑋 ∈ (𝐹 “ suc 𝐽)))
43		fof 5353	. . . . . . . 8 ⊢ (𝐹:𝑁–onto→𝐴 → 𝐹:𝑁⟶𝐴)
44	15, 43	syl 14	. . . . . . 7 ⊢ (𝜑 → 𝐹:𝑁⟶𝐴)
45	44, 22	ffvelrnd 5564	. . . . . 6 ⊢ (𝜑 → (𝐹‘𝐽) ∈ 𝐴)
46		fidcenumlemr.dc	. . . . . 6 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦)
47		eqeq1 2147	. . . . . . . 8 ⊢ (𝑥 = 𝑋 → (𝑥 = 𝑦 ↔ 𝑋 = 𝑦))
48	47	dcbid 824	. . . . . . 7 ⊢ (𝑥 = 𝑋 → (DECID 𝑥 = 𝑦 ↔ DECID 𝑋 = 𝑦))
49		eqeq2 2150	. . . . . . . 8 ⊢ (𝑦 = (𝐹‘𝐽) → (𝑋 = 𝑦 ↔ 𝑋 = (𝐹‘𝐽)))
50	49	dcbid 824	. . . . . . 7 ⊢ (𝑦 = (𝐹‘𝐽) → (DECID 𝑋 = 𝑦 ↔ DECID 𝑋 = (𝐹‘𝐽)))
51	48, 50	rspc2va 2807	. . . . . 6 ⊢ (((𝑋 ∈ 𝐴 ∧ (𝐹‘𝐽) ∈ 𝐴) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 DECID 𝑥 = 𝑦) → DECID 𝑋 = (𝐹‘𝐽))
52	12, 45, 46, 51	syl21anc 1216	. . . . 5 ⊢ (𝜑 → DECID 𝑋 = (𝐹‘𝐽))
53		exmiddc 822	. . . . 5 ⊢ (DECID 𝑋 = (𝐹‘𝐽) → (𝑋 = (𝐹‘𝐽) ∨ ¬ 𝑋 = (𝐹‘𝐽)))
54	52, 53	syl 14	. . . 4 ⊢ (𝜑 → (𝑋 = (𝐹‘𝐽) ∨ ¬ 𝑋 = (𝐹‘𝐽)))
55	54	adantr 274	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ (𝐹 “ 𝐽)) → (𝑋 = (𝐹‘𝐽) ∨ ¬ 𝑋 = (𝐹‘𝐽)))
56	32, 42, 55	mpjaodan 788	. 2 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ (𝐹 “ 𝐽)) → (𝑋 ∈ (𝐹 “ suc 𝐽) ∨ ¬ 𝑋 ∈ (𝐹 “ suc 𝐽)))
57		fidcenumlemrks.h	. 2 ⊢ (𝜑 → (𝑋 ∈ (𝐹 “ 𝐽) ∨ ¬ 𝑋 ∈ (𝐹 “ 𝐽)))
58	10, 56, 57	mpjaodan 788	1 ⊢ (𝜑 → (𝑋 ∈ (𝐹 “ suc 𝐽) ∨ ¬ 𝑋 ∈ (𝐹 “ suc 𝐽)))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 103   ↔ wb 104   ∨ wo 698  DECID wdc 820   = wceq 1332   ∈ wcel 1481  ∀wral 2417   ∪ cun 3074   ⊆ wss 3076  {csn 3532  suc csuc 4295  ωcom 4512   “ cima 4550   Fn wfn 5126  ⟶wf 5127  –onto→wfo 5129  ‘cfv 5131

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 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4054  ax-pow 4106  ax-pr 4139

This theorem depends on definitions:  df-bi 116  df-dc 821  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-v 2691  df-sbc 2914  df-un 3080  df-in 3082  df-ss 3089  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-br 3938  df-opab 3998  df-id 4223  df-suc 4301  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-dm 4557  df-rn 4558  df-res 4559  df-ima 4560  df-iota 5096  df-fun 5133  df-fn 5134  df-f 5135  df-fo 5137  df-fv 5139

This theorem is referenced by:  fidcenumlemrk  6850