Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > opth2 | GIF version |
Description: Ordered pair theorem. (Contributed by NM, 21-Sep-2014.) |
Ref | Expression |
---|---|
opth2.1 | ⊢ 𝐶 ∈ V |
opth2.2 | ⊢ 𝐷 ∈ V |
Ref | Expression |
---|---|
opth2 | ⊢ (〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉 ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | opth2.1 | . 2 ⊢ 𝐶 ∈ V | |
2 | opth2.2 | . 2 ⊢ 𝐷 ∈ V | |
3 | opthg2 4224 | . 2 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → (〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉 ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))) | |
4 | 1, 2, 3 | mp2an 424 | 1 ⊢ (〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉 ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)) |
Colors of variables: wff set class |
Syntax hints: ∧ wa 103 ↔ wb 104 = wceq 1348 ∈ wcel 2141 Vcvv 2730 〈cop 3586 |
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 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-14 2144 ax-ext 2152 ax-sep 4107 ax-pow 4160 ax-pr 4194 |
This theorem depends on definitions: df-bi 116 df-3an 975 df-tru 1351 df-nf 1454 df-sb 1756 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-v 2732 df-un 3125 df-in 3127 df-ss 3134 df-pw 3568 df-sn 3589 df-pr 3590 df-op 3592 |
This theorem is referenced by: eqvinop 4228 opelxp 4641 fsn 5668 dfplpq2 7316 ltresr 7801 frecuzrdgtcl 10368 frecuzrdgfunlem 10375 |
Copyright terms: Public domain | W3C validator |