![]() |
Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > rp-unirabeq | Structured version Visualization version GIF version |
Description: Equality theorem for infimum of non-empty classes of ordinals. (Contributed by RP, 23-Jan-2025.) |
Ref | Expression |
---|---|
rp-unirabeq | ⊢ (𝐴 = 𝐵 → ∪ {𝑥 ∈ On ∣ ∀𝑦 ∈ 𝐴 𝑥 ⊆ 𝑦} = ∪ {𝑥 ∈ On ∣ ∀𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | raleq 3316 | . . 3 ⊢ (𝐴 = 𝐵 → (∀𝑦 ∈ 𝐴 𝑥 ⊆ 𝑦 ↔ ∀𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦)) | |
2 | 1 | rabbidv 3434 | . 2 ⊢ (𝐴 = 𝐵 → {𝑥 ∈ On ∣ ∀𝑦 ∈ 𝐴 𝑥 ⊆ 𝑦} = {𝑥 ∈ On ∣ ∀𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦}) |
3 | 2 | unieqd 4915 | 1 ⊢ (𝐴 = 𝐵 → ∪ {𝑥 ∈ On ∣ ∀𝑦 ∈ 𝐴 𝑥 ⊆ 𝑦} = ∪ {𝑥 ∈ On ∣ ∀𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1533 ∀wral 3055 {crab 3426 ⊆ wss 3943 ∪ cuni 4902 Oncon0 6358 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-ext 2697 |
This theorem depends on definitions: df-bi 206 df-an 396 df-tru 1536 df-ex 1774 df-sb 2060 df-clab 2704 df-cleq 2718 df-clel 2804 df-ral 3056 df-rex 3065 df-rab 3427 df-v 3470 df-in 3950 df-ss 3960 df-uni 4903 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |