Theorem dicopelval 42425

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

Hypotheses

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

Assertion

Ref	Expression
dicopelval	⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (⟨𝐹, 𝑆⟩ ∈ (𝐼‘𝑄) ↔ (𝐹 = (𝑆‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑆 ∈ 𝐸)))

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

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

Proof of Theorem dicopelval

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 42424	. . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝐼‘𝑄) = {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸)})
9	8	eleq2d 2850	. 2 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (⟨𝐹, 𝑆⟩ ∈ (𝐼‘𝑄) ↔ ⟨𝐹, 𝑆⟩ ∈ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸)}))
10		dicelval.f	. . 3 ⊢ 𝐹 ∈ V
11		dicelval.s	. . 3 ⊢ 𝑆 ∈ V
12		eqeq1 2767	. . . 4 ⊢ (𝑓 = 𝐹 → (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ↔ 𝐹 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄))))
13	12	anbi1d 643	. . 3 ⊢ (𝑓 = 𝐹 → ((𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸) ↔ (𝐹 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸)))
14		fveq1 6904	. . . . 5 ⊢ (𝑠 = 𝑆 → (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) = (𝑆‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)))
15	14	eqeq2d 2774	. . . 4 ⊢ (𝑠 = 𝑆 → (𝐹 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ↔ 𝐹 = (𝑆‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄))))
16		eleq1 2852	. . . 4 ⊢ (𝑠 = 𝑆 → (𝑠 ∈ 𝐸 ↔ 𝑆 ∈ 𝐸))
17	15, 16	anbi12d 644	. . 3 ⊢ (𝑠 = 𝑆 → ((𝐹 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸) ↔ (𝐹 = (𝑆‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑆 ∈ 𝐸)))
18	10, 11, 13, 17	opelopab 5521	. 2 ⊢ (⟨𝐹, 𝑆⟩ ∈ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑠 ∈ 𝐸)} ↔ (𝐹 = (𝑆‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑆 ∈ 𝐸))
19	9, 18	bitrdi 290	1 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (⟨𝐹, 𝑆⟩ ∈ (𝐼‘𝑄) ↔ (𝐹 = (𝑆‘(℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)) ∧ 𝑆 ∈ 𝐸)))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454  ⟨cop 4838   class class class wbr 5106  {copab 5170  ‘cfv 6555  ℩crio 7396  lecple 17461  occoc 17462  Atomscatm 40511  LHypclh 41232  LTrncltrn 41349  TEndoctendo 42000  DIsoCcdic 42420

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-riota 7397  df-dic 42421

This theorem is used by:  dicopelval2  42429  dicvaddcl  42438  dicvscacl  42439  dicn0  42440