![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > oprcl | Structured version Visualization version GIF version |
Description: If an ordered pair has an element, then its arguments are sets. (Contributed by Mario Carneiro, 26-Apr-2015.) |
Ref | Expression |
---|---|
oprcl | ⊢ (𝐶 ∈ ⟨𝐴, 𝐵⟩ → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | n0i 4334 | . 2 ⊢ (𝐶 ∈ ⟨𝐴, 𝐵⟩ → ¬ ⟨𝐴, 𝐵⟩ = ∅) | |
2 | opprc 4897 | . 2 ⊢ (¬ (𝐴 ∈ V ∧ 𝐵 ∈ V) → ⟨𝐴, 𝐵⟩ = ∅) | |
3 | 1, 2 | nsyl2 141 | 1 ⊢ (𝐶 ∈ ⟨𝐴, 𝐵⟩ → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1534 ∈ wcel 2099 Vcvv 3471 ∅c0 4323 ⟨cop 4635 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-ext 2699 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-sb 2061 df-clab 2706 df-cleq 2720 df-clel 2806 df-v 3473 df-dif 3950 df-in 3954 df-ss 3964 df-nul 4324 df-if 4530 df-op 4636 |
This theorem is referenced by: opth1 5477 opth 5478 0nelop 5498 |
Copyright terms: Public domain | W3C validator |