ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  supeq3 GIF version

Theorem supeq3 6955
Description: Equality theorem for supremum. (Contributed by Scott Fenton, 13-Jun-2018.)
Assertion
Ref Expression
supeq3 (𝑅 = 𝑆 → sup(𝐴, 𝐵, 𝑅) = sup(𝐴, 𝐵, 𝑆))

Proof of Theorem supeq3
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 breq 3984 . . . . . . 7 (𝑅 = 𝑆 → (𝑥𝑅𝑦𝑥𝑆𝑦))
21notbid 657 . . . . . 6 (𝑅 = 𝑆 → (¬ 𝑥𝑅𝑦 ↔ ¬ 𝑥𝑆𝑦))
32ralbidv 2466 . . . . 5 (𝑅 = 𝑆 → (∀𝑦𝐴 ¬ 𝑥𝑅𝑦 ↔ ∀𝑦𝐴 ¬ 𝑥𝑆𝑦))
4 breq 3984 . . . . . . 7 (𝑅 = 𝑆 → (𝑦𝑅𝑥𝑦𝑆𝑥))
5 breq 3984 . . . . . . . 8 (𝑅 = 𝑆 → (𝑦𝑅𝑧𝑦𝑆𝑧))
65rexbidv 2467 . . . . . . 7 (𝑅 = 𝑆 → (∃𝑧𝐴 𝑦𝑅𝑧 ↔ ∃𝑧𝐴 𝑦𝑆𝑧))
74, 6imbi12d 233 . . . . . 6 (𝑅 = 𝑆 → ((𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧) ↔ (𝑦𝑆𝑥 → ∃𝑧𝐴 𝑦𝑆𝑧)))
87ralbidv 2466 . . . . 5 (𝑅 = 𝑆 → (∀𝑦𝐵 (𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧) ↔ ∀𝑦𝐵 (𝑦𝑆𝑥 → ∃𝑧𝐴 𝑦𝑆𝑧)))
93, 8anbi12d 465 . . . 4 (𝑅 = 𝑆 → ((∀𝑦𝐴 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐵 (𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧)) ↔ (∀𝑦𝐴 ¬ 𝑥𝑆𝑦 ∧ ∀𝑦𝐵 (𝑦𝑆𝑥 → ∃𝑧𝐴 𝑦𝑆𝑧))))
109rabbidv 2715 . . 3 (𝑅 = 𝑆 → {𝑥𝐵 ∣ (∀𝑦𝐴 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐵 (𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧))} = {𝑥𝐵 ∣ (∀𝑦𝐴 ¬ 𝑥𝑆𝑦 ∧ ∀𝑦𝐵 (𝑦𝑆𝑥 → ∃𝑧𝐴 𝑦𝑆𝑧))})
1110unieqd 3800 . 2 (𝑅 = 𝑆 {𝑥𝐵 ∣ (∀𝑦𝐴 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐵 (𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧))} = {𝑥𝐵 ∣ (∀𝑦𝐴 ¬ 𝑥𝑆𝑦 ∧ ∀𝑦𝐵 (𝑦𝑆𝑥 → ∃𝑧𝐴 𝑦𝑆𝑧))})
12 df-sup 6949 . 2 sup(𝐴, 𝐵, 𝑅) = {𝑥𝐵 ∣ (∀𝑦𝐴 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐵 (𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧))}
13 df-sup 6949 . 2 sup(𝐴, 𝐵, 𝑆) = {𝑥𝐵 ∣ (∀𝑦𝐴 ¬ 𝑥𝑆𝑦 ∧ ∀𝑦𝐵 (𝑦𝑆𝑥 → ∃𝑧𝐴 𝑦𝑆𝑧))}
1411, 12, 133eqtr4g 2224 1 (𝑅 = 𝑆 → sup(𝐴, 𝐵, 𝑅) = sup(𝐴, 𝐵, 𝑆))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 103   = wceq 1343  wral 2444  wrex 2445  {crab 2448   cuni 3789   class class class wbr 3982  supcsup 6947
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147
This theorem depends on definitions:  df-bi 116  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-rab 2453  df-uni 3790  df-br 3983  df-sup 6949
This theorem is referenced by:  infeq3  6980
  Copyright terms: Public domain W3C validator