Theorem cdlemf 37701

Description: Lemma F in [Crawley] p. 116. If u is an atom under w, there exists a translation whose trace is u. (Contributed by NM, 12-Apr-2013.)

Hypotheses

Ref	Expression
cdlemf.l	⊢ ≤ = (le‘𝐾)
cdlemf.a	⊢ 𝐴 = (Atoms‘𝐾)
cdlemf.h	⊢ 𝐻 = (LHyp‘𝐾)
cdlemf.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
cdlemf.r	⊢ 𝑅 = ((trL‘𝐾)‘𝑊)

Assertion

Ref	Expression
cdlemf	⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐴 ∧ 𝑈 ≤ 𝑊)) → ∃𝑓 ∈ 𝑇 (𝑅‘𝑓) = 𝑈)

Distinct variable groups:   𝐴,𝑓   𝑓,𝐻   𝑓,𝐾   ≤ ,𝑓   𝑇,𝑓   𝑈,𝑓   𝑓,𝑊

Allowed substitution hint:   𝑅(𝑓)

Proof of Theorem cdlemf

Dummy variables 𝑝 𝑞 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cdlemf.l	. . 3 ⊢ ≤ = (le‘𝐾)
2		eqid 2823	. . 3 ⊢ (join‘𝐾) = (join‘𝐾)
3		cdlemf.a	. . 3 ⊢ 𝐴 = (Atoms‘𝐾)
4		cdlemf.h	. . 3 ⊢ 𝐻 = (LHyp‘𝐾)
5		eqid 2823	. . 3 ⊢ (meet‘𝐾) = (meet‘𝐾)
6	1, 2, 3, 4, 5	cdlemf2 37700	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐴 ∧ 𝑈 ≤ 𝑊)) → ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊)))
7		simp1l 1193	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐴 ∧ 𝑈 ≤ 𝑊)) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) ∧ ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊))) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
8		simp2l 1195	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐴 ∧ 𝑈 ≤ 𝑊)) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) ∧ ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊))) → 𝑝 ∈ 𝐴)
9		simp3ll 1240	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐴 ∧ 𝑈 ≤ 𝑊)) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) ∧ ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊))) → ¬ 𝑝 ≤ 𝑊)
10		simp2r 1196	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐴 ∧ 𝑈 ≤ 𝑊)) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) ∧ ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊))) → 𝑞 ∈ 𝐴)
11		simp3lr 1241	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐴 ∧ 𝑈 ≤ 𝑊)) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) ∧ ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊))) → ¬ 𝑞 ≤ 𝑊)
12		cdlemf.t	. . . . . . 7 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
13	1, 3, 4, 12	cdleme50ex 37697	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ≤ 𝑊) ∧ (𝑞 ∈ 𝐴 ∧ ¬ 𝑞 ≤ 𝑊)) → ∃𝑓 ∈ 𝑇 (𝑓‘𝑝) = 𝑞)
14	7, 8, 9, 10, 11, 13	syl122anc 1375	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐴 ∧ 𝑈 ≤ 𝑊)) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) ∧ ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊))) → ∃𝑓 ∈ 𝑇 (𝑓‘𝑝) = 𝑞)
15		simp3r 1198	. . . . . . . . . . . . 13 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐴 ∧ 𝑈 ≤ 𝑊) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) ∧ ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊)) ∧ (𝑓 ∈ 𝑇 ∧ (𝑓‘𝑝) = 𝑞)) → (𝑓‘𝑝) = 𝑞)
16	15	oveq2d 7174	. . . . . . . . . . . 12 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐴 ∧ 𝑈 ≤ 𝑊) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) ∧ ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊)) ∧ (𝑓 ∈ 𝑇 ∧ (𝑓‘𝑝) = 𝑞)) → (𝑝(join‘𝐾)(𝑓‘𝑝)) = (𝑝(join‘𝐾)𝑞))
17	16	oveq1d 7173	. . . . . . . . . . 11 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐴 ∧ 𝑈 ≤ 𝑊) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) ∧ ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊)) ∧ (𝑓 ∈ 𝑇 ∧ (𝑓‘𝑝) = 𝑞)) → ((𝑝(join‘𝐾)(𝑓‘𝑝))(meet‘𝐾)𝑊) = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊))
18		simp11 1199	. . . . . . . . . . . 12 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐴 ∧ 𝑈 ≤ 𝑊) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) ∧ ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊)) ∧ (𝑓 ∈ 𝑇 ∧ (𝑓‘𝑝) = 𝑞)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
19		simp3l 1197	. . . . . . . . . . . 12 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐴 ∧ 𝑈 ≤ 𝑊) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) ∧ ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊)) ∧ (𝑓 ∈ 𝑇 ∧ (𝑓‘𝑝) = 𝑞)) → 𝑓 ∈ 𝑇)
20		simp13l 1284	. . . . . . . . . . . 12 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐴 ∧ 𝑈 ≤ 𝑊) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) ∧ ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊)) ∧ (𝑓 ∈ 𝑇 ∧ (𝑓‘𝑝) = 𝑞)) → 𝑝 ∈ 𝐴)
21		simp2ll 1236	. . . . . . . . . . . 12 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐴 ∧ 𝑈 ≤ 𝑊) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) ∧ ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊)) ∧ (𝑓 ∈ 𝑇 ∧ (𝑓‘𝑝) = 𝑞)) → ¬ 𝑝 ≤ 𝑊)
22		cdlemf.r	. . . . . . . . . . . . 13 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
23	1, 2, 5, 3, 4, 12, 22	trlval2 37301	. . . . . . . . . . . 12 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑓 ∈ 𝑇 ∧ (𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ≤ 𝑊)) → (𝑅‘𝑓) = ((𝑝(join‘𝐾)(𝑓‘𝑝))(meet‘𝐾)𝑊))
24	18, 19, 20, 21, 23	syl112anc 1370	. . . . . . . . . . 11 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐴 ∧ 𝑈 ≤ 𝑊) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) ∧ ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊)) ∧ (𝑓 ∈ 𝑇 ∧ (𝑓‘𝑝) = 𝑞)) → (𝑅‘𝑓) = ((𝑝(join‘𝐾)(𝑓‘𝑝))(meet‘𝐾)𝑊))
25		simp2r 1196	. . . . . . . . . . 11 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐴 ∧ 𝑈 ≤ 𝑊) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) ∧ ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊)) ∧ (𝑓 ∈ 𝑇 ∧ (𝑓‘𝑝) = 𝑞)) → 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊))
26	17, 24, 25	3eqtr4d 2868	. . . . . . . . . 10 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐴 ∧ 𝑈 ≤ 𝑊) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) ∧ ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊)) ∧ (𝑓 ∈ 𝑇 ∧ (𝑓‘𝑝) = 𝑞)) → (𝑅‘𝑓) = 𝑈)
27	26	3exp 1115	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐴 ∧ 𝑈 ≤ 𝑊) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) → (((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊)) → ((𝑓 ∈ 𝑇 ∧ (𝑓‘𝑝) = 𝑞) → (𝑅‘𝑓) = 𝑈)))
28	27	3expia 1117	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐴 ∧ 𝑈 ≤ 𝑊)) → ((𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) → (((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊)) → ((𝑓 ∈ 𝑇 ∧ (𝑓‘𝑝) = 𝑞) → (𝑅‘𝑓) = 𝑈))))
29	28	3imp 1107	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐴 ∧ 𝑈 ≤ 𝑊)) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) ∧ ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊))) → ((𝑓 ∈ 𝑇 ∧ (𝑓‘𝑝) = 𝑞) → (𝑅‘𝑓) = 𝑈))
30	29	expd 418	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐴 ∧ 𝑈 ≤ 𝑊)) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) ∧ ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊))) → (𝑓 ∈ 𝑇 → ((𝑓‘𝑝) = 𝑞 → (𝑅‘𝑓) = 𝑈)))
31	30	reximdvai 3274	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐴 ∧ 𝑈 ≤ 𝑊)) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) ∧ ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊))) → (∃𝑓 ∈ 𝑇 (𝑓‘𝑝) = 𝑞 → ∃𝑓 ∈ 𝑇 (𝑅‘𝑓) = 𝑈))
32	14, 31	mpd 15	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐴 ∧ 𝑈 ≤ 𝑊)) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) ∧ ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊))) → ∃𝑓 ∈ 𝑇 (𝑅‘𝑓) = 𝑈)
33	32	3exp 1115	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐴 ∧ 𝑈 ≤ 𝑊)) → ((𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) → (((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊)) → ∃𝑓 ∈ 𝑇 (𝑅‘𝑓) = 𝑈)))
34	33	rexlimdvv 3295	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐴 ∧ 𝑈 ≤ 𝑊)) → (∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) ∧ 𝑈 = ((𝑝(join‘𝐾)𝑞)(meet‘𝐾)𝑊)) → ∃𝑓 ∈ 𝑇 (𝑅‘𝑓) = 𝑈))
35	6, 34	mpd 15	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐴 ∧ 𝑈 ≤ 𝑊)) → ∃𝑓 ∈ 𝑇 (𝑅‘𝑓) = 𝑈)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 398   ∧ w3a 1083   = wceq 1537   ∈ wcel 2114  ∃wrex 3141   class class class wbr 5068  ‘cfv 6357  (class class class)co 7158  lecple 16574  joincjn 17556  meetcmee 17557  Atomscatm 36401  HLchlt 36488  LHypclh 37122  LTrncltrn 37239  trLctrl 37296

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-rep 5192  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463  ax-riotaBAD 36091

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-ral 3145  df-rex 3146  df-reu 3147  df-rmo 3148  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4841  df-iun 4923  df-iin 4924  df-br 5069  df-opab 5131  df-mpt 5149  df-id 5462  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-riota 7116  df-ov 7161  df-oprab 7162  df-mpo 7163  df-1st 7691  df-2nd 7692  df-undef 7941  df-map 8410  df-proset 17540  df-poset 17558  df-plt 17570  df-lub 17586  df-glb 17587  df-join 17588  df-meet 17589  df-p0 17651  df-p1 17652  df-lat 17658  df-clat 17720  df-oposet 36314  df-ol 36316  df-oml 36317  df-covers 36404  df-ats 36405  df-atl 36436  df-cvlat 36460  df-hlat 36489  df-llines 36636  df-lplanes 36637  df-lvols 36638  df-lines 36639  df-psubsp 36641  df-pmap 36642  df-padd 36934  df-lhyp 37126  df-laut 37127  df-ldil 37242  df-ltrn 37243  df-trl 37297

This theorem is referenced by:  cdlemfnid  37702  trlord  37707  dih1dimb2  38379