Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > opelres | GIF version |
Description: Ordered pair membership in a restriction. Exercise 13 of [TakeutiZaring] p. 25. (Contributed by NM, 13-Nov-1995.) |
Ref | Expression |
---|---|
opelres.1 | ⊢ 𝐵 ∈ V |
Ref | Expression |
---|---|
opelres | ⊢ (〈𝐴, 𝐵〉 ∈ (𝐶 ↾ 𝐷) ↔ (〈𝐴, 𝐵〉 ∈ 𝐶 ∧ 𝐴 ∈ 𝐷)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-res 4375 | . . 3 ⊢ (𝐶 ↾ 𝐷) = (𝐶 ∩ (𝐷 × V)) | |
2 | 1 | eleq2i 2145 | . 2 ⊢ (〈𝐴, 𝐵〉 ∈ (𝐶 ↾ 𝐷) ↔ 〈𝐴, 𝐵〉 ∈ (𝐶 ∩ (𝐷 × V))) |
3 | elin 3155 | . 2 ⊢ (〈𝐴, 𝐵〉 ∈ (𝐶 ∩ (𝐷 × V)) ↔ (〈𝐴, 𝐵〉 ∈ 𝐶 ∧ 〈𝐴, 𝐵〉 ∈ (𝐷 × V))) | |
4 | opelres.1 | . . . 4 ⊢ 𝐵 ∈ V | |
5 | opelxp 4392 | . . . 4 ⊢ (〈𝐴, 𝐵〉 ∈ (𝐷 × V) ↔ (𝐴 ∈ 𝐷 ∧ 𝐵 ∈ V)) | |
6 | 4, 5 | mpbiran2 882 | . . 3 ⊢ (〈𝐴, 𝐵〉 ∈ (𝐷 × V) ↔ 𝐴 ∈ 𝐷) |
7 | 6 | anbi2i 444 | . 2 ⊢ ((〈𝐴, 𝐵〉 ∈ 𝐶 ∧ 〈𝐴, 𝐵〉 ∈ (𝐷 × V)) ↔ (〈𝐴, 𝐵〉 ∈ 𝐶 ∧ 𝐴 ∈ 𝐷)) |
8 | 2, 3, 7 | 3bitri 204 | 1 ⊢ (〈𝐴, 𝐵〉 ∈ (𝐶 ↾ 𝐷) ↔ (〈𝐴, 𝐵〉 ∈ 𝐶 ∧ 𝐴 ∈ 𝐷)) |
Colors of variables: wff set class |
Syntax hints: ∧ wa 102 ↔ wb 103 ∈ wcel 1433 Vcvv 2601 ∩ cin 2972 〈cop 3401 × cxp 4361 ↾ cres 4365 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-14 1445 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 ax-sep 3896 ax-pow 3948 ax-pr 3964 |
This theorem depends on definitions: df-bi 115 df-3an 921 df-tru 1287 df-nf 1390 df-sb 1686 df-clab 2068 df-cleq 2074 df-clel 2077 df-nfc 2208 df-ral 2353 df-rex 2354 df-v 2603 df-un 2977 df-in 2979 df-ss 2986 df-pw 3384 df-sn 3404 df-pr 3405 df-op 3407 df-opab 3840 df-xp 4369 df-res 4375 |
This theorem is referenced by: brres 4636 opelresg 4637 opres 4639 dmres 4650 elres 4664 relssres 4666 resiexg 4673 iss 4674 asymref 4730 ssrnres 4783 cnvresima 4830 ressn 4878 funssres 4962 fcnvres 5093 |
Copyright terms: Public domain | W3C validator |