| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > r19.29ffa | Structured version Visualization version GIF version | ||
| Description: A commonly used pattern based on r19.29 3130, version with two restricted quantifiers. (Contributed by Thierry Arnoux, 26-Nov-2017.) |
| Ref | Expression |
|---|---|
| r19.29ffa.3 | ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐵) ∧ 𝜓) → 𝜒) |
| Ref | Expression |
|---|---|
| r19.29ffa | ⊢ ((𝜑 ∧ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜓) → 𝜒) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | r19.29ffa.3 | . . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐵) ∧ 𝜓) → 𝜒) | |
| 2 | 1 | ex 418 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐵) → (𝜓 → 𝜒)) |
| 3 | 2 | ralrimiva 3159 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ∀𝑦 ∈ 𝐵 (𝜓 → 𝜒)) |
| 4 | 3 | ralrimiva 3159 | . . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜓 → 𝜒)) |
| 5 | 4 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜓) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜓 → 𝜒)) |
| 6 | simpr 490 | . . 3 ⊢ ((𝜑 ∧ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜓) → ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜓) | |
| 7 | 5, 6 | r19.29d2r 3154 | . 2 ⊢ ((𝜑 ∧ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜓) → ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ((𝜓 → 𝜒) ∧ 𝜓)) |
| 8 | pm3.35 815 | . . . . 5 ⊢ ((𝜓 ∧ (𝜓 → 𝜒)) → 𝜒) | |
| 9 | 8 | ancoms 464 | . . . 4 ⊢ (((𝜓 → 𝜒) ∧ 𝜓) → 𝜒) |
| 10 | 9 | rexlimivw 3164 | . . 3 ⊢ (∃𝑦 ∈ 𝐵 ((𝜓 → 𝜒) ∧ 𝜓) → 𝜒) |
| 11 | 10 | rexlimivw 3164 | . 2 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ((𝜓 → 𝜒) ∧ 𝜓) → 𝜒) |
| 12 | 7, 11 | syl 18 | 1 ⊢ ((𝜑 ∧ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜓) → 𝜒) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∈ wcel 2146 ∀wral 3081 ∃wrex 3091 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1813 df-ral 3082 df-rex 3092 |
| This theorem is used by: opreu2reuALT 32894 gsumwun 33460 elrspunsn 33801 ply1dg3rt0irred 33938 reprsuc 35067 |
| Copyright terms: Public domain | W3C validator |