ramub1lem1 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > ramub1lem1		Structured version Visualization version GIF version

Theorem ramub1lem1 17086

Description: Lemma for ramub1 17088. (Contributed by Mario Carneiro, 23-Apr-2015.)

**Hypotheses**
Ref	Expression
ramub1.m	⊢ (𝜑 → 𝑀 ∈ ℕ)
ramub1.r	⊢ (𝜑 → 𝑅 ∈ Fin)
ramub1.f	⊢ (𝜑 → 𝐹:𝑅⟶ℕ)
ramub1.g	⊢ 𝐺 = (𝑥 ∈ 𝑅 ↦ (𝑀 Ramsey (𝑦 ∈ 𝑅 ↦ if(𝑦 = 𝑥, ((𝐹‘𝑥) − 1), (𝐹‘𝑦)))))
ramub1.1	⊢ (𝜑 → 𝐺:𝑅⟶ℕ₀)
ramub1.2	⊢ (𝜑 → ((𝑀 − 1) Ramsey 𝐺) ∈ ℕ₀)
ramub1.3	⊢ 𝐶 = (𝑎 ∈ V, 𝑖 ∈ ℕ₀ ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})
ramub1.4	⊢ (𝜑 → 𝑆 ∈ Fin)
ramub1.5	⊢ (𝜑 → (♯‘𝑆) = (((𝑀 − 1) Ramsey 𝐺) + 1))
ramub1.6	⊢ (𝜑 → 𝐾:(𝑆𝐶𝑀)⟶𝑅)
ramub1.x	⊢ (𝜑 → 𝑋 ∈ 𝑆)
ramub1.h	⊢ 𝐻 = (𝑢 ∈ ((𝑆 ∖ {𝑋})𝐶(𝑀 − 1)) ↦ (𝐾‘(𝑢 ∪ {𝑋})))
ramub1.d	⊢ (𝜑 → 𝐷 ∈ 𝑅)
ramub1.w	⊢ (𝜑 → 𝑊 ⊆ (𝑆 ∖ {𝑋}))
ramub1.7	⊢ (𝜑 → (𝐺‘𝐷) ≤ (♯‘𝑊))
ramub1.8	⊢ (𝜑 → (𝑊𝐶(𝑀 − 1)) ⊆ (^◡𝐻 “ {𝐷}))
ramub1.e	⊢ (𝜑 → 𝐸 ∈ 𝑅)
ramub1.v	⊢ (𝜑 → 𝑉 ⊆ 𝑊)
ramub1.9	⊢ (𝜑 → if(𝐸 = 𝐷, ((𝐹‘𝐷) − 1), (𝐹‘𝐸)) ≤ (♯‘𝑉))
ramub1.s	⊢ (𝜑 → (𝑉𝐶𝑀) ⊆ (^◡𝐾 “ {𝐸}))

**Assertion**
Ref	Expression
ramub1lem1	⊢ (𝜑 → ∃𝑧 ∈ 𝒫 𝑆((𝐹‘𝐸) ≤ (♯‘𝑧) ∧ (𝑧𝐶𝑀) ⊆ (^◡𝐾 “ {𝐸})))

Distinct variable groups: 𝑥,𝑢,𝐷 𝑦,𝑢,𝑧,𝐹,𝑥 𝑎,𝑏,𝑖,𝑢,𝑥,𝑦,𝑧,𝑀 𝐺,𝑎,𝑖,𝑢,𝑥,𝑦,𝑧 𝑢,𝑅,𝑥,𝑦,𝑧 𝑊,𝑎,𝑖,𝑢 𝜑,𝑢,𝑥,𝑦,𝑧 𝑆,𝑎,𝑖,𝑢,𝑥,𝑦,𝑧 𝑉,𝑎,𝑖,𝑥,𝑧 𝑢,𝐶,𝑥,𝑦,𝑧 𝑢,𝐻,𝑥,𝑦,𝑧 𝑢,𝐾,𝑥,𝑦,𝑧 𝑥,𝐸,𝑧 𝑋,𝑎,𝑖,𝑢,𝑥,𝑦,𝑧 Allowed substitution hints: 𝜑(𝑖,𝑎,𝑏) 𝐶(𝑖,𝑎,𝑏) 𝐷(𝑦,𝑧,𝑖,𝑎,𝑏) 𝑅(𝑖,𝑎,𝑏) 𝑆(𝑏) 𝐸(𝑦,𝑢,𝑖,𝑎,𝑏) 𝐹(𝑖,𝑎,𝑏) 𝐺(𝑏) 𝐻(𝑖,𝑎,𝑏) 𝐾(𝑖,𝑎,𝑏) 𝑉(𝑦,𝑢,𝑏) 𝑊(𝑥,𝑦,𝑧,𝑏) 𝑋(𝑏)

