Theorem cdlemg2cex 41472

Description: Any translation is one of our 𝐹 s. TODO: fix comment, move to its own block maybe? Would this help for cdlemf 41444? (Contributed by NM, 22-Apr-2013.)

Hypotheses

Ref	Expression
cdlemg2.b	⊢ 𝐵 = (Base‘𝐾)
cdlemg2.l	⊢ ≤ = (le‘𝐾)
cdlemg2.j	⊢ ∨ = (join‘𝐾)
cdlemg2.m	⊢ ∧ = (meet‘𝐾)
cdlemg2.a	⊢ 𝐴 = (Atoms‘𝐾)
cdlemg2.h	⊢ 𝐻 = (LHyp‘𝐾)
cdlemg2.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
cdlemg2ex.u	⊢ 𝑈 = ((𝑝 ∨ 𝑞) ∧ 𝑊)
cdlemg2ex.d	⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑞 ∨ ((𝑝 ∨ 𝑡) ∧ 𝑊)))
cdlemg2ex.e	⊢ 𝐸 = ((𝑝 ∨ 𝑞) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊)))
cdlemg2ex.g	⊢ 𝐺 = (𝑥 ∈ 𝐵 ↦ if((𝑝 ≠ 𝑞 ∧ ¬ 𝑥 ≤ 𝑊), (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑝 ∨ 𝑞), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))), 𝑥))

Assertion

Ref	Expression
cdlemg2cex	⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (𝐹 ∈ 𝑇 ↔ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺)))

Distinct variable groups:   ∧ ,𝑠,𝑡,𝑥,𝑦,𝑧   𝐾,𝑠,𝑡,𝑥,𝑦,𝑧   𝑈,𝑠,𝑡,𝑥,𝑦,𝑧   𝑊,𝑠,𝑡,𝑥,𝑦,𝑧   ∨ ,𝑠,𝑡,𝑥,𝑦,𝑧   𝐵,𝑠,𝑡,𝑥,𝑦,𝑧   𝐴,𝑠,𝑡,𝑥,𝑦,𝑧   ≤ ,𝑠,𝑡,𝑥,𝑦,𝑧   𝐻,𝑠,𝑡,𝑥,𝑦,𝑧   𝑥,𝐸,𝑦,𝑧   𝐷,𝑠,𝑥,𝑦,𝑧   𝑞,𝑝,𝐴   𝐹,𝑝,𝑞   𝐻,𝑝,𝑞   𝐾,𝑝,𝑞   ≤ ,𝑝,𝑞   𝑇,𝑝,𝑞   𝑊,𝑝,𝑞,𝑠,𝑡,𝑥,𝑦,𝑧

Allowed substitution hints:   𝐵(𝑞, 𝑝)   𝐷(𝑡, 𝑞, 𝑝)   𝑇(𝑥, 𝑦, 𝑧, 𝑡, 𝑠)   𝑈(𝑞, 𝑝)   𝐸(𝑡, 𝑠, 𝑞, 𝑝)   𝐹(𝑥, 𝑦, 𝑧, 𝑡, 𝑠)   𝐺(𝑥, 𝑦, 𝑧, 𝑡, 𝑠, 𝑞, 𝑝)   ∨ (𝑞, 𝑝)   ∧ (𝑞, 𝑝)

