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

Theorem supeq3 7056
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 4035 . . . . . . 7 (𝑅 = 𝑆 → (𝑥𝑅𝑦𝑥𝑆𝑦))
21notbid 668 . . . . . 6 (𝑅 = 𝑆 → (¬ 𝑥𝑅𝑦 ↔ ¬ 𝑥𝑆𝑦))
32ralbidv 2497 . . . . 5 (𝑅 = 𝑆 → (∀𝑦𝐴 ¬ 𝑥𝑅𝑦 ↔ ∀𝑦𝐴 ¬ 𝑥𝑆𝑦))
4 breq 4035 . . . . . . 7 (𝑅 = 𝑆 → (𝑦𝑅𝑥𝑦𝑆𝑥))
5 breq 4035 . . . . . . . 8 (𝑅 = 𝑆 → (𝑦𝑅𝑧𝑦𝑆𝑧))
65rexbidv 2498 . . . . . . 7 (𝑅 = 𝑆 → (∃𝑧𝐴 𝑦𝑅𝑧 ↔ ∃𝑧𝐴 𝑦𝑆𝑧))
74, 6imbi12d 234 . . . . . 6 (𝑅 = 𝑆 → ((𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧) ↔ (𝑦𝑆𝑥 → ∃𝑧𝐴 𝑦𝑆𝑧)))
87ralbidv 2497 . . . . 5 (𝑅 = 𝑆 → (∀𝑦𝐵 (𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧) ↔ ∀𝑦𝐵 (𝑦𝑆𝑥 → ∃𝑧𝐴 𝑦𝑆𝑧)))
93, 8anbi12d 473 . . . 4 (𝑅 = 𝑆 → ((∀𝑦𝐴 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐵 (𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧)) ↔ (∀𝑦𝐴 ¬ 𝑥𝑆𝑦 ∧ ∀𝑦𝐵 (𝑦𝑆𝑥 → ∃𝑧𝐴 𝑦𝑆𝑧))))
109rabbidv 2752 . . 3 (𝑅 = 𝑆 → {𝑥𝐵 ∣ (∀𝑦𝐴 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐵 (𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧))} = {𝑥𝐵 ∣ (∀𝑦𝐴 ¬ 𝑥𝑆𝑦 ∧ ∀𝑦𝐵 (𝑦𝑆𝑥 → ∃𝑧𝐴 𝑦𝑆𝑧))})
1110unieqd 3850 . 2 (𝑅 = 𝑆 {𝑥𝐵 ∣ (∀𝑦𝐴 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐵 (𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧))} = {𝑥𝐵 ∣ (∀𝑦𝐴 ¬ 𝑥𝑆𝑦 ∧ ∀𝑦𝐵 (𝑦𝑆𝑥 → ∃𝑧𝐴 𝑦𝑆𝑧))})
12 df-sup 7050 . 2 sup(𝐴, 𝐵, 𝑅) = {𝑥𝐵 ∣ (∀𝑦𝐴 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐵 (𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧))}
13 df-sup 7050 . 2 sup(𝐴, 𝐵, 𝑆) = {𝑥𝐵 ∣ (∀𝑦𝐴 ¬ 𝑥𝑆𝑦 ∧ ∀𝑦𝐵 (𝑦𝑆𝑥 → ∃𝑧𝐴 𝑦𝑆𝑧))}
1411, 12, 133eqtr4g 2254 1 (𝑅 = 𝑆 → sup(𝐴, 𝐵, 𝑅) = sup(𝐴, 𝐵, 𝑆))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104   = wceq 1364  wral 2475  wrex 2476  {crab 2479   cuni 3839   class class class wbr 4033  supcsup 7048
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-ext 2178
This theorem depends on definitions:  df-bi 117  df-tru 1367  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-rab 2484  df-uni 3840  df-br 4034  df-sup 7050
This theorem is referenced by:  infeq3  7081
  Copyright terms: Public domain W3C validator