**Proof of Theorem ramub1lem1**
Step	Hyp	Ref	Expression
1		ramub1.4	. . . . 5 ⊢ (𝜑 → 𝑆 ∈ Fin)
2		ramub1.v	. . . . . . . 8 ⊢ (𝜑 → 𝑉 ⊆ 𝑊)
3		ramub1.w	. . . . . . . 8 ⊢ (𝜑 → 𝑊 ⊆ (𝑆 ∖ {𝑋}))
4	2, 3	sstrd 3955	. . . . . . 7 ⊢ (𝜑 → 𝑉 ⊆ (𝑆 ∖ {𝑋}))
5	4	difss2d 4101	. . . . . 6 ⊢ (𝜑 → 𝑉 ⊆ 𝑆)
6		ramub1.x	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ 𝑆)
7	6	snssd 4757	. . . . . 6 ⊢ (𝜑 → {𝑋} ⊆ 𝑆)
8	5, 7	unssd 4153	. . . . 5 ⊢ (𝜑 → (𝑉 ∪ {𝑋}) ⊆ 𝑆)
9	1, 8	sselpwd 5299	. . . 4 ⊢ (𝜑 → (𝑉 ∪ {𝑋}) ∈ 𝒫 𝑆)
10	9	adantr 485	. . 3 ⊢ ((𝜑 ∧ 𝐸 = 𝐷) → (𝑉 ∪ {𝑋}) ∈ 𝒫 𝑆)
11		iftrue 4498	. . . . . . 7 ⊢ (𝐸 = 𝐷 → if(𝐸 = 𝐷, ((𝐹‘𝐷) − 1), (𝐹‘𝐸)) = ((𝐹‘𝐷) − 1))
12	11	adantl 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝐸 = 𝐷) → if(𝐸 = 𝐷, ((𝐹‘𝐷) − 1), (𝐹‘𝐸)) = ((𝐹‘𝐷) − 1))
13		ramub1.9	. . . . . . 7 ⊢ (𝜑 → if(𝐸 = 𝐷, ((𝐹‘𝐷) − 1), (𝐹‘𝐸)) ≤ (♯‘𝑉))
14	13	adantr 485	. . . . . 6 ⊢ ((𝜑 ∧ 𝐸 = 𝐷) → if(𝐸 = 𝐷, ((𝐹‘𝐷) − 1), (𝐹‘𝐸)) ≤ (♯‘𝑉))
15	12, 14	eqbrtrrd 5139	. . . . 5 ⊢ ((𝜑 ∧ 𝐸 = 𝐷) → ((𝐹‘𝐷) − 1) ≤ (♯‘𝑉))
16		ramub1.f	. . . . . . . . 9 ⊢ (𝜑 → 𝐹:𝑅⟶ℕ)
17		ramub1.d	. . . . . . . . 9 ⊢ (𝜑 → 𝐷 ∈ 𝑅)
18	16, 17	ffvelcdmd 7081	. . . . . . . 8 ⊢ (𝜑 → (𝐹‘𝐷) ∈ ℕ)
19	18	adantr 485	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐸 = 𝐷) → (𝐹‘𝐷) ∈ ℕ)
20	19	nnred 12248	. . . . . 6 ⊢ ((𝜑 ∧ 𝐸 = 𝐷) → (𝐹‘𝐷) ∈ ℝ)
21		1red 11209	. . . . . 6 ⊢ ((𝜑 ∧ 𝐸 = 𝐷) → 1 ∈ ℝ)
22	1, 5	ssfid 9229	. . . . . . . 8 ⊢ (𝜑 → 𝑉 ∈ Fin)
23		hashcl 14392	. . . . . . . 8 ⊢ (𝑉 ∈ Fin → (♯‘𝑉) ∈ ℕ₀)
24		nn0re 12513	. . . . . . . 8 ⊢ ((♯‘𝑉) ∈ ℕ₀ → (♯‘𝑉) ∈ ℝ)
25	22, 23, 24	3syl 19	. . . . . . 7 ⊢ (𝜑 → (♯‘𝑉) ∈ ℝ)
26	25	adantr 485	. . . . . 6 ⊢ ((𝜑 ∧ 𝐸 = 𝐷) → (♯‘𝑉) ∈ ℝ)
27	20, 21, 26	lesubaddd 11811	. . . . 5 ⊢ ((𝜑 ∧ 𝐸 = 𝐷) → (((𝐹‘𝐷) − 1) ≤ (♯‘𝑉) ↔ (𝐹‘𝐷) ≤ ((♯‘𝑉) + 1)))
28	15, 27	mpbid 235	. . . 4 ⊢ ((𝜑 ∧ 𝐸 = 𝐷) → (𝐹‘𝐷) ≤ ((♯‘𝑉) + 1))
29		fveq2 6882	. . . . 5 ⊢ (𝐸 = 𝐷 → (𝐹‘𝐸) = (𝐹‘𝐷))
30		snidg 4631	. . . . . . . 8 ⊢ (𝑋 ∈ 𝑆 → 𝑋 ∈ {𝑋})
31	6, 30	syl 18	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ {𝑋})
32	4	sseld 3944	. . . . . . . 8 ⊢ (𝜑 → (𝑋 ∈ 𝑉 → 𝑋 ∈ (𝑆 ∖ {𝑋})))
33		eldifn 4094	. . . . . . . 8 ⊢ (𝑋 ∈ (𝑆 ∖ {𝑋}) → ¬ 𝑋 ∈ {𝑋})
34	32, 33	syl6 36	. . . . . . 7 ⊢ (𝜑 → (𝑋 ∈ 𝑉 → ¬ 𝑋 ∈ {𝑋}))
35	31, 34	mt2d 137	. . . . . 6 ⊢ (𝜑 → ¬ 𝑋 ∈ 𝑉)
36		hashunsng 14428	. . . . . . 7 ⊢ (𝑋 ∈ 𝑆 → ((𝑉 ∈ Fin ∧ ¬ 𝑋 ∈ 𝑉) → (♯‘(𝑉 ∪ {𝑋})) = ((♯‘𝑉) + 1)))
37	6, 36	syl 18	. . . . . 6 ⊢ (𝜑 → ((𝑉 ∈ Fin ∧ ¬ 𝑋 ∈ 𝑉) → (♯‘(𝑉 ∪ {𝑋})) = ((♯‘𝑉) + 1)))
38	22, 35, 37	mp2and 711	. . . . 5 ⊢ (𝜑 → (♯‘(𝑉 ∪ {𝑋})) = ((♯‘𝑉) + 1))
39	29, 38	breqan12rd 5130	. . . 4 ⊢ ((𝜑 ∧ 𝐸 = 𝐷) → ((𝐹‘𝐸) ≤ (♯‘(𝑉 ∪ {𝑋})) ↔ (𝐹‘𝐷) ≤ ((♯‘𝑉) + 1)))
40	28, 39	mpbird 260	. . 3 ⊢ ((𝜑 ∧ 𝐸 = 𝐷) → (𝐹‘𝐸) ≤ (♯‘(𝑉 ∪ {𝑋})))
41		snfi 9040	. . . . . . 7 ⊢ {𝑋} ∈ Fin
42		unfi 9155	. . . . . . 7 ⊢ ((𝑉 ∈ Fin ∧ {𝑋} ∈ Fin) → (𝑉 ∪ {𝑋}) ∈ Fin)
43	22, 41, 42	sylancl 597	. . . . . 6 ⊢ (𝜑 → (𝑉 ∪ {𝑋}) ∈ Fin)
44		ramub1.m	. . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ ℕ)
45	44	nnnn0d 12565	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℕ₀)
46		ramub1.3	. . . . . . 7 ⊢ 𝐶 = (𝑎 ∈ V, 𝑖 ∈ ℕ₀ ↦ {𝑏 ∈ 𝒫 𝑎 ∣ (♯‘𝑏) = 𝑖})
47	46	hashbcval 17062	. . . . . 6 ⊢ (((𝑉 ∪ {𝑋}) ∈ Fin ∧ 𝑀 ∈ ℕ₀) → ((𝑉 ∪ {𝑋})𝐶𝑀) = {𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∣ (♯‘𝑥) = 𝑀})
48	43, 45, 47	syl2anc 595	. . . . 5 ⊢ (𝜑 → ((𝑉 ∪ {𝑋})𝐶𝑀) = {𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∣ (♯‘𝑥) = 𝑀})
49	48	adantr 485	. . . 4 ⊢ ((𝜑 ∧ 𝐸 = 𝐷) → ((𝑉 ∪ {𝑋})𝐶𝑀) = {𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∣ (♯‘𝑥) = 𝑀})
50		simpl1l 1241	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ 𝑥 ∈ 𝒫 𝑉) → 𝜑)
51	46	hashbcval 17062	. . . . . . . . . 10 ⊢ ((𝑉 ∈ Fin ∧ 𝑀 ∈ ℕ₀) → (𝑉𝐶𝑀) = {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 𝑀})
52	22, 45, 51	syl2anc 595	. . . . . . . . 9 ⊢ (𝜑 → (𝑉𝐶𝑀) = {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 𝑀})
53		ramub1.s	. . . . . . . . 9 ⊢ (𝜑 → (𝑉𝐶𝑀) ⊆ (^◡𝐾 “ {𝐸}))
54	52, 53	eqsstrrd 3980	. . . . . . . 8 ⊢ (𝜑 → {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 𝑀} ⊆ (^◡𝐾 “ {𝐸}))
55	50, 54	syl 18	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ 𝑥 ∈ 𝒫 𝑉) → {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 𝑀} ⊆ (^◡𝐾 “ {𝐸}))
56		simpr 489	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ 𝑥 ∈ 𝒫 𝑉) → 𝑥 ∈ 𝒫 𝑉)
57		simpl3 1210	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ 𝑥 ∈ 𝒫 𝑉) → (♯‘𝑥) = 𝑀)
58		rabid 3444	. . . . . . . 8 ⊢ (𝑥 ∈ {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 𝑀} ↔ (𝑥 ∈ 𝒫 𝑉 ∧ (♯‘𝑥) = 𝑀))
59	56, 57, 58	sylanbrc 594	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ 𝑥 ∈ 𝒫 𝑉) → 𝑥 ∈ {𝑥 ∈ 𝒫 𝑉 ∣ (♯‘𝑥) = 𝑀})
60	55, 59	sseldd 3946	. . . . . 6 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ 𝑥 ∈ 𝒫 𝑉) → 𝑥 ∈ (^◡𝐾 “ {𝐸}))
61		simpl2 1209	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}))
62	61	elpwid 4576	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → 𝑥 ⊆ (𝑉 ∪ {𝑋}))
63		simpl1l 1241	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → 𝜑)
64	63, 8	syl 18	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → (𝑉 ∪ {𝑋}) ⊆ 𝑆)
65	62, 64	sstrd 3955	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → 𝑥 ⊆ 𝑆)
66		vex 3467	. . . . . . . . . . 11 ⊢ 𝑥 ∈ V
67	66	elpw 4571	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝒫 𝑆 ↔ 𝑥 ⊆ 𝑆)
68	65, 67	sylibr 237	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → 𝑥 ∈ 𝒫 𝑆)
69		simpl3 1210	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → (♯‘𝑥) = 𝑀)
70		rabid 3444	. . . . . . . . 9 ⊢ (𝑥 ∈ {𝑥 ∈ 𝒫 𝑆 ∣ (♯‘𝑥) = 𝑀} ↔ (𝑥 ∈ 𝒫 𝑆 ∧ (♯‘𝑥) = 𝑀))
71	68, 69, 70	sylanbrc 594	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → 𝑥 ∈ {𝑥 ∈ 𝒫 𝑆 ∣ (♯‘𝑥) = 𝑀})
72	46	hashbcval 17062	. . . . . . . . . 10 ⊢ ((𝑆 ∈ Fin ∧ 𝑀 ∈ ℕ₀) → (𝑆𝐶𝑀) = {𝑥 ∈ 𝒫 𝑆 ∣ (♯‘𝑥) = 𝑀})
73	1, 45, 72	syl2anc 595	. . . . . . . . 9 ⊢ (𝜑 → (𝑆𝐶𝑀) = {𝑥 ∈ 𝒫 𝑆 ∣ (♯‘𝑥) = 𝑀})
74	63, 73	syl 18	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → (𝑆𝐶𝑀) = {𝑥 ∈ 𝒫 𝑆 ∣ (♯‘𝑥) = 𝑀})
75	71, 74	eleqtrrd 2872	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → 𝑥 ∈ (𝑆𝐶𝑀))
76	3	difss2d 4101	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑊 ⊆ 𝑆)
77	1, 76	ssfid 9229	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑊 ∈ Fin)
78		nnm1nn0 12545	. . . . . . . . . . . . . . 15 ⊢ (𝑀 ∈ ℕ → (𝑀 − 1) ∈ ℕ₀)
79	44, 78	syl 18	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑀 − 1) ∈ ℕ₀)
80	46	hashbcval 17062	. . . . . . . . . . . . . 14 ⊢ ((𝑊 ∈ Fin ∧ (𝑀 − 1) ∈ ℕ₀) → (𝑊𝐶(𝑀 − 1)) = {𝑢 ∈ 𝒫 𝑊 ∣ (♯‘𝑢) = (𝑀 − 1)})
81	77, 79, 80	syl2anc 595	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑊𝐶(𝑀 − 1)) = {𝑢 ∈ 𝒫 𝑊 ∣ (♯‘𝑢) = (𝑀 − 1)})
82		ramub1.8	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑊𝐶(𝑀 − 1)) ⊆ (^◡𝐻 “ {𝐷}))
83	81, 82	eqsstrrd 3980	. . . . . . . . . . . 12 ⊢ (𝜑 → {𝑢 ∈ 𝒫 𝑊 ∣ (♯‘𝑢) = (𝑀 − 1)} ⊆ (^◡𝐻 “ {𝐷}))
84	63, 83	syl 18	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → {𝑢 ∈ 𝒫 𝑊 ∣ (♯‘𝑢) = (𝑀 − 1)} ⊆ (^◡𝐻 “ {𝐷}))
85		fveqeq2 6891	. . . . . . . . . . . 12 ⊢ (𝑢 = (𝑥 ∖ {𝑋}) → ((♯‘𝑢) = (𝑀 − 1) ↔ (♯‘(𝑥 ∖ {𝑋})) = (𝑀 − 1)))
86		uncom 4120	. . . . . . . . . . . . . . . 16 ⊢ (𝑉 ∪ {𝑋}) = ({𝑋} ∪ 𝑉)
87	62, 86	sseqtrdi 3985	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → 𝑥 ⊆ ({𝑋} ∪ 𝑉))
88		ssundif 4453	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ⊆ ({𝑋} ∪ 𝑉) ↔ (𝑥 ∖ {𝑋}) ⊆ 𝑉)
89	87, 88	sylib 221	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → (𝑥 ∖ {𝑋}) ⊆ 𝑉)
90	63, 2	syl 18	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → 𝑉 ⊆ 𝑊)
91	89, 90	sstrd 3955	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → (𝑥 ∖ {𝑋}) ⊆ 𝑊)
92	66	difexi 5301	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∖ {𝑋}) ∈ V
93	92	elpw 4571	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∖ {𝑋}) ∈ 𝒫 𝑊 ↔ (𝑥 ∖ {𝑋}) ⊆ 𝑊)
94	91, 93	sylibr 237	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → (𝑥 ∖ {𝑋}) ∈ 𝒫 𝑊)
95	63, 1	syl 18	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → 𝑆 ∈ Fin)
96	95, 65	ssfid 9229	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → 𝑥 ∈ Fin)
97		diffi 9159	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ Fin → (𝑥 ∖ {𝑋}) ∈ Fin)
98	96, 97	syl 18	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → (𝑥 ∖ {𝑋}) ∈ Fin)
99		hashcl 14392	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∖ {𝑋}) ∈ Fin → (♯‘(𝑥 ∖ {𝑋})) ∈ ℕ₀)
100		nn0cn 12514	. . . . . . . . . . . . . . 15 ⊢ ((♯‘(𝑥 ∖ {𝑋})) ∈ ℕ₀ → (♯‘(𝑥 ∖ {𝑋})) ∈ ℂ)
101	98, 99, 100	3syl 19	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → (♯‘(𝑥 ∖ {𝑋})) ∈ ℂ)
102		ax-1cn 11158	. . . . . . . . . . . . . 14 ⊢ 1 ∈ ℂ
103		pncan 11463	. . . . . . . . . . . . . 14 ⊢ (((♯‘(𝑥 ∖ {𝑋})) ∈ ℂ ∧ 1 ∈ ℂ) → (((♯‘(𝑥 ∖ {𝑋})) + 1) − 1) = (♯‘(𝑥 ∖ {𝑋})))
104	101, 102, 103	sylancl 597	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → (((♯‘(𝑥 ∖ {𝑋})) + 1) − 1) = (♯‘(𝑥 ∖ {𝑋})))
105		neldifsnd 4765	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → ¬ 𝑋 ∈ (𝑥 ∖ {𝑋}))
106		hashunsng 14428	. . . . . . . . . . . . . . . . 17 ⊢ (𝑋 ∈ 𝑆 → (((𝑥 ∖ {𝑋}) ∈ Fin ∧ ¬ 𝑋 ∈ (𝑥 ∖ {𝑋})) → (♯‘((𝑥 ∖ {𝑋}) ∪ {𝑋})) = ((♯‘(𝑥 ∖ {𝑋})) + 1)))
107	63, 6, 106	3syl 19	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → (((𝑥 ∖ {𝑋}) ∈ Fin ∧ ¬ 𝑋 ∈ (𝑥 ∖ {𝑋})) → (♯‘((𝑥 ∖ {𝑋}) ∪ {𝑋})) = ((♯‘(𝑥 ∖ {𝑋})) + 1)))
108	98, 105, 107	mp2and 711	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → (♯‘((𝑥 ∖ {𝑋}) ∪ {𝑋})) = ((♯‘(𝑥 ∖ {𝑋})) + 1))
109		undif1 4442	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑥 ∖ {𝑋}) ∪ {𝑋}) = (𝑥 ∪ {𝑋})
110		simpr 489	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → ¬ 𝑥 ∈ 𝒫 𝑉)
111	61, 110	eldifd 3924	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → 𝑥 ∈ (𝒫 (𝑉 ∪ {𝑋}) ∖ 𝒫 𝑉))
112		elpwunsn 4655	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑥 ∈ (𝒫 (𝑉 ∪ {𝑋}) ∖ 𝒫 𝑉) → 𝑋 ∈ 𝑥)
113	111, 112	syl 18	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → 𝑋 ∈ 𝑥)
114	113	snssd 4757	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → {𝑋} ⊆ 𝑥)
115		ssequn2 4150	. . . . . . . . . . . . . . . . . . 19 ⊢ ({𝑋} ⊆ 𝑥 ↔ (𝑥 ∪ {𝑋}) = 𝑥)
116	114, 115	sylib 221	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → (𝑥 ∪ {𝑋}) = 𝑥)
117	109, 116	eqtr2id 2817	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → 𝑥 = ((𝑥 ∖ {𝑋}) ∪ {𝑋}))
118	117	fveq2d 6886	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → (♯‘𝑥) = (♯‘((𝑥 ∖ {𝑋}) ∪ {𝑋})))
119	118, 69	eqtr3d 2806	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → (♯‘((𝑥 ∖ {𝑋}) ∪ {𝑋})) = 𝑀)
120	108, 119	eqtr3d 2806	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → ((♯‘(𝑥 ∖ {𝑋})) + 1) = 𝑀)
121	120	oveq1d 7426	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → (((♯‘(𝑥 ∖ {𝑋})) + 1) − 1) = (𝑀 − 1))
122	104, 121	eqtr3d 2806	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → (♯‘(𝑥 ∖ {𝑋})) = (𝑀 − 1))
123	85, 94, 122	elrabd 3661	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → (𝑥 ∖ {𝑋}) ∈ {𝑢 ∈ 𝒫 𝑊 ∣ (♯‘𝑢) = (𝑀 − 1)})
124	84, 123	sseldd 3946	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → (𝑥 ∖ {𝑋}) ∈ (^◡𝐻 “ {𝐷}))
125		ramub1.h	. . . . . . . . . . . 12 ⊢ 𝐻 = (𝑢 ∈ ((𝑆 ∖ {𝑋})𝐶(𝑀 − 1)) ↦ (𝐾‘(𝑢 ∪ {𝑋})))
126	125	mptiniseg 6241	. . . . . . . . . . 11 ⊢ (𝐷 ∈ 𝑅 → (^◡𝐻 “ {𝐷}) = {𝑢 ∈ ((𝑆 ∖ {𝑋})𝐶(𝑀 − 1)) ∣ (𝐾‘(𝑢 ∪ {𝑋})) = 𝐷})
127	63, 17, 126	3syl 19	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → (^◡𝐻 “ {𝐷}) = {𝑢 ∈ ((𝑆 ∖ {𝑋})𝐶(𝑀 − 1)) ∣ (𝐾‘(𝑢 ∪ {𝑋})) = 𝐷})
128	124, 127	eleqtrd 2871	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → (𝑥 ∖ {𝑋}) ∈ {𝑢 ∈ ((𝑆 ∖ {𝑋})𝐶(𝑀 − 1)) ∣ (𝐾‘(𝑢 ∪ {𝑋})) = 𝐷})
129		uneq1 4123	. . . . . . . . . . . 12 ⊢ (𝑢 = (𝑥 ∖ {𝑋}) → (𝑢 ∪ {𝑋}) = ((𝑥 ∖ {𝑋}) ∪ {𝑋}))
130	129	fveqeq2d 6890	. . . . . . . . . . 11 ⊢ (𝑢 = (𝑥 ∖ {𝑋}) → ((𝐾‘(𝑢 ∪ {𝑋})) = 𝐷 ↔ (𝐾‘((𝑥 ∖ {𝑋}) ∪ {𝑋})) = 𝐷))
131	130	elrab 3659	. . . . . . . . . 10 ⊢ ((𝑥 ∖ {𝑋}) ∈ {𝑢 ∈ ((𝑆 ∖ {𝑋})𝐶(𝑀 − 1)) ∣ (𝐾‘(𝑢 ∪ {𝑋})) = 𝐷} ↔ ((𝑥 ∖ {𝑋}) ∈ ((𝑆 ∖ {𝑋})𝐶(𝑀 − 1)) ∧ (𝐾‘((𝑥 ∖ {𝑋}) ∪ {𝑋})) = 𝐷))
132	131	simprbi 502	. . . . . . . . 9 ⊢ ((𝑥 ∖ {𝑋}) ∈ {𝑢 ∈ ((𝑆 ∖ {𝑋})𝐶(𝑀 − 1)) ∣ (𝐾‘(𝑢 ∪ {𝑋})) = 𝐷} → (𝐾‘((𝑥 ∖ {𝑋}) ∪ {𝑋})) = 𝐷)
133	128, 132	syl 18	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → (𝐾‘((𝑥 ∖ {𝑋}) ∪ {𝑋})) = 𝐷)
134	117	fveq2d 6886	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → (𝐾‘𝑥) = (𝐾‘((𝑥 ∖ {𝑋}) ∪ {𝑋})))
135		simpl1r 1242	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → 𝐸 = 𝐷)
136	133, 134, 135	3eqtr4d 2814	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → (𝐾‘𝑥) = 𝐸)
137		ramub1.6	. . . . . . . . 9 ⊢ (𝜑 → 𝐾:(𝑆𝐶𝑀)⟶𝑅)
138	137	ffnd 6707	. . . . . . . 8 ⊢ (𝜑 → 𝐾 Fn (𝑆𝐶𝑀))
139		fniniseg 7056	. . . . . . . 8 ⊢ (𝐾 Fn (𝑆𝐶𝑀) → (𝑥 ∈ (^◡𝐾 “ {𝐸}) ↔ (𝑥 ∈ (𝑆𝐶𝑀) ∧ (𝐾‘𝑥) = 𝐸)))
140	63, 138, 139	3syl 19	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → (𝑥 ∈ (^◡𝐾 “ {𝐸}) ↔ (𝑥 ∈ (𝑆𝐶𝑀) ∧ (𝐾‘𝑥) = 𝐸)))
141	75, 136, 140	mpbir2and 725	. . . . . 6 ⊢ ((((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) ∧ ¬ 𝑥 ∈ 𝒫 𝑉) → 𝑥 ∈ (^◡𝐾 “ {𝐸}))
142	60, 141	pm2.61dan 824	. . . . 5 ⊢ (((𝜑 ∧ 𝐸 = 𝐷) ∧ 𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∧ (♯‘𝑥) = 𝑀) → 𝑥 ∈ (^◡𝐾 “ {𝐸}))
143	142	rabssdv 4036	. . . 4 ⊢ ((𝜑 ∧ 𝐸 = 𝐷) → {𝑥 ∈ 𝒫 (𝑉 ∪ {𝑋}) ∣ (♯‘𝑥) = 𝑀} ⊆ (^◡𝐾 “ {𝐸}))
144	49, 143	eqsstrd 3979	. . 3 ⊢ ((𝜑 ∧ 𝐸 = 𝐷) → ((𝑉 ∪ {𝑋})𝐶𝑀) ⊆ (^◡𝐾 “ {𝐸}))
145		fveq2 6882	. . . . . 6 ⊢ (𝑧 = (𝑉 ∪ {𝑋}) → (♯‘𝑧) = (♯‘(𝑉 ∪ {𝑋})))
146	145	breq2d 5125	. . . . 5 ⊢ (𝑧 = (𝑉 ∪ {𝑋}) → ((𝐹‘𝐸) ≤ (♯‘𝑧) ↔ (𝐹‘𝐸) ≤ (♯‘(𝑉 ∪ {𝑋}))))
147		oveq1 7418	. . . . . 6 ⊢ (𝑧 = (𝑉 ∪ {𝑋}) → (𝑧𝐶𝑀) = ((𝑉 ∪ {𝑋})𝐶𝑀))
148	147	sseq1d 3976	. . . . 5 ⊢ (𝑧 = (𝑉 ∪ {𝑋}) → ((𝑧𝐶𝑀) ⊆ (^◡𝐾 “ {𝐸}) ↔ ((𝑉 ∪ {𝑋})𝐶𝑀) ⊆ (^◡𝐾 “ {𝐸})))
149	146, 148	anbi12d 643	. . . 4 ⊢ (𝑧 = (𝑉 ∪ {𝑋}) → (((𝐹‘𝐸) ≤ (♯‘𝑧) ∧ (𝑧𝐶𝑀) ⊆ (^◡𝐾 “ {𝐸})) ↔ ((𝐹‘𝐸) ≤ (♯‘(𝑉 ∪ {𝑋})) ∧ ((𝑉 ∪ {𝑋})𝐶𝑀) ⊆ (^◡𝐾 “ {𝐸}))))
150	149	rspcev 3590	. . 3 ⊢ (((𝑉 ∪ {𝑋}) ∈ 𝒫 𝑆 ∧ ((𝐹‘𝐸) ≤ (♯‘(𝑉 ∪ {𝑋})) ∧ ((𝑉 ∪ {𝑋})𝐶𝑀) ⊆ (^◡𝐾 “ {𝐸}))) → ∃𝑧 ∈ 𝒫 𝑆((𝐹‘𝐸) ≤ (♯‘𝑧) ∧ (𝑧𝐶𝑀) ⊆ (^◡𝐾 “ {𝐸})))
151	10, 40, 144, 150	syl12anc 849	. 2 ⊢ ((𝜑 ∧ 𝐸 = 𝐷) → ∃𝑧 ∈ 𝒫 𝑆((𝐹‘𝐸) ≤ (♯‘𝑧) ∧ (𝑧𝐶𝑀) ⊆ (^◡𝐾 “ {𝐸})))
152	1, 5	sselpwd 5299	. . . 4 ⊢ (𝜑 → 𝑉 ∈ 𝒫 𝑆)
153	152	adantr 485	. . 3 ⊢ ((𝜑 ∧ 𝐸 ≠ 𝐷) → 𝑉 ∈ 𝒫 𝑆)
154		ifnefalse 4504	. . . . 5 ⊢ (𝐸 ≠ 𝐷 → if(𝐸 = 𝐷, ((𝐹‘𝐷) − 1), (𝐹‘𝐸)) = (𝐹‘𝐸))
155	154	adantl 486	. . . 4 ⊢ ((𝜑 ∧ 𝐸 ≠ 𝐷) → if(𝐸 = 𝐷, ((𝐹‘𝐷) − 1), (𝐹‘𝐸)) = (𝐹‘𝐸))
156	13	adantr 485	. . . 4 ⊢ ((𝜑 ∧ 𝐸 ≠ 𝐷) → if(𝐸 = 𝐷, ((𝐹‘𝐷) − 1), (𝐹‘𝐸)) ≤ (♯‘𝑉))
157	155, 156	eqbrtrrd 5139	. . 3 ⊢ ((𝜑 ∧ 𝐸 ≠ 𝐷) → (𝐹‘𝐸) ≤ (♯‘𝑉))
158	53	adantr 485	. . 3 ⊢ ((𝜑 ∧ 𝐸 ≠ 𝐷) → (𝑉𝐶𝑀) ⊆ (^◡𝐾 “ {𝐸}))
159		fveq2 6882	. . . . . 6 ⊢ (𝑧 = 𝑉 → (♯‘𝑧) = (♯‘𝑉))
160	159	breq2d 5125	. . . . 5 ⊢ (𝑧 = 𝑉 → ((𝐹‘𝐸) ≤ (♯‘𝑧) ↔ (𝐹‘𝐸) ≤ (♯‘𝑉)))
161		oveq1 7418	. . . . . 6 ⊢ (𝑧 = 𝑉 → (𝑧𝐶𝑀) = (𝑉𝐶𝑀))
162	161	sseq1d 3976	. . . . 5 ⊢ (𝑧 = 𝑉 → ((𝑧𝐶𝑀) ⊆ (^◡𝐾 “ {𝐸}) ↔ (𝑉𝐶𝑀) ⊆ (^◡𝐾 “ {𝐸})))
163	160, 162	anbi12d 643	. . . 4 ⊢ (𝑧 = 𝑉 → (((𝐹‘𝐸) ≤ (♯‘𝑧) ∧ (𝑧𝐶𝑀) ⊆ (^◡𝐾 “ {𝐸})) ↔ ((𝐹‘𝐸) ≤ (♯‘𝑉) ∧ (𝑉𝐶𝑀) ⊆ (^◡𝐾 “ {𝐸}))))
164	163	rspcev 3590	. . 3 ⊢ ((𝑉 ∈ 𝒫 𝑆 ∧ ((𝐹‘𝐸) ≤ (♯‘𝑉) ∧ (𝑉𝐶𝑀) ⊆ (^◡𝐾 “ {𝐸}))) → ∃𝑧 ∈ 𝒫 𝑆((𝐹‘𝐸) ≤ (♯‘𝑧) ∧ (𝑧𝐶𝑀) ⊆ (^◡𝐾 “ {𝐸})))
165	153, 157, 158, 164	syl12anc 849	. 2 ⊢ ((𝜑 ∧ 𝐸 ≠ 𝐷) → ∃𝑧 ∈ 𝒫 𝑆((𝐹‘𝐸) ≤ (♯‘𝑧) ∧ (𝑧𝐶𝑀) ⊆ (^◡𝐾 “ {𝐸})))
166	151, 165	pm2.61dane 3051	1 ⊢ (𝜑 → ∃𝑧 ∈ 𝒫 𝑆((𝐹‘𝐸) ≤ (♯‘𝑧) ∧ (𝑧𝐶𝑀) ⊆ (^◡𝐾 “ {𝐸})))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 ∃wrex 3095 {crab 3423 Vcvv 3463 ∖ cdif 3910 ∪ cun 3911 ⊆ wss 3913 ifcif 4492 𝒫 cpw 4567 {csn 4594 class class class wbr 5113 ↦ cmpt 5196 ^◡ccnv 5661 “ cima 5665 Fn wfn 6532 ⟶wf 6533 ‘cfv 6537 (class class class)co 7411 ∈ cmpo 7413 Fincfn 8943 ℂcc 11098 ℝcr 11099 1c1 11101 + caddc 11103 ≤ cle 11244 − cmin 11441 ℕcn 12233 ℕ₀cn0 12504 ♯chash 14366 Ramsey cram 17059

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11156 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176 ax-pre-mulgt0 11177

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-int 4917 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-1o 8453 df-oadd 8457 df-er 8694 df-en 8944 df-dom 8945 df-sdom 8946 df-fin 8947 df-dju 9887 df-card 9925 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-sub 11443 df-neg 11444 df-nn 12234 df-n0 12505 df-z 12592 df-uz 12863 df-fz 13536 df-hash 14367

This theorem is referenced by: ramub1lem2 17087

W3C validator