![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > exbid | Structured version Visualization version GIF version |
Description: Formula-building rule for existential quantifier (deduction form). (Contributed by Mario Carneiro, 24-Sep-2016.) |
Ref | Expression |
---|---|
albid.1 | ⊢ Ⅎ𝑥𝜑 |
albid.2 | ⊢ (𝜑 → (𝜓 ↔ 𝜒)) |
Ref | Expression |
---|---|
exbid | ⊢ (𝜑 → (∃𝑥𝜓 ↔ ∃𝑥𝜒)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | albid.1 | . . 3 ⊢ Ⅎ𝑥𝜑 | |
2 | 1 | nf5ri 2196 | . 2 ⊢ (𝜑 → ∀𝑥𝜑) |
3 | albid.2 | . 2 ⊢ (𝜑 → (𝜓 ↔ 𝜒)) | |
4 | 2, 3 | exbidh 1866 | 1 ⊢ (𝜑 → (∃𝑥𝜓 ↔ ∃𝑥𝜒)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∃wex 1777 Ⅎwnf 1781 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-12 2178 |
This theorem depends on definitions: df-bi 207 df-ex 1778 df-nf 1782 |
This theorem is referenced by: nfbidf 2225 drex2 2450 rexbida 3278 rexeqfOLD 3363 opabbid 5231 zfrepclf 5312 dfid3 5596 oprabbid 7515 axrepndlem1 10661 axrepndlem2 10662 axrepnd 10663 axpowndlem2 10667 axpowndlem3 10668 axpowndlem4 10669 axregnd 10673 axinfndlem1 10674 axinfnd 10675 axacndlem4 10679 axacndlem5 10680 axacnd 10681 opabdm 32633 opabrn 32634 pm14.122b 44392 pm14.123b 44395 |
Copyright terms: Public domain | W3C validator |