Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > raltpg | GIF version |
Description: Convert a quantification over a triple to a conjunction. (Contributed by NM, 17-Sep-2011.) (Revised by Mario Carneiro, 23-Apr-2015.) |
Ref | Expression |
---|---|
ralprg.1 | ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) |
ralprg.2 | ⊢ (𝑥 = 𝐵 → (𝜑 ↔ 𝜒)) |
raltpg.3 | ⊢ (𝑥 = 𝐶 → (𝜑 ↔ 𝜃)) |
Ref | Expression |
---|---|
raltpg | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (∀𝑥 ∈ {𝐴, 𝐵, 𝐶}𝜑 ↔ (𝜓 ∧ 𝜒 ∧ 𝜃))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ralprg.1 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) | |
2 | ralprg.2 | . . . . 5 ⊢ (𝑥 = 𝐵 → (𝜑 ↔ 𝜒)) | |
3 | 1, 2 | ralprg 3574 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∀𝑥 ∈ {𝐴, 𝐵}𝜑 ↔ (𝜓 ∧ 𝜒))) |
4 | raltpg.3 | . . . . 5 ⊢ (𝑥 = 𝐶 → (𝜑 ↔ 𝜃)) | |
5 | 4 | ralsng 3564 | . . . 4 ⊢ (𝐶 ∈ 𝑋 → (∀𝑥 ∈ {𝐶}𝜑 ↔ 𝜃)) |
6 | 3, 5 | bi2anan9 595 | . . 3 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ 𝐶 ∈ 𝑋) → ((∀𝑥 ∈ {𝐴, 𝐵}𝜑 ∧ ∀𝑥 ∈ {𝐶}𝜑) ↔ ((𝜓 ∧ 𝜒) ∧ 𝜃))) |
7 | 6 | 3impa 1176 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → ((∀𝑥 ∈ {𝐴, 𝐵}𝜑 ∧ ∀𝑥 ∈ {𝐶}𝜑) ↔ ((𝜓 ∧ 𝜒) ∧ 𝜃))) |
8 | df-tp 3535 | . . . 4 ⊢ {𝐴, 𝐵, 𝐶} = ({𝐴, 𝐵} ∪ {𝐶}) | |
9 | 8 | raleqi 2630 | . . 3 ⊢ (∀𝑥 ∈ {𝐴, 𝐵, 𝐶}𝜑 ↔ ∀𝑥 ∈ ({𝐴, 𝐵} ∪ {𝐶})𝜑) |
10 | ralunb 3257 | . . 3 ⊢ (∀𝑥 ∈ ({𝐴, 𝐵} ∪ {𝐶})𝜑 ↔ (∀𝑥 ∈ {𝐴, 𝐵}𝜑 ∧ ∀𝑥 ∈ {𝐶}𝜑)) | |
11 | 9, 10 | bitri 183 | . 2 ⊢ (∀𝑥 ∈ {𝐴, 𝐵, 𝐶}𝜑 ↔ (∀𝑥 ∈ {𝐴, 𝐵}𝜑 ∧ ∀𝑥 ∈ {𝐶}𝜑)) |
12 | df-3an 964 | . 2 ⊢ ((𝜓 ∧ 𝜒 ∧ 𝜃) ↔ ((𝜓 ∧ 𝜒) ∧ 𝜃)) | |
13 | 7, 11, 12 | 3bitr4g 222 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (∀𝑥 ∈ {𝐴, 𝐵, 𝐶}𝜑 ↔ (𝜓 ∧ 𝜒 ∧ 𝜃))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 ∧ w3a 962 = wceq 1331 ∈ wcel 1480 ∀wral 2416 ∪ cun 3069 {csn 3527 {cpr 3528 {ctp 3529 |
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-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-nf 1437 df-sb 1736 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ral 2421 df-v 2688 df-sbc 2910 df-un 3075 df-sn 3533 df-pr 3534 df-tp 3535 |
This theorem is referenced by: raltp 3580 sumtp 11183 |
Copyright terms: Public domain | W3C validator |