Theorem mreexexlemd 16304

Description: This lemma is used to generate substitution instances of the induction hypothesis in mreexexd 16308. (Contributed by David Moews, 1-May-2017.)

Hypotheses

Ref	Expression
mreexexlemd.1	⊢ (𝜑 → 𝑋 ∈ 𝐽)
mreexexlemd.2	⊢ (𝜑 → 𝐹 ⊆ (𝑋 ∖ 𝐻))
mreexexlemd.3	⊢ (𝜑 → 𝐺 ⊆ (𝑋 ∖ 𝐻))
mreexexlemd.4	⊢ (𝜑 → 𝐹 ⊆ (𝑁‘(𝐺 ∪ 𝐻)))
mreexexlemd.5	⊢ (𝜑 → (𝐹 ∪ 𝐻) ∈ 𝐼)
mreexexlemd.6	⊢ (𝜑 → (𝐹 ≈ 𝐾 ∨ 𝐺 ≈ 𝐾))
mreexexlemd.7	⊢ (𝜑 → ∀𝑡∀𝑢 ∈ 𝒫 (𝑋 ∖ 𝑡)∀𝑣 ∈ 𝒫 (𝑋 ∖ 𝑡)(((𝑢 ≈ 𝐾 ∨ 𝑣 ≈ 𝐾) ∧ 𝑢 ⊆ (𝑁‘(𝑣 ∪ 𝑡)) ∧ (𝑢 ∪ 𝑡) ∈ 𝐼) → ∃𝑖 ∈ 𝒫 𝑣(𝑢 ≈ 𝑖 ∧ (𝑖 ∪ 𝑡) ∈ 𝐼)))

Assertion

Ref	Expression
mreexexlemd	⊢ (𝜑 → ∃𝑗 ∈ 𝒫 𝐺(𝐹 ≈ 𝑗 ∧ (𝑗 ∪ 𝐻) ∈ 𝐼))

Distinct variable groups:   𝑗,𝐹   𝑗,𝐺   𝑗,𝐻   𝜑,𝑗   𝑢,𝑡,𝑣,𝑖,𝐼,𝑗   𝑡,𝐾,𝑢,𝑣   𝑡,𝑁,𝑢,𝑣   𝑡,𝑋,𝑢,𝑣

Allowed substitution hints:   𝜑(𝑣,𝑢,𝑡,𝑖)   𝐹(𝑣,𝑢,𝑡,𝑖)   𝐺(𝑣,𝑢,𝑡,𝑖)   𝐻(𝑣,𝑢,𝑡,𝑖)   𝐽(𝑣,𝑢,𝑡,𝑖,𝑗)   𝐾(𝑖,𝑗)   𝑁(𝑖,𝑗)   𝑋(𝑖,𝑗)

Proof of Theorem mreexexlemd

