Theorem dicelvalN 41685

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

Hypotheses

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

Assertion

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

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

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

Proof of Theorem dicelvalN

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

Step	Hyp	Ref	Expression
1		dicval.l	. . . 4 ⊢ ≤ = (le‘𝐾)
2		dicval.a	. . . 4 ⊢ 𝐴 = (Atoms‘𝐾)
3		dicval.h	. . . 4 ⊢ 𝐻 = (LHyp‘𝐾)
4		dicval.p	. . . 4 ⊢ 𝑃 = ((oc‘𝐾)‘𝑊)
5		dicval.t	. . . 4 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
6		dicval.e	. . . 4 ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)
7		dicval.i	. . . 4 ⊢ 𝐼 = ((DIsoC‘𝐾)‘𝑊)
8	1, 2, 3, 4, 5, 6, 7	dicval 41683	. . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝐼‘𝑄) = {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸)})
9	8	eleq2d 2827	. 2 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝑌 ∈ (𝐼‘𝑄) ↔ 𝑌 ∈ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸)}))
10		vex 3437	. . . . . 6 ⊢ 𝑓 ∈ V
11		vex 3437	. . . . . 6 ⊢ 𝑠 ∈ V
12	10, 11	op1std 7945	. . . . 5 ⊢ (𝑌 = ⟨𝑓, 𝑠⟩ → (1st ‘𝑌) = 𝑓)
13	10, 11	op2ndd 7946	. . . . . 6 ⊢ (𝑌 = ⟨𝑓, 𝑠⟩ → (2nd ‘𝑌) = 𝑠)
14	13	fveq1d 6833	. . . . 5 ⊢ (𝑌 = ⟨𝑓, 𝑠⟩ → ((2nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)))
15	12, 14	eqeq12d 2757	. . . 4 ⊢ (𝑌 = ⟨𝑓, 𝑠⟩ → ((1st ‘𝑌) = ((2nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ↔ 𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄))))
16	13	eleq1d 2826	. . . 4 ⊢ (𝑌 = ⟨𝑓, 𝑠⟩ → ((2nd ‘𝑌) ∈ 𝐸 ↔ 𝑠 ∈ 𝐸))
17	15, 16	anbi12d 639	. . 3 ⊢ (𝑌 = ⟨𝑓, 𝑠⟩ → (((1st ‘𝑌) = ((2nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ (2nd ‘𝑌) ∈ 𝐸) ↔ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸)))
18	17	elopaba 5754	. 2 ⊢ (𝑌 ∈ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸)} ↔ (𝑌 ∈ (V × V) ∧ ((1st ‘𝑌) = ((2nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ (2nd ‘𝑌) ∈ 𝐸)))
19	9, 18	bitrdi 289	1 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝑌 ∈ (𝐼‘𝑄) ↔ (𝑌 ∈ (V × V) ∧ ((1st ‘𝑌) = ((2nd ‘𝑌)‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ (2nd ‘𝑌) ∈ 𝐸))))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ∧ wa 397   = wceq 1548   ∈ wcel 2121  Vcvv 3433  ⟨cop 4564   class class class wbr 5075  {copab 5137   × cxp 5619  ‘cfv 6489  ℩crio 7316  1^st c1st 7933  2^nd c2nd 7934  lecple 17222  occoc 17223  Atomscatm 39770  LHypclh 40491  LTrncltrn 40608  TEndoctendo 41259  DIsoCcdic 41679

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-rep 5202  ax-sep 5221  ax-nul 5231  ax-pow 5297  ax-pr 5365  ax-un 7682

This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-nfc 2890  df-ne 2937  df-ral 3056  df-rex 3066  df-reu 3347  df-rab 3394  df-v 3435  df-sbc 3726  df-csb 3834  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-nul 4265  df-if 4458  df-pw 4534  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4842  df-iun 4926  df-br 5076  df-opab 5138  df-mpt 5157  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496  df-fv 6497  df-riota 7317  df-1st 7935  df-2nd 7936  df-dic 41680

This theorem is referenced by:  dicelval2N  41689