| 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 2532 | . 2 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 𝜓 ↔ ∀𝑦 ∈ 𝐵 𝜒)) |
| 3 | 2 | rexbidv 2533 | 1 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜓 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜒)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 ∀wral 2510 ∃wrex 2511 |
| 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 1495 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-4 1558 ax-17 1574 ax-ial 1582 |
| This theorem depends on definitions: df-bi 117 df-nf 1509 df-ral 2515 df-rex 2516 |
| This theorem is referenced by: caucvgpr 7902 caucvgprpr 7932 caucvgsrlemgt1 8015 caucvgsrlemoffres 8020 axcaucvglemres 8119 cvg1nlemres 11563 rexfiuz 11567 resqrexlemgt0 11598 resqrexlemoverl 11599 resqrexlemglsq 11600 resqrexlemsqa 11602 resqrexlemex 11603 cau3lem 11692 caubnd2 11695 climi 11865 2clim 11879 ennnfonelemim 13063 mplelbascoe 14725 lmcvg 14960 lmss 14989 txlm 15022 metcnpi 15258 metcnpi2 15259 elcncf 15316 cncfi 15321 limcimo 15408 cnplimclemr 15412 limccoap 15421 |
| Copyright terms: Public domain | W3C validator |