![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > optocl | GIF version |
Description: Implicit substitution of class for ordered pair. (Contributed by NM, 5-Mar-1995.) |
Ref | Expression |
---|---|
optocl.1 | ⊢ 𝐷 = (𝐵 × 𝐶) |
optocl.2 | ⊢ (〈𝑥, 𝑦〉 = 𝐴 → (𝜑 ↔ 𝜓)) |
optocl.3 | ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶) → 𝜑) |
Ref | Expression |
---|---|
optocl | ⊢ (𝐴 ∈ 𝐷 → 𝜓) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elxp3 4601 | . . 3 ⊢ (𝐴 ∈ (𝐵 × 𝐶) ↔ ∃𝑥∃𝑦(〈𝑥, 𝑦〉 = 𝐴 ∧ 〈𝑥, 𝑦〉 ∈ (𝐵 × 𝐶))) | |
2 | opelxp 4577 | . . . . . . 7 ⊢ (〈𝑥, 𝑦〉 ∈ (𝐵 × 𝐶) ↔ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) | |
3 | optocl.3 | . . . . . . 7 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶) → 𝜑) | |
4 | 2, 3 | sylbi 120 | . . . . . 6 ⊢ (〈𝑥, 𝑦〉 ∈ (𝐵 × 𝐶) → 𝜑) |
5 | optocl.2 | . . . . . 6 ⊢ (〈𝑥, 𝑦〉 = 𝐴 → (𝜑 ↔ 𝜓)) | |
6 | 4, 5 | syl5ib 153 | . . . . 5 ⊢ (〈𝑥, 𝑦〉 = 𝐴 → (〈𝑥, 𝑦〉 ∈ (𝐵 × 𝐶) → 𝜓)) |
7 | 6 | imp 123 | . . . 4 ⊢ ((〈𝑥, 𝑦〉 = 𝐴 ∧ 〈𝑥, 𝑦〉 ∈ (𝐵 × 𝐶)) → 𝜓) |
8 | 7 | exlimivv 1869 | . . 3 ⊢ (∃𝑥∃𝑦(〈𝑥, 𝑦〉 = 𝐴 ∧ 〈𝑥, 𝑦〉 ∈ (𝐵 × 𝐶)) → 𝜓) |
9 | 1, 8 | sylbi 120 | . 2 ⊢ (𝐴 ∈ (𝐵 × 𝐶) → 𝜓) |
10 | optocl.1 | . 2 ⊢ 𝐷 = (𝐵 × 𝐶) | |
11 | 9, 10 | eleq2s 2235 | 1 ⊢ (𝐴 ∈ 𝐷 → 𝜓) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 = wceq 1332 ∃wex 1469 ∈ wcel 1481 〈cop 3535 × cxp 4545 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-14 1493 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 ax-sep 4054 ax-pow 4106 ax-pr 4139 |
This theorem depends on definitions: df-bi 116 df-3an 965 df-tru 1335 df-nf 1438 df-sb 1737 df-clab 2127 df-cleq 2133 df-clel 2136 df-nfc 2271 df-ral 2422 df-rex 2423 df-v 2691 df-un 3080 df-in 3082 df-ss 3089 df-pw 3517 df-sn 3538 df-pr 3539 df-op 3541 df-opab 3998 df-xp 4553 |
This theorem is referenced by: 2optocl 4624 3optocl 4625 ecoptocl 6524 ax1rid 7709 ax0id 7710 axcnre 7713 |
Copyright terms: Public domain | W3C validator |