![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > 3exbii | Structured version Visualization version GIF version |
Description: Inference adding three existential quantifiers to both sides of an equivalence. (Contributed by NM, 2-May-1995.) |
Ref | Expression |
---|---|
3exbii.1 | ⊢ (𝜑 ↔ 𝜓) |
Ref | Expression |
---|---|
3exbii | ⊢ (∃𝑥∃𝑦∃𝑧𝜑 ↔ ∃𝑥∃𝑦∃𝑧𝜓) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 3exbii.1 | . . 3 ⊢ (𝜑 ↔ 𝜓) | |
2 | 1 | exbii 1849 | . 2 ⊢ (∃𝑧𝜑 ↔ ∃𝑧𝜓) |
3 | 2 | 2exbii 1850 | 1 ⊢ (∃𝑥∃𝑦∃𝑧𝜑 ↔ ∃𝑥∃𝑦∃𝑧𝜓) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 209 ∃wex 1781 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 |
This theorem depends on definitions: df-bi 210 df-ex 1782 |
This theorem is referenced by: 4exdistr 1963 ceqsex6v 3495 oprabidw 7166 oprabid 7167 dfoprab2 7191 dftpos3 7893 xpassen 8594 bnj916 32315 bnj917 32316 bnj983 32333 bnj996 32338 bnj1021 32348 bnj1033 32351 ellines 33726 rnxrn 35806 ichexmpl1 43986 |
Copyright terms: Public domain | W3C validator |