Theorem 3dim1lem5 37480

Description: Lemma for 3dim1 37481. (Contributed by NM, 26-Jul-2012.)

Hypotheses

Ref	Expression
3dim0.j	⊢ ∨ = (join‘𝐾)
3dim0.l	⊢ ≤ = (le‘𝐾)
3dim0.a	⊢ 𝐴 = (Atoms‘𝐾)

Assertion

Ref	Expression
3dim1lem5	⊢ (((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴) ∧ (𝑃 ≠ 𝑢 ∧ ¬ 𝑣 ≤ (𝑃 ∨ 𝑢) ∧ ¬ 𝑤 ≤ ((𝑃 ∨ 𝑢) ∨ 𝑣))) → ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 ∃𝑠 ∈ 𝐴 (𝑃 ≠ 𝑞 ∧ ¬ 𝑟 ≤ (𝑃 ∨ 𝑞) ∧ ¬ 𝑠 ≤ ((𝑃 ∨ 𝑞) ∨ 𝑟)))

Distinct variable groups:   𝑟,𝑞,𝑠,𝐴   ∨ ,𝑟,𝑠   𝑣,𝑢,𝑤,𝐴,𝑞   ∨ ,𝑞,𝑢,𝑣,𝑤   𝑢,𝐾,𝑣,𝑤   ≤ ,𝑞   𝑢,𝑟,𝑣,𝑤, ≤ ,𝑠   𝑃,𝑞,𝑟,𝑠,𝑢,𝑣,𝑤

Allowed substitution hints:   𝐾(𝑠,𝑟,𝑞)

Proof of Theorem 3dim1lem5