Dummy variables 𝑓 𝑔 ℎ are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mreexexlemd.6	. 2 ⊢ (𝜑 → (𝐹 ≈ 𝐾 ∨ 𝐺 ≈ 𝐾))
2		mreexexlemd.4	. 2 ⊢ (𝜑 → 𝐹 ⊆ (𝑁‘(𝐺 ∪ 𝐻)))
3		mreexexlemd.5	. 2 ⊢ (𝜑 → (𝐹 ∪ 𝐻) ∈ 𝐼)
4		mreexexlemd.7	. . . 4 ⊢ (𝜑 → ∀𝑡∀𝑢 ∈ 𝒫 (𝑋 ∖ 𝑡)∀𝑣 ∈ 𝒫 (𝑋 ∖ 𝑡)(((𝑢 ≈ 𝐾 ∨ 𝑣 ≈ 𝐾) ∧ 𝑢 ⊆ (𝑁‘(𝑣 ∪ 𝑡)) ∧ (𝑢 ∪ 𝑡) ∈ 𝐼) → ∃𝑖 ∈ 𝒫 𝑣(𝑢 ≈ 𝑖 ∧ (𝑖 ∪ 𝑡) ∈ 𝐼)))
5		simplr 792	. . . . . . . . . . 11 ⊢ (((𝑡 = ℎ ∧ 𝑢 = 𝑓) ∧ 𝑣 = 𝑔) → 𝑢 = 𝑓)
6	5	breq1d 4663	. . . . . . . . . 10 ⊢ (((𝑡 = ℎ ∧ 𝑢 = 𝑓) ∧ 𝑣 = 𝑔) → (𝑢 ≈ 𝐾 ↔ 𝑓 ≈ 𝐾))
7		simpr 477	. . . . . . . . . . 11 ⊢ (((𝑡 = ℎ ∧ 𝑢 = 𝑓) ∧ 𝑣 = 𝑔) → 𝑣 = 𝑔)
8	7	breq1d 4663	. . . . . . . . . 10 ⊢ (((𝑡 = ℎ ∧ 𝑢 = 𝑓) ∧ 𝑣 = 𝑔) → (𝑣 ≈ 𝐾 ↔ 𝑔 ≈ 𝐾))
9	6, 8	orbi12d 746	. . . . . . . . 9 ⊢ (((𝑡 = ℎ ∧ 𝑢 = 𝑓) ∧ 𝑣 = 𝑔) → ((𝑢 ≈ 𝐾 ∨ 𝑣 ≈ 𝐾) ↔ (𝑓 ≈ 𝐾 ∨ 𝑔 ≈ 𝐾)))
10		simpll 790	. . . . . . . . . . . 12 ⊢ (((𝑡 = ℎ ∧ 𝑢 = 𝑓) ∧ 𝑣 = 𝑔) → 𝑡 = ℎ)
11	7, 10	uneq12d 3768	. . . . . . . . . . 11 ⊢ (((𝑡 = ℎ ∧ 𝑢 = 𝑓) ∧ 𝑣 = 𝑔) → (𝑣 ∪ 𝑡) = (𝑔 ∪ ℎ))
12	11	fveq2d 6195	. . . . . . . . . 10 ⊢ (((𝑡 = ℎ ∧ 𝑢 = 𝑓) ∧ 𝑣 = 𝑔) → (𝑁‘(𝑣 ∪ 𝑡)) = (𝑁‘(𝑔 ∪ ℎ)))
13	5, 12	sseq12d 3634	. . . . . . . . 9 ⊢ (((𝑡 = ℎ ∧ 𝑢 = 𝑓) ∧ 𝑣 = 𝑔) → (𝑢 ⊆ (𝑁‘(𝑣 ∪ 𝑡)) ↔ 𝑓 ⊆ (𝑁‘(𝑔 ∪ ℎ))))
14	5, 10	uneq12d 3768	. . . . . . . . . 10 ⊢ (((𝑡 = ℎ ∧ 𝑢 = 𝑓) ∧ 𝑣 = 𝑔) → (𝑢 ∪ 𝑡) = (𝑓 ∪ ℎ))
15	14	eleq1d 2686	. . . . . . . . 9 ⊢ (((𝑡 = ℎ ∧ 𝑢 = 𝑓) ∧ 𝑣 = 𝑔) → ((𝑢 ∪ 𝑡) ∈ 𝐼 ↔ (𝑓 ∪ ℎ) ∈ 𝐼))
16	9, 13, 15	3anbi123d 1399	. . . . . . . 8 ⊢ (((𝑡 = ℎ ∧ 𝑢 = 𝑓) ∧ 𝑣 = 𝑔) → (((𝑢 ≈ 𝐾 ∨ 𝑣 ≈ 𝐾) ∧ 𝑢 ⊆ (𝑁‘(𝑣 ∪ 𝑡)) ∧ (𝑢 ∪ 𝑡) ∈ 𝐼) ↔ ((𝑓 ≈ 𝐾 ∨ 𝑔 ≈ 𝐾) ∧ 𝑓 ⊆ (𝑁‘(𝑔 ∪ ℎ)) ∧ (𝑓 ∪ ℎ) ∈ 𝐼)))
17		simpllr 799	. . . . . . . . . . 11 ⊢ ((((𝑡 = ℎ ∧ 𝑢 = 𝑓) ∧ 𝑣 = 𝑔) ∧ 𝑖 = 𝑗) → 𝑢 = 𝑓)
18		simpr 477	. . . . . . . . . . 11 ⊢ ((((𝑡 = ℎ ∧ 𝑢 = 𝑓) ∧ 𝑣 = 𝑔) ∧ 𝑖 = 𝑗) → 𝑖 = 𝑗)
19	17, 18	breq12d 4666	. . . . . . . . . 10 ⊢ ((((𝑡 = ℎ ∧ 𝑢 = 𝑓) ∧ 𝑣 = 𝑔) ∧ 𝑖 = 𝑗) → (𝑢 ≈ 𝑖 ↔ 𝑓 ≈ 𝑗))
20		simplll 798	. . . . . . . . . . . 12 ⊢ ((((𝑡 = ℎ ∧ 𝑢 = 𝑓) ∧ 𝑣 = 𝑔) ∧ 𝑖 = 𝑗) → 𝑡 = ℎ)
21	18, 20	uneq12d 3768	. . . . . . . . . . 11 ⊢ ((((𝑡 = ℎ ∧ 𝑢 = 𝑓) ∧ 𝑣 = 𝑔) ∧ 𝑖 = 𝑗) → (𝑖 ∪ 𝑡) = (𝑗 ∪ ℎ))
22	21	eleq1d 2686	. . . . . . . . . 10 ⊢ ((((𝑡 = ℎ ∧ 𝑢 = 𝑓) ∧ 𝑣 = 𝑔) ∧ 𝑖 = 𝑗) → ((𝑖 ∪ 𝑡) ∈ 𝐼 ↔ (𝑗 ∪ ℎ) ∈ 𝐼))
23	19, 22	anbi12d 747	. . . . . . . . 9 ⊢ ((((𝑡 = ℎ ∧ 𝑢 = 𝑓) ∧ 𝑣 = 𝑔) ∧ 𝑖 = 𝑗) → ((𝑢 ≈ 𝑖 ∧ (𝑖 ∪ 𝑡) ∈ 𝐼) ↔ (𝑓 ≈ 𝑗 ∧ (𝑗 ∪ ℎ) ∈ 𝐼)))
24		simplr 792	. . . . . . . . . 10 ⊢ ((((𝑡 = ℎ ∧ 𝑢 = 𝑓) ∧ 𝑣 = 𝑔) ∧ 𝑖 = 𝑗) → 𝑣 = 𝑔)
25	24	pweqd 4163	. . . . . . . . 9 ⊢ ((((𝑡 = ℎ ∧ 𝑢 = 𝑓) ∧ 𝑣 = 𝑔) ∧ 𝑖 = 𝑗) → 𝒫 𝑣 = 𝒫 𝑔)
26	23, 25	cbvrexdva2 3176	. . . . . . . 8 ⊢ (((𝑡 = ℎ ∧ 𝑢 = 𝑓) ∧ 𝑣 = 𝑔) → (∃𝑖 ∈ 𝒫 𝑣(𝑢 ≈ 𝑖 ∧ (𝑖 ∪ 𝑡) ∈ 𝐼) ↔ ∃𝑗 ∈ 𝒫 𝑔(𝑓 ≈ 𝑗 ∧ (𝑗 ∪ ℎ) ∈ 𝐼)))
27	16, 26	imbi12d 334	. . . . . . 7 ⊢ (((𝑡 = ℎ ∧ 𝑢 = 𝑓) ∧ 𝑣 = 𝑔) → ((((𝑢 ≈ 𝐾 ∨ 𝑣 ≈ 𝐾) ∧ 𝑢 ⊆ (𝑁‘(𝑣 ∪ 𝑡)) ∧ (𝑢 ∪ 𝑡) ∈ 𝐼) → ∃𝑖 ∈ 𝒫 𝑣(𝑢 ≈ 𝑖 ∧ (𝑖 ∪ 𝑡) ∈ 𝐼)) ↔ (((𝑓 ≈ 𝐾 ∨ 𝑔 ≈ 𝐾) ∧ 𝑓 ⊆ (𝑁‘(𝑔 ∪ ℎ)) ∧ (𝑓 ∪ ℎ) ∈ 𝐼) → ∃𝑗 ∈ 𝒫 𝑔(𝑓 ≈ 𝑗 ∧ (𝑗 ∪ ℎ) ∈ 𝐼))))
28		simpl 473	. . . . . . . . . 10 ⊢ ((𝑡 = ℎ ∧ 𝑢 = 𝑓) → 𝑡 = ℎ)
29	28	difeq2d 3728	. . . . . . . . 9 ⊢ ((𝑡 = ℎ ∧ 𝑢 = 𝑓) → (𝑋 ∖ 𝑡) = (𝑋 ∖ ℎ))
30	29	pweqd 4163	. . . . . . . 8 ⊢ ((𝑡 = ℎ ∧ 𝑢 = 𝑓) → 𝒫 (𝑋 ∖ 𝑡) = 𝒫 (𝑋 ∖ ℎ))
31	30	adantr 481	. . . . . . 7 ⊢ (((𝑡 = ℎ ∧ 𝑢 = 𝑓) ∧ 𝑣 = 𝑔) → 𝒫 (𝑋 ∖ 𝑡) = 𝒫 (𝑋 ∖ ℎ))
32	27, 31	cbvraldva2 3175	. . . . . 6 ⊢ ((𝑡 = ℎ ∧ 𝑢 = 𝑓) → (∀𝑣 ∈ 𝒫 (𝑋 ∖ 𝑡)(((𝑢 ≈ 𝐾 ∨ 𝑣 ≈ 𝐾) ∧ 𝑢 ⊆ (𝑁‘(𝑣 ∪ 𝑡)) ∧ (𝑢 ∪ 𝑡) ∈ 𝐼) → ∃𝑖 ∈ 𝒫 𝑣(𝑢 ≈ 𝑖 ∧ (𝑖 ∪ 𝑡) ∈ 𝐼)) ↔ ∀𝑔 ∈ 𝒫 (𝑋 ∖ ℎ)(((𝑓 ≈ 𝐾 ∨ 𝑔 ≈ 𝐾) ∧ 𝑓 ⊆ (𝑁‘(𝑔 ∪ ℎ)) ∧ (𝑓 ∪ ℎ) ∈ 𝐼) → ∃𝑗 ∈ 𝒫 𝑔(𝑓 ≈ 𝑗 ∧ (𝑗 ∪ ℎ) ∈ 𝐼))))
33	32, 30	cbvraldva2 3175	. . . . 5 ⊢ (𝑡 = ℎ → (∀𝑢 ∈ 𝒫 (𝑋 ∖ 𝑡)∀𝑣 ∈ 𝒫 (𝑋 ∖ 𝑡)(((𝑢 ≈ 𝐾 ∨ 𝑣 ≈ 𝐾) ∧ 𝑢 ⊆ (𝑁‘(𝑣 ∪ 𝑡)) ∧ (𝑢 ∪ 𝑡) ∈ 𝐼) → ∃𝑖 ∈ 𝒫 𝑣(𝑢 ≈ 𝑖 ∧ (𝑖 ∪ 𝑡) ∈ 𝐼)) ↔ ∀𝑓 ∈ 𝒫 (𝑋 ∖ ℎ)∀𝑔 ∈ 𝒫 (𝑋 ∖ ℎ)(((𝑓 ≈ 𝐾 ∨ 𝑔 ≈ 𝐾) ∧ 𝑓 ⊆ (𝑁‘(𝑔 ∪ ℎ)) ∧ (𝑓 ∪ ℎ) ∈ 𝐼) → ∃𝑗 ∈ 𝒫 𝑔(𝑓 ≈ 𝑗 ∧ (𝑗 ∪ ℎ) ∈ 𝐼))))
34	33	cbvalv 2273	. . . 4 ⊢ (∀𝑡∀𝑢 ∈ 𝒫 (𝑋 ∖ 𝑡)∀𝑣 ∈ 𝒫 (𝑋 ∖ 𝑡)(((𝑢 ≈ 𝐾 ∨ 𝑣 ≈ 𝐾) ∧ 𝑢 ⊆ (𝑁‘(𝑣 ∪ 𝑡)) ∧ (𝑢 ∪ 𝑡) ∈ 𝐼) → ∃𝑖 ∈ 𝒫 𝑣(𝑢 ≈ 𝑖 ∧ (𝑖 ∪ 𝑡) ∈ 𝐼)) ↔ ∀ℎ∀𝑓 ∈ 𝒫 (𝑋 ∖ ℎ)∀𝑔 ∈ 𝒫 (𝑋 ∖ ℎ)(((𝑓 ≈ 𝐾 ∨ 𝑔 ≈ 𝐾) ∧ 𝑓 ⊆ (𝑁‘(𝑔 ∪ ℎ)) ∧ (𝑓 ∪ ℎ) ∈ 𝐼) → ∃𝑗 ∈ 𝒫 𝑔(𝑓 ≈ 𝑗 ∧ (𝑗 ∪ ℎ) ∈ 𝐼)))
35	4, 34	sylib 208	. . 3 ⊢ (𝜑 → ∀ℎ∀𝑓 ∈ 𝒫 (𝑋 ∖ ℎ)∀𝑔 ∈ 𝒫 (𝑋 ∖ ℎ)(((𝑓 ≈ 𝐾 ∨ 𝑔 ≈ 𝐾) ∧ 𝑓 ⊆ (𝑁‘(𝑔 ∪ ℎ)) ∧ (𝑓 ∪ ℎ) ∈ 𝐼) → ∃𝑗 ∈ 𝒫 𝑔(𝑓 ≈ 𝑗 ∧ (𝑗 ∪ ℎ) ∈ 𝐼)))
36		ssun2 3777	. . . . . 6 ⊢ 𝐻 ⊆ (𝐹 ∪ 𝐻)
37	36	a1i 11	. . . . 5 ⊢ (𝜑 → 𝐻 ⊆ (𝐹 ∪ 𝐻))
38	3, 37	ssexd 4805	. . . 4 ⊢ (𝜑 → 𝐻 ∈ V)
39		mreexexlemd.1	. . . . . . . . 9 ⊢ (𝜑 → 𝑋 ∈ 𝐽)
40		difexg 4808	. . . . . . . . 9 ⊢ (𝑋 ∈ 𝐽 → (𝑋 ∖ 𝐻) ∈ V)
41	39, 40	syl 17	. . . . . . . 8 ⊢ (𝜑 → (𝑋 ∖ 𝐻) ∈ V)
42		mreexexlemd.2	. . . . . . . 8 ⊢ (𝜑 → 𝐹 ⊆ (𝑋 ∖ 𝐻))
43	41, 42	sselpwd 4807	. . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ 𝒫 (𝑋 ∖ 𝐻))
44	43	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ ℎ = 𝐻) → 𝐹 ∈ 𝒫 (𝑋 ∖ 𝐻))
45		simpr 477	. . . . . . . 8 ⊢ ((𝜑 ∧ ℎ = 𝐻) → ℎ = 𝐻)
46	45	difeq2d 3728	. . . . . . 7 ⊢ ((𝜑 ∧ ℎ = 𝐻) → (𝑋 ∖ ℎ) = (𝑋 ∖ 𝐻))
47	46	pweqd 4163	. . . . . 6 ⊢ ((𝜑 ∧ ℎ = 𝐻) → 𝒫 (𝑋 ∖ ℎ) = 𝒫 (𝑋 ∖ 𝐻))
48	44, 47	eleqtrrd 2704	. . . . 5 ⊢ ((𝜑 ∧ ℎ = 𝐻) → 𝐹 ∈ 𝒫 (𝑋 ∖ ℎ))
49		mreexexlemd.3	. . . . . . . . 9 ⊢ (𝜑 → 𝐺 ⊆ (𝑋 ∖ 𝐻))
50	41, 49	sselpwd 4807	. . . . . . . 8 ⊢ (𝜑 → 𝐺 ∈ 𝒫 (𝑋 ∖ 𝐻))
51	50	ad2antrr 762	. . . . . . 7 ⊢ (((𝜑 ∧ ℎ = 𝐻) ∧ 𝑓 = 𝐹) → 𝐺 ∈ 𝒫 (𝑋 ∖ 𝐻))
52	47	adantr 481	. . . . . . 7 ⊢ (((𝜑 ∧ ℎ = 𝐻) ∧ 𝑓 = 𝐹) → 𝒫 (𝑋 ∖ ℎ) = 𝒫 (𝑋 ∖ 𝐻))
53	51, 52	eleqtrrd 2704	. . . . . 6 ⊢ (((𝜑 ∧ ℎ = 𝐻) ∧ 𝑓 = 𝐹) → 𝐺 ∈ 𝒫 (𝑋 ∖ ℎ))
54		simplr 792	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ ℎ = 𝐻) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → 𝑓 = 𝐹)
55	54	breq1d 4663	. . . . . . . . 9 ⊢ ((((𝜑 ∧ ℎ = 𝐻) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (𝑓 ≈ 𝐾 ↔ 𝐹 ≈ 𝐾))
56		simpr 477	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ ℎ = 𝐻) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → 𝑔 = 𝐺)
57	56	breq1d 4663	. . . . . . . . 9 ⊢ ((((𝜑 ∧ ℎ = 𝐻) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (𝑔 ≈ 𝐾 ↔ 𝐺 ≈ 𝐾))
58	55, 57	orbi12d 746	. . . . . . . 8 ⊢ ((((𝜑 ∧ ℎ = 𝐻) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → ((𝑓 ≈ 𝐾 ∨ 𝑔 ≈ 𝐾) ↔ (𝐹 ≈ 𝐾 ∨ 𝐺 ≈ 𝐾)))
59		simpllr 799	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ ℎ = 𝐻) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → ℎ = 𝐻)
60	56, 59	uneq12d 3768	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ ℎ = 𝐻) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (𝑔 ∪ ℎ) = (𝐺 ∪ 𝐻))
61	60	fveq2d 6195	. . . . . . . . 9 ⊢ ((((𝜑 ∧ ℎ = 𝐻) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (𝑁‘(𝑔 ∪ ℎ)) = (𝑁‘(𝐺 ∪ 𝐻)))
62	54, 61	sseq12d 3634	. . . . . . . 8 ⊢ ((((𝜑 ∧ ℎ = 𝐻) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (𝑓 ⊆ (𝑁‘(𝑔 ∪ ℎ)) ↔ 𝐹 ⊆ (𝑁‘(𝐺 ∪ 𝐻))))
63	54, 59	uneq12d 3768	. . . . . . . . 9 ⊢ ((((𝜑 ∧ ℎ = 𝐻) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (𝑓 ∪ ℎ) = (𝐹 ∪ 𝐻))
64	63	eleq1d 2686	. . . . . . . 8 ⊢ ((((𝜑 ∧ ℎ = 𝐻) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → ((𝑓 ∪ ℎ) ∈ 𝐼 ↔ (𝐹 ∪ 𝐻) ∈ 𝐼))
65	58, 62, 64	3anbi123d 1399	. . . . . . 7 ⊢ ((((𝜑 ∧ ℎ = 𝐻) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (((𝑓 ≈ 𝐾 ∨ 𝑔 ≈ 𝐾) ∧ 𝑓 ⊆ (𝑁‘(𝑔 ∪ ℎ)) ∧ (𝑓 ∪ ℎ) ∈ 𝐼) ↔ ((𝐹 ≈ 𝐾 ∨ 𝐺 ≈ 𝐾) ∧ 𝐹 ⊆ (𝑁‘(𝐺 ∪ 𝐻)) ∧ (𝐹 ∪ 𝐻) ∈ 𝐼)))
66	56	pweqd 4163	. . . . . . . 8 ⊢ ((((𝜑 ∧ ℎ = 𝐻) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → 𝒫 𝑔 = 𝒫 𝐺)
67	54	breq1d 4663	. . . . . . . . 9 ⊢ ((((𝜑 ∧ ℎ = 𝐻) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (𝑓 ≈ 𝑗 ↔ 𝐹 ≈ 𝑗))
68	59	uneq2d 3767	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ ℎ = 𝐻) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (𝑗 ∪ ℎ) = (𝑗 ∪ 𝐻))
69	68	eleq1d 2686	. . . . . . . . 9 ⊢ ((((𝜑 ∧ ℎ = 𝐻) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → ((𝑗 ∪ ℎ) ∈ 𝐼 ↔ (𝑗 ∪ 𝐻) ∈ 𝐼))
70	67, 69	anbi12d 747	. . . . . . . 8 ⊢ ((((𝜑 ∧ ℎ = 𝐻) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → ((𝑓 ≈ 𝑗 ∧ (𝑗 ∪ ℎ) ∈ 𝐼) ↔ (𝐹 ≈ 𝑗 ∧ (𝑗 ∪ 𝐻) ∈ 𝐼)))
71	66, 70	rexeqbidv 3153	. . . . . . 7 ⊢ ((((𝜑 ∧ ℎ = 𝐻) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → (∃𝑗 ∈ 𝒫 𝑔(𝑓 ≈ 𝑗 ∧ (𝑗 ∪ ℎ) ∈ 𝐼) ↔ ∃𝑗 ∈ 𝒫 𝐺(𝐹 ≈ 𝑗 ∧ (𝑗 ∪ 𝐻) ∈ 𝐼)))
72	65, 71	imbi12d 334	. . . . . 6 ⊢ ((((𝜑 ∧ ℎ = 𝐻) ∧ 𝑓 = 𝐹) ∧ 𝑔 = 𝐺) → ((((𝑓 ≈ 𝐾 ∨ 𝑔 ≈ 𝐾) ∧ 𝑓 ⊆ (𝑁‘(𝑔 ∪ ℎ)) ∧ (𝑓 ∪ ℎ) ∈ 𝐼) → ∃𝑗 ∈ 𝒫 𝑔(𝑓 ≈ 𝑗 ∧ (𝑗 ∪ ℎ) ∈ 𝐼)) ↔ (((𝐹 ≈ 𝐾 ∨ 𝐺 ≈ 𝐾) ∧ 𝐹 ⊆ (𝑁‘(𝐺 ∪ 𝐻)) ∧ (𝐹 ∪ 𝐻) ∈ 𝐼) → ∃𝑗 ∈ 𝒫 𝐺(𝐹 ≈ 𝑗 ∧ (𝑗 ∪ 𝐻) ∈ 𝐼))))
73	53, 72	rspcdv 3312	. . . . 5 ⊢ (((𝜑 ∧ ℎ = 𝐻) ∧ 𝑓 = 𝐹) → (∀𝑔 ∈ 𝒫 (𝑋 ∖ ℎ)(((𝑓 ≈ 𝐾 ∨ 𝑔 ≈ 𝐾) ∧ 𝑓 ⊆ (𝑁‘(𝑔 ∪ ℎ)) ∧ (𝑓 ∪ ℎ) ∈ 𝐼) → ∃𝑗 ∈ 𝒫 𝑔(𝑓 ≈ 𝑗 ∧ (𝑗 ∪ ℎ) ∈ 𝐼)) → (((𝐹 ≈ 𝐾 ∨ 𝐺 ≈ 𝐾) ∧ 𝐹 ⊆ (𝑁‘(𝐺 ∪ 𝐻)) ∧ (𝐹 ∪ 𝐻) ∈ 𝐼) → ∃𝑗 ∈ 𝒫 𝐺(𝐹 ≈ 𝑗 ∧ (𝑗 ∪ 𝐻) ∈ 𝐼))))
74	48, 73	rspcimdv 3310	. . . 4 ⊢ ((𝜑 ∧ ℎ = 𝐻) → (∀𝑓 ∈ 𝒫 (𝑋 ∖ ℎ)∀𝑔 ∈ 𝒫 (𝑋 ∖ ℎ)(((𝑓 ≈ 𝐾 ∨ 𝑔 ≈ 𝐾) ∧ 𝑓 ⊆ (𝑁‘(𝑔 ∪ ℎ)) ∧ (𝑓 ∪ ℎ) ∈ 𝐼) → ∃𝑗 ∈ 𝒫 𝑔(𝑓 ≈ 𝑗 ∧ (𝑗 ∪ ℎ) ∈ 𝐼)) → (((𝐹 ≈ 𝐾 ∨ 𝐺 ≈ 𝐾) ∧ 𝐹 ⊆ (𝑁‘(𝐺 ∪ 𝐻)) ∧ (𝐹 ∪ 𝐻) ∈ 𝐼) → ∃𝑗 ∈ 𝒫 𝐺(𝐹 ≈ 𝑗 ∧ (𝑗 ∪ 𝐻) ∈ 𝐼))))
75	38, 74	spcimdv 3290	. . 3 ⊢ (𝜑 → (∀ℎ∀𝑓 ∈ 𝒫 (𝑋 ∖ ℎ)∀𝑔 ∈ 𝒫 (𝑋 ∖ ℎ)(((𝑓 ≈ 𝐾 ∨ 𝑔 ≈ 𝐾) ∧ 𝑓 ⊆ (𝑁‘(𝑔 ∪ ℎ)) ∧ (𝑓 ∪ ℎ) ∈ 𝐼) → ∃𝑗 ∈ 𝒫 𝑔(𝑓 ≈ 𝑗 ∧ (𝑗 ∪ ℎ) ∈ 𝐼)) → (((𝐹 ≈ 𝐾 ∨ 𝐺 ≈ 𝐾) ∧ 𝐹 ⊆ (𝑁‘(𝐺 ∪ 𝐻)) ∧ (𝐹 ∪ 𝐻) ∈ 𝐼) → ∃𝑗 ∈ 𝒫 𝐺(𝐹 ≈ 𝑗 ∧ (𝑗 ∪ 𝐻) ∈ 𝐼))))
76	35, 75	mpd 15	. 2 ⊢ (𝜑 → (((𝐹 ≈ 𝐾 ∨ 𝐺 ≈ 𝐾) ∧ 𝐹 ⊆ (𝑁‘(𝐺 ∪ 𝐻)) ∧ (𝐹 ∪ 𝐻) ∈ 𝐼) → ∃𝑗 ∈ 𝒫 𝐺(𝐹 ≈ 𝑗 ∧ (𝑗 ∪ 𝐻) ∈ 𝐼)))
77	1, 2, 3, 76	mp3and 1427	1 ⊢ (𝜑 → ∃𝑗 ∈ 𝒫 𝐺(𝐹 ≈ 𝑗 ∧ (𝑗 ∪ 𝐻) ∈ 𝐼))

Syntax hints:   → wi 4   ∨ wo 383   ∧ wa 384   ∧ w3a 1037  ∀wal 1481   = wceq 1483   ∈ wcel 1990  ∀wral 2912  ∃wrex 2913  Vcvv 3200   ∖ cdif 3571   ∪ cun 3572   ⊆ wss 3574  𝒫 cpw 4158   class class class wbr 4653  ‘cfv 5888   ≈ cen 7952

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-iota 5851  df-fv 5896

This theorem is referenced by:  mreexexlem4d  16307  mreexexd  16308  mreexexdOLD  16309