![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ralprgf | Structured version Visualization version GIF version |
Description: Convert a restricted universal quantification over a pair to a conjunction, using bound-variable hypotheses instead of distinct variable conditions. (Contributed by NM, 17-Sep-2011.) (Revised by AV, 8-Apr-2023.) |
Ref | Expression |
---|---|
ralprgf.1 | ⊢ Ⅎ𝑥𝜓 |
ralprgf.2 | ⊢ Ⅎ𝑥𝜒 |
ralprgf.a | ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) |
ralprgf.b | ⊢ (𝑥 = 𝐵 → (𝜑 ↔ 𝜒)) |
Ref | Expression |
---|---|
ralprgf | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∀𝑥 ∈ {𝐴, 𝐵}𝜑 ↔ (𝜓 ∧ 𝜒))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-pr 4528 | . . . 4 ⊢ {𝐴, 𝐵} = ({𝐴} ∪ {𝐵}) | |
2 | 1 | raleqi 3362 | . . 3 ⊢ (∀𝑥 ∈ {𝐴, 𝐵}𝜑 ↔ ∀𝑥 ∈ ({𝐴} ∪ {𝐵})𝜑) |
3 | ralunb 4118 | . . 3 ⊢ (∀𝑥 ∈ ({𝐴} ∪ {𝐵})𝜑 ↔ (∀𝑥 ∈ {𝐴}𝜑 ∧ ∀𝑥 ∈ {𝐵}𝜑)) | |
4 | 2, 3 | bitri 278 | . 2 ⊢ (∀𝑥 ∈ {𝐴, 𝐵}𝜑 ↔ (∀𝑥 ∈ {𝐴}𝜑 ∧ ∀𝑥 ∈ {𝐵}𝜑)) |
5 | ralprgf.1 | . . . 4 ⊢ Ⅎ𝑥𝜓 | |
6 | ralprgf.a | . . . 4 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) | |
7 | 5, 6 | ralsngf 4571 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (∀𝑥 ∈ {𝐴}𝜑 ↔ 𝜓)) |
8 | ralprgf.2 | . . . 4 ⊢ Ⅎ𝑥𝜒 | |
9 | ralprgf.b | . . . 4 ⊢ (𝑥 = 𝐵 → (𝜑 ↔ 𝜒)) | |
10 | 8, 9 | ralsngf 4571 | . . 3 ⊢ (𝐵 ∈ 𝑊 → (∀𝑥 ∈ {𝐵}𝜑 ↔ 𝜒)) |
11 | 7, 10 | bi2anan9 638 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((∀𝑥 ∈ {𝐴}𝜑 ∧ ∀𝑥 ∈ {𝐵}𝜑) ↔ (𝜓 ∧ 𝜒))) |
12 | 4, 11 | syl5bb 286 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∀𝑥 ∈ {𝐴, 𝐵}𝜑 ↔ (𝜓 ∧ 𝜒))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1538 Ⅎwnf 1785 ∈ wcel 2111 ∀wral 3106 ∪ cun 3879 {csn 4525 {cpr 4527 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-12 2175 ax-ext 2770 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-ex 1782 df-nf 1786 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-ral 3111 df-v 3443 df-sbc 3721 df-un 3886 df-sn 4526 df-pr 4528 |
This theorem is referenced by: ralprg 4592 |
Copyright terms: Public domain | W3C validator |