Step	Hyp	Ref	Expression
1		neeq2 3007	. . 3 ⊢ (𝑞 = 𝑢 → (𝑃 ≠ 𝑞 ↔ 𝑃 ≠ 𝑢))
2		oveq2 7283	. . . . 5 ⊢ (𝑞 = 𝑢 → (𝑃 ∨ 𝑞) = (𝑃 ∨ 𝑢))
3	2	breq2d 5086	. . . 4 ⊢ (𝑞 = 𝑢 → (𝑟 ≤ (𝑃 ∨ 𝑞) ↔ 𝑟 ≤ (𝑃 ∨ 𝑢)))
4	3	notbid 318	. . 3 ⊢ (𝑞 = 𝑢 → (¬ 𝑟 ≤ (𝑃 ∨ 𝑞) ↔ ¬ 𝑟 ≤ (𝑃 ∨ 𝑢)))
5	2	oveq1d 7290	. . . . 5 ⊢ (𝑞 = 𝑢 → ((𝑃 ∨ 𝑞) ∨ 𝑟) = ((𝑃 ∨ 𝑢) ∨ 𝑟))
6	5	breq2d 5086	. . . 4 ⊢ (𝑞 = 𝑢 → (𝑠 ≤ ((𝑃 ∨ 𝑞) ∨ 𝑟) ↔ 𝑠 ≤ ((𝑃 ∨ 𝑢) ∨ 𝑟)))
7	6	notbid 318	. . 3 ⊢ (𝑞 = 𝑢 → (¬ 𝑠 ≤ ((𝑃 ∨ 𝑞) ∨ 𝑟) ↔ ¬ 𝑠 ≤ ((𝑃 ∨ 𝑢) ∨ 𝑟)))
8	1, 4, 7	3anbi123d 1435	. 2 ⊢ (𝑞 = 𝑢 → ((𝑃 ≠ 𝑞 ∧ ¬ 𝑟 ≤ (𝑃 ∨ 𝑞) ∧ ¬ 𝑠 ≤ ((𝑃 ∨ 𝑞) ∨ 𝑟)) ↔ (𝑃 ≠ 𝑢 ∧ ¬ 𝑟 ≤ (𝑃 ∨ 𝑢) ∧ ¬ 𝑠 ≤ ((𝑃 ∨ 𝑢) ∨ 𝑟))))
9		breq1 5077	. . . 4 ⊢ (𝑟 = 𝑣 → (𝑟 ≤ (𝑃 ∨ 𝑢) ↔ 𝑣 ≤ (𝑃 ∨ 𝑢)))
10	9	notbid 318	. . 3 ⊢ (𝑟 = 𝑣 → (¬ 𝑟 ≤ (𝑃 ∨ 𝑢) ↔ ¬ 𝑣 ≤ (𝑃 ∨ 𝑢)))
11		oveq2 7283	. . . . 5 ⊢ (𝑟 = 𝑣 → ((𝑃 ∨ 𝑢) ∨ 𝑟) = ((𝑃 ∨ 𝑢) ∨ 𝑣))
12	11	breq2d 5086	. . . 4 ⊢ (𝑟 = 𝑣 → (𝑠 ≤ ((𝑃 ∨ 𝑢) ∨ 𝑟) ↔ 𝑠 ≤ ((𝑃 ∨ 𝑢) ∨ 𝑣)))
13	12	notbid 318	. . 3 ⊢ (𝑟 = 𝑣 → (¬ 𝑠 ≤ ((𝑃 ∨ 𝑢) ∨ 𝑟) ↔ ¬ 𝑠 ≤ ((𝑃 ∨ 𝑢) ∨ 𝑣)))
14	10, 13	3anbi23d 1438	. 2 ⊢ (𝑟 = 𝑣 → ((𝑃 ≠ 𝑢 ∧ ¬ 𝑟 ≤ (𝑃 ∨ 𝑢) ∧ ¬ 𝑠 ≤ ((𝑃 ∨ 𝑢) ∨ 𝑟)) ↔ (𝑃 ≠ 𝑢 ∧ ¬ 𝑣 ≤ (𝑃 ∨ 𝑢) ∧ ¬ 𝑠 ≤ ((𝑃 ∨ 𝑢) ∨ 𝑣))))
15		breq1 5077	. . . 4 ⊢ (𝑠 = 𝑤 → (𝑠 ≤ ((𝑃 ∨ 𝑢) ∨ 𝑣) ↔ 𝑤 ≤ ((𝑃 ∨ 𝑢) ∨ 𝑣)))
16	15	notbid 318	. . 3 ⊢ (𝑠 = 𝑤 → (¬ 𝑠 ≤ ((𝑃 ∨ 𝑢) ∨ 𝑣) ↔ ¬ 𝑤 ≤ ((𝑃 ∨ 𝑢) ∨ 𝑣)))
17	16	3anbi3d 1441	. 2 ⊢ (𝑠 = 𝑤 → ((𝑃 ≠ 𝑢 ∧ ¬ 𝑣 ≤ (𝑃 ∨ 𝑢) ∧ ¬ 𝑠 ≤ ((𝑃 ∨ 𝑢) ∨ 𝑣)) ↔ (𝑃 ≠ 𝑢 ∧ ¬ 𝑣 ≤ (𝑃 ∨ 𝑢) ∧ ¬ 𝑤 ≤ ((𝑃 ∨ 𝑢) ∨ 𝑣))))
18	8, 14, 17	rspc3ev 3574	1 ⊢ (((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴) ∧ (𝑃 ≠ 𝑢 ∧ ¬ 𝑣 ≤ (𝑃 ∨ 𝑢) ∧ ¬ 𝑤 ≤ ((𝑃 ∨ 𝑢) ∨ 𝑣))) → ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 ∃𝑠 ∈ 𝐴 (𝑃 ≠ 𝑞 ∧ ¬ 𝑟 ≤ (𝑃 ∨ 𝑞) ∧ ¬ 𝑠 ≤ ((𝑃 ∨ 𝑞) ∨ 𝑟)))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 396   ∧ w3a 1086   = wceq 1539   ∈ wcel 2106   ≠ wne 2943  ∃wrex 3065   class class class wbr 5074  ‘cfv 6433  (class class class)co 7275  lecple 16969  joincjn 18029  Atomscatm 37277

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2709

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-ne 2944  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-iota 6391  df-fv 6441  df-ov 7278

This theorem is referenced by:  3dim1  37481