|   | Metamath Proof Explorer | < Previous  
      Next > Nearby theorems | |
| Mirrors > Home > MPE Home > Th. List > rexbidvaALT | Structured version Visualization version GIF version | ||
| Description: Alternate proof of rexbidva 3176, shorter but requires more axioms. (Contributed by NM, 9-Mar-1997.) (New usage is discouraged.) (Proof modification is discouraged.) | 
| Ref | Expression | 
|---|---|
| rexbidvaALT.1 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝜓 ↔ 𝜒)) | 
| Ref | Expression | 
|---|---|
| rexbidvaALT | ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑥 ∈ 𝐴 𝜒)) | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | nfv 1913 | . 2 ⊢ Ⅎ𝑥𝜑 | |
| 2 | rexbidvaALT.1 | . 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝜓 ↔ 𝜒)) | |
| 3 | 1, 2 | rexbida 3271 | 1 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑥 ∈ 𝐴 𝜒)) | 
| Colors of variables: wff setvar class | 
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∈ wcel 2107 ∃wrex 3069 | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-12 2176 | 
| This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1779 df-nf 1783 df-rex 3070 | 
| This theorem is referenced by: (None) | 
| Copyright terms: Public domain | W3C validator |