Theorem psubspi 40724

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 40723	. . . . 5 ⊢ (𝐾 ∈ 𝐷 → (𝑋 ∈ 𝑆 ↔ (𝑋 ⊆ 𝐴 ∧ ∀𝑝 ∈ 𝐴 (∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑋 𝑝 ≤ (𝑞 ∨ 𝑟) → 𝑝 ∈ 𝑋))))
6	5	simplbda 505	. . . 4 ⊢ ((𝐾 ∈ 𝐷 ∧ 𝑋 ∈ 𝑆) → ∀𝑝 ∈ 𝐴 (∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑋 𝑝 ≤ (𝑞 ∨ 𝑟) → 𝑝 ∈ 𝑋))
7	6	ex 418	. . 3 ⊢ (𝐾 ∈ 𝐷 → (𝑋 ∈ 𝑆 → ∀𝑝 ∈ 𝐴 (∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑋 𝑝 ≤ (𝑞 ∨ 𝑟) → 𝑝 ∈ 𝑋)))
8		breq1 5105	. . . . . 6 ⊢ (𝑝 = 𝑃 → (𝑝 ≤ (𝑞 ∨ 𝑟) ↔ 𝑃 ≤ (𝑞 ∨ 𝑟)))
9	8	2rexbidv 3227	. . . . 5 ⊢ (𝑝 = 𝑃 → (∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑋 𝑝 ≤ (𝑞 ∨ 𝑟) ↔ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑋 𝑃 ≤ (𝑞 ∨ 𝑟)))
10		eleq1 2848	. . . . 5 ⊢ (𝑝 = 𝑃 → (𝑝 ∈ 𝑋 ↔ 𝑃 ∈ 𝑋))
11	9, 10	imbi12d 347	. . . 4 ⊢ (𝑝 = 𝑃 → ((∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑋 𝑝 ≤ (𝑞 ∨ 𝑟) → 𝑝 ∈ 𝑋) ↔ (∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑋 𝑃 ≤ (𝑞 ∨ 𝑟) → 𝑃 ∈ 𝑋)))
12	11	rspccv 3573	. . 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 3076  ∃wrex 3086   ⊆ wss 3898   class class class wbr 5102  ‘cfv 6527  (class class class)co 7408  lecple 17397  joincjn 18447  Atomscatm 40240  PSubSpcpsubsp 40473

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 2213  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390

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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-iota 6483  df-fun 6529  df-fv 6535  df-ov 7411  df-psubsp 40480

This theorem is used by:  psubspi2N  40725  paddidm  40818