Proof of Theorem cdlemg2cex

Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cdlemg2.l	. . 3 ⊢ ≤ = (le‘𝐾)
2		cdlemg2.a	. . 3 ⊢ 𝐴 = (Atoms‘𝐾)
3		cdlemg2.h	. . 3 ⊢ 𝐻 = (LHyp‘𝐾)
4		cdlemg2.t	. . 3 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
5	1, 2, 3, 4	cdlemg1cex 41469	. 2 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (𝐹 ∈ 𝑇 ↔ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = (℩𝑓 ∈ 𝑇 (𝑓‘𝑝) = 𝑞))))
6		simplll 787	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) ∧ (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊)) → 𝐾 ∈ HL)
7		simpllr 788	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) ∧ (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊)) → 𝑊 ∈ 𝐻)
8		simplrl 789	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) ∧ (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊)) → 𝑝 ∈ 𝐴)
9		simprl 783	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) ∧ (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊)) → ¬ 𝑝 ≤ 𝑊)
10		simplrr 790	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) ∧ (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊)) → 𝑞 ∈ 𝐴)
11		simprr 785	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) ∧ (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊)) → ¬ 𝑞 ≤ 𝑊)
12		cdlemg2.b	. . . . . . . 8 ⊢ 𝐵 = (Base‘𝐾)
13		cdlemg2.j	. . . . . . . 8 ⊢ ∨ = (join‘𝐾)
14		cdlemg2.m	. . . . . . . 8 ⊢ ∧ = (meet‘𝐾)
15		cdlemg2ex.u	. . . . . . . 8 ⊢ 𝑈 = ((𝑝 ∨ 𝑞) ∧ 𝑊)
16		cdlemg2ex.d	. . . . . . . 8 ⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑞 ∨ ((𝑝 ∨ 𝑡) ∧ 𝑊)))
17		cdlemg2ex.e	. . . . . . . 8 ⊢ 𝐸 = ((𝑝 ∨ 𝑞) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊)))
18		cdlemg2ex.g	. . . . . . . 8 ⊢ 𝐺 = (𝑥 ∈ 𝐵 ↦ if((𝑝 ≠ 𝑞 ∧ ¬ 𝑥 ≤ 𝑊), (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑝 ∨ 𝑞), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))), 𝑥))
19		eqid 2762	. . . . . . . 8 ⊢ (℩𝑓 ∈ 𝑇 (𝑓‘𝑝) = 𝑞) = (℩𝑓 ∈ 𝑇 (𝑓‘𝑝) = 𝑞)
20	12, 1, 13, 14, 2, 3, 15, 16, 17, 18, 4, 19	cdlemg1b2 41452	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ≤ 𝑊) ∧ (𝑞 ∈ 𝐴 ∧ ¬ 𝑞 ≤ 𝑊)) → (℩𝑓 ∈ 𝑇 (𝑓‘𝑝) = 𝑞) = 𝐺)
21	6, 7, 8, 9, 10, 11, 20	syl222anc 1413	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) ∧ (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊)) → (℩𝑓 ∈ 𝑇 (𝑓‘𝑝) = 𝑞) = 𝐺)
22	21	eqeq2d 2773	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) ∧ (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊)) → (𝐹 = (℩𝑓 ∈ 𝑇 (𝑓‘𝑝) = 𝑞) ↔ 𝐹 = 𝐺))
23	22	pm5.32da 590	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) → (((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) ∧ 𝐹 = (℩𝑓 ∈ 𝑇 (𝑓‘𝑝) = 𝑞)) ↔ ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) ∧ 𝐹 = 𝐺)))
24		df-3an 1105	. . . 4 ⊢ ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = (℩𝑓 ∈ 𝑇 (𝑓‘𝑝) = 𝑞)) ↔ ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) ∧ 𝐹 = (℩𝑓 ∈ 𝑇 (𝑓‘𝑝) = 𝑞)))
25		df-3an 1105	. . . 4 ⊢ ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺) ↔ ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊) ∧ 𝐹 = 𝐺))
26	23, 24, 25	3bitr4g 317	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) → ((¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = (℩𝑓 ∈ 𝑇 (𝑓‘𝑝) = 𝑞)) ↔ (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺)))
27	26	2rexbidva 3227	. 2 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = (℩𝑓 ∈ 𝑇 (𝑓‘𝑝) = 𝑞)) ↔ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺)))
28	5, 27	bitrd 282	1 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (𝐹 ∈ 𝑇 ↔ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 (¬ 𝑝 ≤ 𝑊 ∧ ¬ 𝑞 ≤ 𝑊 ∧ 𝐹 = 𝐺)))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ≠ wne 2957  ∀wral 3078  ∃wrex 3088  ⦋csb 3850  ifcif 4485   class class class wbr 5107   ↦ cmpt 5190  ‘cfv 6537  ℩crio 7373  (class class class)co 7417  Basecbs 17307  lecple 17355  joincjn 18405  meetcmee 18406  Atomscatm 40144  HLchlt 40231  LHypclh 40865  LTrncltrn 40982

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-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740  ax-riotaBAD 39834

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  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-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  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-iun 4956  df-iin 4957  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-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7374  df-ov 7420  df-oprab 7421  df-mpo 7422  df-1st 7990  df-2nd 7991  df-undef 8275  df-map 8832  df-proset 18388  df-poset 18407  df-plt 18422  df-lub 18438  df-glb 18439  df-join 18440  df-meet 18441  df-p0 18517  df-p1 18518  df-lat 18526  df-clat 18593  df-oposet 40057  df-ol 40059  df-oml 40060  df-covers 40147  df-ats 40148  df-atl 40179  df-cvlat 40203  df-hlat 40232  df-llines 40379  df-lplanes 40380  df-lvols 40381  df-lines 40382  df-psubsp 40384  df-pmap 40385  df-padd 40677  df-lhyp 40869  df-laut 40870  df-ldil 40985  df-ltrn 40986  df-trl 41040

This theorem is used by:  cdlemg2ce  41473