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

Theorem supeq3 6462
 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 3795 . . . . . . 7 (𝑅 = 𝑆 → (𝑥𝑅𝑦𝑥𝑆𝑦))
21notbid 625 . . . . . 6 (𝑅 = 𝑆 → (¬ 𝑥𝑅𝑦 ↔ ¬ 𝑥𝑆𝑦))
32ralbidv 2369 . . . . 5 (𝑅 = 𝑆 → (∀𝑦𝐴 ¬ 𝑥𝑅𝑦 ↔ ∀𝑦𝐴 ¬ 𝑥𝑆𝑦))
4 breq 3795 . . . . . . 7 (𝑅 = 𝑆 → (𝑦𝑅𝑥𝑦𝑆𝑥))
5 breq 3795 . . . . . . . 8 (𝑅 = 𝑆 → (𝑦𝑅𝑧𝑦𝑆𝑧))
65rexbidv 2370 . . . . . . 7 (𝑅 = 𝑆 → (∃𝑧𝐴 𝑦𝑅𝑧 ↔ ∃𝑧𝐴 𝑦𝑆𝑧))
74, 6imbi12d 232 . . . . . 6 (𝑅 = 𝑆 → ((𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧) ↔ (𝑦𝑆𝑥 → ∃𝑧𝐴 𝑦𝑆𝑧)))
87ralbidv 2369 . . . . 5 (𝑅 = 𝑆 → (∀𝑦𝐵 (𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧) ↔ ∀𝑦𝐵 (𝑦𝑆𝑥 → ∃𝑧𝐴 𝑦𝑆𝑧)))
93, 8anbi12d 457 . . . 4 (𝑅 = 𝑆 → ((∀𝑦𝐴 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐵 (𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧)) ↔ (∀𝑦𝐴 ¬ 𝑥𝑆𝑦 ∧ ∀𝑦𝐵 (𝑦𝑆𝑥 → ∃𝑧𝐴 𝑦𝑆𝑧))))
109rabbidv 2594 . . 3 (𝑅 = 𝑆 → {𝑥𝐵 ∣ (∀𝑦𝐴 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐵 (𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧))} = {𝑥𝐵 ∣ (∀𝑦𝐴 ¬ 𝑥𝑆𝑦 ∧ ∀𝑦𝐵 (𝑦𝑆𝑥 → ∃𝑧𝐴 𝑦𝑆𝑧))})
1110unieqd 3620 . 2 (𝑅 = 𝑆 {𝑥𝐵 ∣ (∀𝑦𝐴 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐵 (𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧))} = {𝑥𝐵 ∣ (∀𝑦𝐴 ¬ 𝑥𝑆𝑦 ∧ ∀𝑦𝐵 (𝑦𝑆𝑥 → ∃𝑧𝐴 𝑦𝑆𝑧))})
12 df-sup 6456 . 2 sup(𝐴, 𝐵, 𝑅) = {𝑥𝐵 ∣ (∀𝑦𝐴 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦𝐵 (𝑦𝑅𝑥 → ∃𝑧𝐴 𝑦𝑅𝑧))}
13 df-sup 6456 . 2 sup(𝐴, 𝐵, 𝑆) = {𝑥𝐵 ∣ (∀𝑦𝐴 ¬ 𝑥𝑆𝑦 ∧ ∀𝑦𝐵 (𝑦𝑆𝑥 → ∃𝑧𝐴 𝑦𝑆𝑧))}
1411, 12, 133eqtr4g 2139 1 (𝑅 = 𝑆 → sup(𝐴, 𝐵, 𝑅) = sup(𝐴, 𝐵, 𝑆))
 Colors of variables: wff set class Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 102   = wceq 1285  ∀wral 2349  ∃wrex 2350  {crab 2353  ∪ cuni 3609   class class class wbr 3793  supcsup 6454 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 577  ax-in2 578  ax-io 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2064 This theorem depends on definitions:  df-bi 115  df-tru 1288  df-nf 1391  df-sb 1687  df-clab 2069  df-cleq 2075  df-clel 2078  df-nfc 2209  df-ral 2354  df-rex 2355  df-rab 2358  df-uni 3610  df-br 3794  df-sup 6456 This theorem is referenced by:  infeq3  6487
 Copyright terms: Public domain W3C validator