Theorem lhpexle1lem 39990

Description: Lemma for lhpexle1 39991 and others that eliminates restrictions on 𝑋. (Contributed by NM, 24-Jul-2013.)

Hypotheses

Ref	Expression
lhpexle1lem.1	⊢ (𝜑 → ∃𝑝 ∈ 𝐴 (𝑝 ≤ 𝑊 ∧ 𝜓))
lhpexle1lem.2	⊢ ((𝜑 ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊)) → ∃𝑝 ∈ 𝐴 (𝑝 ≤ 𝑊 ∧ 𝜓 ∧ 𝑝 ≠ 𝑋))

Assertion

Ref	Expression
lhpexle1lem	⊢ (𝜑 → ∃𝑝 ∈ 𝐴 (𝑝 ≤ 𝑊 ∧ 𝜓 ∧ 𝑝 ≠ 𝑋))

Distinct variable groups:   ≤ ,𝑝   𝐴,𝑝   𝑊,𝑝   𝑋,𝑝   𝜑,𝑝

Allowed substitution hint:   𝜓(𝑝)

Proof of Theorem lhpexle1lem

Step	Hyp	Ref	Expression
1		lhpexle1lem.1	. . . 4 ⊢ (𝜑 → ∃𝑝 ∈ 𝐴 (𝑝 ≤ 𝑊 ∧ 𝜓))
2	1	adantr 480	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝐴) → ∃𝑝 ∈ 𝐴 (𝑝 ≤ 𝑊 ∧ 𝜓))
3		simprl 771	. . . . . 6 ⊢ ((((𝜑 ∧ ¬ 𝑋 ∈ 𝐴) ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≤ 𝑊 ∧ 𝜓)) → 𝑝 ≤ 𝑊)
4		simprr 773	. . . . . 6 ⊢ ((((𝜑 ∧ ¬ 𝑋 ∈ 𝐴) ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≤ 𝑊 ∧ 𝜓)) → 𝜓)
5		simplr 769	. . . . . . 7 ⊢ ((((𝜑 ∧ ¬ 𝑋 ∈ 𝐴) ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≤ 𝑊 ∧ 𝜓)) → 𝑝 ∈ 𝐴)
6		simpllr 776	. . . . . . 7 ⊢ ((((𝜑 ∧ ¬ 𝑋 ∈ 𝐴) ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≤ 𝑊 ∧ 𝜓)) → ¬ 𝑋 ∈ 𝐴)
7		nelne2 3038	. . . . . . 7 ⊢ ((𝑝 ∈ 𝐴 ∧ ¬ 𝑋 ∈ 𝐴) → 𝑝 ≠ 𝑋)
8	5, 6, 7	syl2anc 584	. . . . . 6 ⊢ ((((𝜑 ∧ ¬ 𝑋 ∈ 𝐴) ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≤ 𝑊 ∧ 𝜓)) → 𝑝 ≠ 𝑋)
9	3, 4, 8	3jca 1127	. . . . 5 ⊢ ((((𝜑 ∧ ¬ 𝑋 ∈ 𝐴) ∧ 𝑝 ∈ 𝐴) ∧ (𝑝 ≤ 𝑊 ∧ 𝜓)) → (𝑝 ≤ 𝑊 ∧ 𝜓 ∧ 𝑝 ≠ 𝑋))
10	9	ex 412	. . . 4 ⊢ (((𝜑 ∧ ¬ 𝑋 ∈ 𝐴) ∧ 𝑝 ∈ 𝐴) → ((𝑝 ≤ 𝑊 ∧ 𝜓) → (𝑝 ≤ 𝑊 ∧ 𝜓 ∧ 𝑝 ≠ 𝑋)))
11	10	reximdva 3166	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝐴) → (∃𝑝 ∈ 𝐴 (𝑝 ≤ 𝑊 ∧ 𝜓) → ∃𝑝 ∈ 𝐴 (𝑝 ≤ 𝑊 ∧ 𝜓 ∧ 𝑝 ≠ 𝑋)))
12	2, 11	mpd 15	. 2 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝐴) → ∃𝑝 ∈ 𝐴 (𝑝 ≤ 𝑊 ∧ 𝜓 ∧ 𝑝 ≠ 𝑋))
13	1	adantr 480	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ≤ 𝑊) → ∃𝑝 ∈ 𝐴 (𝑝 ≤ 𝑊 ∧ 𝜓))
14		simprl 771	. . . . . 6 ⊢ (((𝜑 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑝 ≤ 𝑊 ∧ 𝜓)) → 𝑝 ≤ 𝑊)
15		simprr 773	. . . . . 6 ⊢ (((𝜑 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑝 ≤ 𝑊 ∧ 𝜓)) → 𝜓)
16		simplr 769	. . . . . . 7 ⊢ (((𝜑 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑝 ≤ 𝑊 ∧ 𝜓)) → ¬ 𝑋 ≤ 𝑊)
17		nbrne2 5168	. . . . . . 7 ⊢ ((𝑝 ≤ 𝑊 ∧ ¬ 𝑋 ≤ 𝑊) → 𝑝 ≠ 𝑋)
18	14, 16, 17	syl2anc 584	. . . . . 6 ⊢ (((𝜑 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑝 ≤ 𝑊 ∧ 𝜓)) → 𝑝 ≠ 𝑋)
19	14, 15, 18	3jca 1127	. . . . 5 ⊢ (((𝜑 ∧ ¬ 𝑋 ≤ 𝑊) ∧ (𝑝 ≤ 𝑊 ∧ 𝜓)) → (𝑝 ≤ 𝑊 ∧ 𝜓 ∧ 𝑝 ≠ 𝑋))
20	19	ex 412	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝑋 ≤ 𝑊) → ((𝑝 ≤ 𝑊 ∧ 𝜓) → (𝑝 ≤ 𝑊 ∧ 𝜓 ∧ 𝑝 ≠ 𝑋)))
21	20	reximdv 3168	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ≤ 𝑊) → (∃𝑝 ∈ 𝐴 (𝑝 ≤ 𝑊 ∧ 𝜓) → ∃𝑝 ∈ 𝐴 (𝑝 ≤ 𝑊 ∧ 𝜓 ∧ 𝑝 ≠ 𝑋)))
22	13, 21	mpd 15	. 2 ⊢ ((𝜑 ∧ ¬ 𝑋 ≤ 𝑊) → ∃𝑝 ∈ 𝐴 (𝑝 ≤ 𝑊 ∧ 𝜓 ∧ 𝑝 ≠ 𝑋))
23		lhpexle1lem.2	. 2 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐴 ∧ 𝑋 ≤ 𝑊)) → ∃𝑝 ∈ 𝐴 (𝑝 ≤ 𝑊 ∧ 𝜓 ∧ 𝑝 ≠ 𝑋))
24	12, 22, 23	pm2.61dda 815	1 ⊢ (𝜑 → ∃𝑝 ∈ 𝐴 (𝑝 ≤ 𝑊 ∧ 𝜓 ∧ 𝑝 ≠ 𝑋))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∧ w3a 1086   ∈ wcel 2106   ≠ wne 2938  ∃wrex 3068   class class class wbr 5148

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-ext 2706

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-sb 2063  df-clab 2713  df-cleq 2727  df-clel 2814  df-ne 2939  df-rex 3069  df-rab 3434  df-v 3480  df-dif 3966  df-un 3968  df-ss 3980  df-nul 4340  df-if 4532  df-sn 4632  df-pr 4634  df-op 4638  df-br 5149

This theorem is referenced by:  lhpexle1  39991  lhpexle2  39993  lhpexle3  39995