Theorem dicelval1sta 42381

Description: Membership in value of the partial isomorphism C for a lattice 𝐾. (Contributed by NM, 16-Feb-2014.)

Hypotheses

Ref	Expression
dicelval1sta.l	⊢ ≤ = (le‘𝐾)
dicelval1sta.a	⊢ 𝐴 = (Atoms‘𝐾)
dicelval1sta.h	⊢ 𝐻 = (LHyp‘𝐾)
dicelval1sta.p	⊢ 𝑃 = ((oc‘𝐾)‘𝑊)
dicelval1sta.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
dicelval1sta.i	⊢ 𝐼 = ((DIsoC‘𝐾)‘𝑊)

Assertion

Ref	Expression
dicelval1sta	⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑌 ∈ (𝐼‘𝑄)) → (1st ‘𝑌) = ((2nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)))

Distinct variable groups:   𝑔,𝐾   𝑄,𝑔   𝑇,𝑔   𝑔,𝑊

Allowed substitution hints:   𝐴(𝑔)   𝑃(𝑔)   𝐻(𝑔)   𝐼(𝑔)   ≤ (𝑔)   𝑉(𝑔)   𝑌(𝑔)

Proof of Theorem dicelval1sta

Dummy variables 𝑓 𝑠 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		dicelval1sta.l	. . . . . 6 ⊢ ≤ = (le‘𝐾)
2		dicelval1sta.a	. . . . . 6 ⊢ 𝐴 = (Atoms‘𝐾)
3		dicelval1sta.h	. . . . . 6 ⊢ 𝐻 = (LHyp‘𝐾)
4		dicelval1sta.p	. . . . . 6 ⊢ 𝑃 = ((oc‘𝐾)‘𝑊)
5		dicelval1sta.t	. . . . . 6 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
6		eqid 2760	. . . . . 6 ⊢ ((TEndo‘𝐾)‘𝑊) = ((TEndo‘𝐾)‘𝑊)
7		dicelval1sta.i	. . . . . 6 ⊢ 𝐼 = ((DIsoC‘𝐾)‘𝑊)
8	1, 2, 3, 4, 5, 6, 7	dicval 42370	. . . . 5 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝐼‘𝑄) = {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊))})
9	8	eleq2d 2846	. . . 4 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝑌 ∈ (𝐼‘𝑄) ↔ 𝑌 ∈ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊))}))
10	9	biimp3a 1498	. . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑌 ∈ (𝐼‘𝑄)) → 𝑌 ∈ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊))})
11		eqeq1 2764	. . . . 5 ⊢ (𝑓 = (1st ‘𝑌) → (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ↔ (1st ‘𝑌) = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄))))
12	11	anbi1d 643	. . . 4 ⊢ (𝑓 = (1st ‘𝑌) → ((𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊)) ↔ ((1st ‘𝑌) = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊))))
13		fveq1 6889	. . . . . 6 ⊢ (𝑠 = (2nd ‘𝑌) → (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) = ((2nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)))
14	13	eqeq2d 2771	. . . . 5 ⊢ (𝑠 = (2nd ‘𝑌) → ((1st ‘𝑌) = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ↔ (1st ‘𝑌) = ((2nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄))))
15		eleq1 2848	. . . . 5 ⊢ (𝑠 = (2nd ‘𝑌) → (𝑠 ∈ ((TEndo‘𝐾)‘𝑊) ↔ (2nd ‘𝑌) ∈ ((TEndo‘𝐾)‘𝑊)))
16	14, 15	anbi12d 644	. . . 4 ⊢ (𝑠 = (2nd ‘𝑌) → (((1st ‘𝑌) = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊)) ↔ ((1st ‘𝑌) = ((2nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ (2nd ‘𝑌) ∈ ((TEndo‘𝐾)‘𝑊))))
17	12, 16	elopabi 8078	. . 3 ⊢ (𝑌 ∈ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ ((TEndo‘𝐾)‘𝑊))} → ((1st ‘𝑌) = ((2nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ (2nd ‘𝑌) ∈ ((TEndo‘𝐾)‘𝑊)))
18	10, 17	syl 18	. 2 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑌 ∈ (𝐼‘𝑄)) → ((1st ‘𝑌) = ((2nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ (2nd ‘𝑌) ∈ ((TEndo‘𝐾)‘𝑊)))
19	18	simpld 500	1 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑌 ∈ (𝐼‘𝑄)) → (1st ‘𝑌) = ((2nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144   class class class wbr 5102  {copab 5166  ‘cfv 6543  ℩crio 7380  1^st c1st 8003  2^nd c2nd 8004  lecple 17444  occoc 17445  Atomscatm 40457  LHypclh 41178  LTrncltrn 41295  TEndoctendo 41946  DIsoCcdic 42366

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5327  ax-pr 5391  ax-un 7755

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7381  df-1st 8005  df-2nd 8006  df-dic 42367

This theorem is used by:  dicvaddcl  42384  dicvscacl  42385