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

Theorem cdleme27b 41693
Description: Lemma for cdleme27N 41694. (Contributed by NM, 3-Feb-2013.)
Hypotheses
Ref Expression
cdleme26.b 𝐵 = (Base‘𝐾)
cdleme26.l ≤ = (le‘𝐾)
cdleme26.j ∨ = (join‘𝐾)
cdleme26.m ∧ = (meet‘𝐾)
cdleme26.a 𝐴 = (Atoms‘𝐾)
cdleme26.h 𝐻 = (LHyp‘𝐾)
cdleme27.u 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
cdleme27.f 𝐹 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊)))
cdleme27.z 𝑍 = ((𝑧 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑧) ∧ 𝑊)))
cdleme27.n 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝑍 ∨ ((𝑠 ∨ 𝑧) ∧ 𝑊)))
cdleme27.d 𝐷 = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁))
cdleme27.c 𝐶 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐷, 𝐹)
cdleme27.g 𝐺 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊)))
cdleme27.o 𝑂 = ((𝑃 ∨ 𝑄) ∧ (𝑍 ∨ ((𝑡 ∨ 𝑧) ∧ 𝑊)))
cdleme27.e 𝐸 = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑂))
cdleme27.y 𝑌 = if(𝑡 ≤ (𝑃 ∨ 𝑄), 𝐸, 𝐺)
Assertion
Ref Expression
cdleme27b (𝑠 = 𝑡 → 𝐶 = 𝑌)
Distinct variable groups:   𝑡,𝑠,𝑢,𝑧,𝐴   𝐵,𝑠,𝑡,𝑢,𝑧   𝑢,𝐹   𝑢,𝐺   𝐻,𝑠,𝑡,𝑧   ∨ ,𝑠,𝑡,𝑢,𝑧   𝐾,𝑠,𝑡,𝑧   ≤ ,𝑠,𝑡,𝑢,𝑧   ∧ ,𝑠,𝑡,𝑢,𝑧   𝑡,𝑁,𝑢   𝑂,𝑠,𝑢   𝑃,𝑠,𝑡,𝑢,𝑧   𝑄,𝑠,𝑡,𝑢,𝑧   𝑈,𝑠,𝑡,𝑢,𝑧   𝑊,𝑠,𝑡,𝑢,𝑧
Allowed substitution hints:   𝐶(𝑧, 𝑢, 𝑡, 𝑠)   𝐷(𝑧, 𝑢, 𝑡, 𝑠)   𝐸(𝑧, 𝑢, 𝑡, 𝑠)   𝐹(𝑧, 𝑡, 𝑠)   𝐺(𝑧, 𝑡, 𝑠)   𝐻(𝑢)   𝐾(𝑢)   𝑁(𝑧, 𝑠)   𝑂(𝑧, 𝑡)   𝑌(𝑧, 𝑢, 𝑡, 𝑠)   𝑍(𝑧, 𝑢, 𝑡, 𝑠)

