| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > rexralbidv | GIF version | ||
| Description: Formula-building rule for restricted quantifiers (deduction form). (Contributed by NM, 28-Jan-2006.) |
| Ref | Expression |
|---|---|
| 2ralbidv.1 | ⊢ (𝜑 → (𝜓 ↔ 𝜒)) |
| Ref | Expression |
|---|---|
| rexralbidv | ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜓 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜒)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2ralbidv.1 | . . 3 ⊢ (𝜑 → (𝜓 ↔ 𝜒)) | |
| 2 | 1 | ralbidv 2550 | . 2 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 𝜓 ↔ ∀𝑦 ∈ 𝐵 𝜒)) |
| 3 | 2 | rexbidv 2551 | 1 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜓 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜒)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 ∀wral 2528 ∃wrex 2529 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-5 1500 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-4 1563 ax-17 1579 ax-ial 1587 |
| This theorem depends on definitions: df-bi 117 df-nf 1514 df-ral 2533 df-rex 2534 |
| This theorem is referenced by: caucvgpr 8039 caucvgprpr 8069 caucvgsrlemgt1 8152 caucvgsrlemoffres 8157 axcaucvglemres 8256 cvg1nlemres 11729 rexfiuz 11733 resqrexlemgt0 11764 resqrexlemoverl 11765 resqrexlemglsq 11766 resqrexlemsqa 11768 resqrexlemex 11769 cau3lem 11858 caubnd2 11861 climi 12031 2clim 12045 ennnfonelemim 13293 mplelbascoe 15006 lmcvg 15241 lmss 15270 txlm 15303 metcnpi 15539 metcnpi2 15540 elcncf 15597 cncfi 15602 limcimo 15689 cnplimclemr 15693 limccoap 15702 |
| Copyright terms: Public domain | W3C validator |