Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  dicelval3 Structured version   Visualization version   GIF version

Theorem dicelval3 42217
Description: Member of the partial isomorphism C. (Contributed by NM, 26-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‘𝐾)‘𝑊)
dicval2.g 𝐺 = (℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)
Assertion
Ref Expression
dicelval3 (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝑌 ∈ (𝐼‘𝑄) ↔ ∃𝑠 ∈ 𝐸 𝑌 = ⟨(𝑠‘𝐺), 𝑠⟩))
Distinct variable groups:   𝑔,𝑠,𝐾   𝑇,𝑔   𝑔,𝑊,𝑠   𝐸,𝑠   𝑄,𝑔,𝑠   𝑌,𝑠
Allowed substitution hints:   𝐴(𝑔, 𝑠)   𝑃(𝑔, 𝑠)   𝑇(𝑠)   𝐸(𝑔)   𝐺(𝑔, 𝑠)   𝐻(𝑔, 𝑠)   𝐼(𝑔, 𝑠)   ≤ (𝑔, 𝑠)   𝑉(𝑔, 𝑠)   𝑌(𝑔)

Proof of Theorem dicelval3
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef 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 dicval2.g . . . 4 𝐺 = (℩𝑔 ∈ 𝑇 (𝑔‘𝑃) = 𝑄)
91, 2, 3, 4, 5, 6, 7, 8dicval2 42216 . . 3 (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝐼‘𝑄) = {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘𝐺) ∧ 𝑠 ∈ 𝐸)})
109eleq2d 2847 . 2 (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝑌 ∈ (𝐼‘𝑄) ↔ 𝑌 ∈ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘𝐺) ∧ 𝑠 ∈ 𝐸)}))
11 excom 2199 . . . 4 (∃𝑓∃𝑠(𝑌 = ⟨𝑓, 𝑠⟩ ∧ (𝑓 = (𝑠‘𝐺) ∧ 𝑠 ∈ 𝐸)) ↔ ∃𝑠∃𝑓(𝑌 = ⟨𝑓, 𝑠⟩ ∧ (𝑓 = (𝑠‘𝐺) ∧ 𝑠 ∈ 𝐸)))
12 an12 658 . . . . . . 7 ((𝑌 = ⟨𝑓, 𝑠⟩ ∧ (𝑓 = (𝑠‘𝐺) ∧ 𝑠 ∈ 𝐸)) ↔ (𝑓 = (𝑠‘𝐺) ∧ (𝑌 = ⟨𝑓, 𝑠⟩ ∧ 𝑠 ∈ 𝐸)))
1312exbii 1881 . . . . . 6 (∃𝑓(𝑌 = ⟨𝑓, 𝑠⟩ ∧ (𝑓 = (𝑠‘𝐺) ∧ 𝑠 ∈ 𝐸)) ↔ ∃𝑓(𝑓 = (𝑠‘𝐺) ∧ (𝑌 = ⟨𝑓, 𝑠⟩ ∧ 𝑠 ∈ 𝐸)))
14 fvex 6896 . . . . . . 7 (𝑠‘𝐺) ∈ V
15 opeq1 4833 . . . . . . . . 9 (𝑓 = (𝑠‘𝐺) → ⟨𝑓, 𝑠⟩ = ⟨(𝑠‘𝐺), 𝑠⟩)
1615eqeq2d 2772 . . . . . . . 8 (𝑓 = (𝑠‘𝐺) → (𝑌 = ⟨𝑓, 𝑠⟩ ↔ 𝑌 = ⟨(𝑠‘𝐺), 𝑠⟩))
1716anbi1d 643 . . . . . . 7 (𝑓 = (𝑠‘𝐺) → ((𝑌 = ⟨𝑓, 𝑠⟩ ∧ 𝑠 ∈ 𝐸) ↔ (𝑌 = ⟨(𝑠‘𝐺), 𝑠⟩ ∧ 𝑠 ∈ 𝐸)))
1814, 17ceqsexv 3499 . . . . . 6 (∃𝑓(𝑓 = (𝑠‘𝐺) ∧ (𝑌 = ⟨𝑓, 𝑠⟩ ∧ 𝑠 ∈ 𝐸)) ↔ (𝑌 = ⟨(𝑠‘𝐺), 𝑠⟩ ∧ 𝑠 ∈ 𝐸))
19 ancom 466 . . . . . 6 ((𝑌 = ⟨(𝑠‘𝐺), 𝑠⟩ ∧ 𝑠 ∈ 𝐸) ↔ (𝑠 ∈ 𝐸 ∧ 𝑌 = ⟨(𝑠‘𝐺), 𝑠⟩))
2013, 18, 193bitri 300 . . . . 5 (∃𝑓(𝑌 = ⟨𝑓, 𝑠⟩ ∧ (𝑓 = (𝑠‘𝐺) ∧ 𝑠 ∈ 𝐸)) ↔ (𝑠 ∈ 𝐸 ∧ 𝑌 = ⟨(𝑠‘𝐺), 𝑠⟩))
2120exbii 1881 . . . 4 (∃𝑠∃𝑓(𝑌 = ⟨𝑓, 𝑠⟩ ∧ (𝑓 = (𝑠‘𝐺) ∧ 𝑠 ∈ 𝐸)) ↔ ∃𝑠(𝑠 ∈ 𝐸 ∧ 𝑌 = ⟨(𝑠‘𝐺), 𝑠⟩))
2211, 21bitri 278 . . 3 (∃𝑓∃𝑠(𝑌 = ⟨𝑓, 𝑠⟩ ∧ (𝑓 = (𝑠‘𝐺) ∧ 𝑠 ∈ 𝐸)) ↔ ∃𝑠(𝑠 ∈ 𝐸 ∧ 𝑌 = ⟨(𝑠‘𝐺), 𝑠⟩))
23 elopab 5501 . . 3 (𝑌 ∈ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘𝐺) ∧ 𝑠 ∈ 𝐸)} ↔ ∃𝑓∃𝑠(𝑌 = ⟨𝑓, 𝑠⟩ ∧ (𝑓 = (𝑠‘𝐺) ∧ 𝑠 ∈ 𝐸)))
24 df-rex 3088 . . 3 (∃𝑠 ∈ 𝐸 𝑌 = ⟨(𝑠‘𝐺), 𝑠⟩ ↔ ∃𝑠(𝑠 ∈ 𝐸 ∧ 𝑌 = ⟨(𝑠‘𝐺), 𝑠⟩))
2522, 23, 243bitr4i 306 . 2 (𝑌 ∈ {⟨𝑓, 𝑠⟩ ∣ (𝑓 = (𝑠‘𝐺) ∧ 𝑠 ∈ 𝐸)} ↔ ∃𝑠 ∈ 𝐸 𝑌 = ⟨(𝑠‘𝐺), 𝑠⟩)
2610, 25bitrdi 290 1 (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝑌 ∈ (𝐼‘𝑄) ↔ ∃𝑠 ∈ 𝐸 𝑌 = ⟨(𝑠‘𝐺), 𝑠⟩))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∃wrex 3087  ⟨cop 4590   class class class wbr 5103  {copab 5167  ‘cfv 6537  ℩crio 7374  lecple 17428  occoc 17429  Atomscatm 40300  LHypclh 41021  LTrncltrn 41138  TEndoctendo 41789  DIsoCcdic 42209
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 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  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 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7375  df-dic 42210
This theorem is used by:  cdlemn11pre  42247  dihord2pre  42262
  Copyright terms: Public domain W3C validator