Proof of Theorem cdleme27b
StepHypRef Expression
1 breq1 5110 . . 3 (𝑠 = 𝑡 → (𝑠 ≤ (𝑃 ∨ 𝑄) ↔ 𝑡 ≤ (𝑃 ∨ 𝑄)))
2 oveq1 7457 . . . . . . . . . . . 12 (𝑠 = 𝑡 → (𝑠 ∨ 𝑧) = (𝑡 ∨ 𝑧))
32oveq1d 7465 . . . . . . . . . . 11 (𝑠 = 𝑡 → ((𝑠 ∨ 𝑧) ∧ 𝑊) = ((𝑡 ∨ 𝑧) ∧ 𝑊))
43oveq2d 7466 . . . . . . . . . 10 (𝑠 = 𝑡 → (𝑍 ∨ ((𝑠 ∨ 𝑧) ∧ 𝑊)) = (𝑍 ∨ ((𝑡 ∨ 𝑧) ∧ 𝑊)))
54oveq2d 7466 . . . . . . . . 9 (𝑠 = 𝑡 → ((𝑃 ∨ 𝑄) ∧ (𝑍 ∨ ((𝑠 ∨ 𝑧) ∧ 𝑊))) = ((𝑃 ∨ 𝑄) ∧ (𝑍 ∨ ((𝑡 ∨ 𝑧) ∧ 𝑊))))
6 cdleme27.n . . . . . . . . 9 𝑁 = ((𝑃 ∨ 𝑄) ∧ (𝑍 ∨ ((𝑠 ∨ 𝑧) ∧ 𝑊)))
7 cdleme27.o . . . . . . . . 9 𝑂 = ((𝑃 ∨ 𝑄) ∧ (𝑍 ∨ ((𝑡 ∨ 𝑧) ∧ 𝑊)))
85, 6, 73eqtr4g 2826 . . . . . . . 8 (𝑠 = 𝑡 → 𝑁 = 𝑂)
98eqeq2d 2777 . . . . . . 7 (𝑠 = 𝑡 → (𝑢 = 𝑁 ↔ 𝑢 = 𝑂))
109imbi2d 343 . . . . . 6 (𝑠 = 𝑡 → (((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁) ↔ ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑂)))
1110ralbidv 3192 . . . . 5 (𝑠 = 𝑡 → (∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁) ↔ ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑂)))
1211riotabidv 7409 . . . 4 (𝑠 = 𝑡 → (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁)) = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑂)))
13 cdleme27.d . . . 4 𝐷 = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑁))
14 cdleme27.e . . . 4 𝐸 = (℩𝑢 ∈ 𝐵 ∀𝑧 ∈ 𝐴 ((¬ 𝑧 ≤ 𝑊 ∧ ¬ 𝑧 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝑂))
1512, 13, 143eqtr4g 2826 . . 3 (𝑠 = 𝑡 → 𝐷 = 𝐸)
16 oveq1 7457 . . . . 5 (𝑠 = 𝑡 → (𝑠 ∨ 𝑈) = (𝑡 ∨ 𝑈))
17 oveq2 7458 . . . . . . 7 (𝑠 = 𝑡 → (𝑃 ∨ 𝑠) = (𝑃 ∨ 𝑡))
1817oveq1d 7465 . . . . . 6 (𝑠 = 𝑡 → ((𝑃 ∨ 𝑠) ∧ 𝑊) = ((𝑃 ∨ 𝑡) ∧ 𝑊))
1918oveq2d 7466 . . . . 5 (𝑠 = 𝑡 → (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊)) = (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊)))
2016, 19oveq12d 7468 . . . 4 (𝑠 = 𝑡 → ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊))) = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))))
21 cdleme27.f . . . 4 𝐹 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊)))
22 cdleme27.g . . . 4 𝐺 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊)))
2320, 21, 223eqtr4g 2826 . . 3 (𝑠 = 𝑡 → 𝐹 = 𝐺)
241, 15, 23ifbieq12d 4513 . 2 (𝑠 = 𝑡 → if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐷, 𝐹) = if(𝑡 ≤ (𝑃 ∨ 𝑄), 𝐸, 𝐺))
25 cdleme27.c . 2 𝐶 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐷, 𝐹)
26 cdleme27.y . 2 𝑌 = if(𝑡 ≤ (𝑃 ∨ 𝑄), 𝐸, 𝐺)
2724, 25, 263eqtr4g 2826 1 (𝑠 = 𝑡 → 𝐶 = 𝑌)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1572  ∀wral 3083  ifcif 4484   class class class wbr 5107  ‘cfv 6565  ℩crio 7406  (class class class)co 7450  Basecbs 17433  lecple 17481  joincjn 18537  meetcmee 18538  Atomscatm 40588  LHypclh 41309
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-ext 2738
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-sb 2104  df-clab 2745  df-cleq 2758  df-clel 2842  df-ral 3084  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-br 5108  df-iota 6519  df-fv 6573  df-riota 7407  df-ov 7453
This theorem is used by:  cdleme27N  41694  cdleme28c  41697
  Copyright terms: Public domain W3C validator