Theorem psubspi 40622

Description: Property of a projective subspace. (Contributed by NM, 13-Jan-2012.)

Hypotheses

Ref	Expression
psubspset.l	⊢ ≤ = (le‘𝐾)
psubspset.j	⊢ ∨ = (join‘𝐾)
psubspset.a	⊢ 𝐴 = (Atoms‘𝐾)
psubspset.s	⊢ 𝑆 = (PSubSp‘𝐾)

Assertion

Ref	Expression
psubspi	⊢ (((𝐾 ∈ 𝐷 ∧ 𝑋 ∈ 𝑆 ∧ 𝑃 ∈ 𝐴) ∧ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑋 𝑃 ≤ (𝑞 ∨ 𝑟)) → 𝑃 ∈ 𝑋)

Distinct variable groups:   𝐴,𝑟,𝑞   𝐾,𝑞,𝑟   𝑋,𝑞,𝑟   𝐴,𝑞   𝑃,𝑞,𝑟

Allowed substitution hints:   𝐷(𝑟, 𝑞)   𝑆(𝑟, 𝑞)   ∨ (𝑟, 𝑞)   ≤ (𝑟, 𝑞)

Proof of Theorem psubspi

Dummy variable 𝑝 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		psubspset.l	. . . . . 6 ⊢ ≤ = (le‘𝐾)
2		psubspset.j	. . . . . 6 ⊢ ∨ = (join‘𝐾)
3		psubspset.a	. . . . . 6 ⊢ 𝐴 = (Atoms‘𝐾)
4		psubspset.s	. . . . . 6 ⊢ 𝑆 = (PSubSp‘𝐾)
5	1, 2, 3, 4	ispsubsp2 40621	. . . . 5 ⊢ (𝐾 ∈ 𝐷 → (𝑋 ∈ 𝑆 ↔ (𝑋 ⊆ 𝐴 ∧ ∀𝑝 ∈ 𝐴 (∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑋 𝑝 ≤ (𝑞 ∨ 𝑟) → 𝑝 ∈ 𝑋))))
6	5	simplbda 505	. . . 4 ⊢ ((𝐾 ∈ 𝐷 ∧ 𝑋 ∈ 𝑆) → ∀𝑝 ∈ 𝐴 (∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑋 𝑝 ≤ (𝑞 ∨ 𝑟) → 𝑝 ∈ 𝑋))
7	6	ex 418	. . 3 ⊢ (𝐾 ∈ 𝐷 → (𝑋 ∈ 𝑆 → ∀𝑝 ∈ 𝐴 (∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑋 𝑝 ≤ (𝑞 ∨ 𝑟) → 𝑝 ∈ 𝑋)))
8		breq1 5110	. . . . . 6 ⊢ (𝑝 = 𝑃 → (𝑝 ≤ (𝑞 ∨ 𝑟) ↔ 𝑃 ≤ (𝑞 ∨ 𝑟)))
9	8	2rexbidv 3229	. . . . 5 ⊢ (𝑝 = 𝑃 → (∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑋 𝑝 ≤ (𝑞 ∨ 𝑟) ↔ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑋 𝑃 ≤ (𝑞 ∨ 𝑟)))
10		eleq1 2850	. . . . 5 ⊢ (𝑝 = 𝑃 → (𝑝 ∈ 𝑋 ↔ 𝑃 ∈ 𝑋))
11	9, 10	imbi12d 347	. . . 4 ⊢ (𝑝 = 𝑃 → ((∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑋 𝑝 ≤ (𝑞 ∨ 𝑟) → 𝑝 ∈ 𝑋) ↔ (∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑋 𝑃 ≤ (𝑞 ∨ 𝑟) → 𝑃 ∈ 𝑋)))
12	11	rspccv 3576	. . 3 ⊢ (∀𝑝 ∈ 𝐴 (∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑋 𝑝 ≤ (𝑞 ∨ 𝑟) → 𝑝 ∈ 𝑋) → (𝑃 ∈ 𝐴 → (∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑋 𝑃 ≤ (𝑞 ∨ 𝑟) → 𝑃 ∈ 𝑋)))
13	7, 12	syl6 36	. 2 ⊢ (𝐾 ∈ 𝐷 → (𝑋 ∈ 𝑆 → (𝑃 ∈ 𝐴 → (∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑋 𝑃 ≤ (𝑞 ∨ 𝑟) → 𝑃 ∈ 𝑋))))
14	13	3imp1 1366	1 ⊢ (((𝐾 ∈ 𝐷 ∧ 𝑋 ∈ 𝑆 ∧ 𝑃 ∈ 𝐴) ∧ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑋 𝑃 ≤ (𝑞 ∨ 𝑟)) → 𝑃 ∈ 𝑋)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3078  ∃wrex 3088   ⊆ wss 3902   class class class wbr 5107  ‘cfv 6537  (class class class)co 7416  lecple 17353  joincjn 18403  Atomscatm 40138  PSubSpcpsubsp 40371

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-iota 6493  df-fun 6539  df-fv 6545  df-ov 7419  df-psubsp 40378

This theorem is used by:  psubspi2N  40623  paddidm  40716