MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  dfopif Structured version   Visualization version   GIF version

Theorem dfopif 4374
Description: Rewrite df-op 4162 using if. When both arguments are sets, it reduces to the standard Kuratowski definition; otherwise, it is defined to be the empty set. Avoid directly depending on this detail so that theorems will not depend on the Kuratowski construction. (Contributed by Mario Carneiro, 26-Apr-2015.) (Avoid depending on this detail.)
Assertion
Ref Expression
dfopif 𝐴, 𝐵⟩ = if((𝐴 ∈ V ∧ 𝐵 ∈ V), {{𝐴}, {𝐴, 𝐵}}, ∅)

Proof of Theorem dfopif
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 df-op 4162 . 2 𝐴, 𝐵⟩ = {𝑥 ∣ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})}
2 df-3an 1038 . . 3 ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}}) ↔ ((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}}))
32abbii 2736 . 2 {𝑥 ∣ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})} = {𝑥 ∣ ((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})}
4 iftrue 4070 . . . 4 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → if((𝐴 ∈ V ∧ 𝐵 ∈ V), {{𝐴}, {𝐴, 𝐵}}, ∅) = {{𝐴}, {𝐴, 𝐵}})
5 ibar 525 . . . . 5 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝑥 ∈ {{𝐴}, {𝐴, 𝐵}} ↔ ((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})))
65abbi2dv 2739 . . . 4 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → {{𝐴}, {𝐴, 𝐵}} = {𝑥 ∣ ((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})})
74, 6eqtr2d 2656 . . 3 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → {𝑥 ∣ ((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})} = if((𝐴 ∈ V ∧ 𝐵 ∈ V), {{𝐴}, {𝐴, 𝐵}}, ∅))
8 pm2.21 120 . . . . . . 7 (¬ (𝐴 ∈ V ∧ 𝐵 ∈ V) → ((𝐴 ∈ V ∧ 𝐵 ∈ V) → 𝑥 ∈ ∅))
98adantrd 484 . . . . . 6 (¬ (𝐴 ∈ V ∧ 𝐵 ∈ V) → (((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}}) → 𝑥 ∈ ∅))
109abssdv 3661 . . . . 5 (¬ (𝐴 ∈ V ∧ 𝐵 ∈ V) → {𝑥 ∣ ((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})} ⊆ ∅)
11 ss0 3952 . . . . 5 ({𝑥 ∣ ((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})} ⊆ ∅ → {𝑥 ∣ ((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})} = ∅)
1210, 11syl 17 . . . 4 (¬ (𝐴 ∈ V ∧ 𝐵 ∈ V) → {𝑥 ∣ ((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})} = ∅)
13 iffalse 4073 . . . 4 (¬ (𝐴 ∈ V ∧ 𝐵 ∈ V) → if((𝐴 ∈ V ∧ 𝐵 ∈ V), {{𝐴}, {𝐴, 𝐵}}, ∅) = ∅)
1412, 13eqtr4d 2658 . . 3 (¬ (𝐴 ∈ V ∧ 𝐵 ∈ V) → {𝑥 ∣ ((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})} = if((𝐴 ∈ V ∧ 𝐵 ∈ V), {{𝐴}, {𝐴, 𝐵}}, ∅))
157, 14pm2.61i 176 . 2 {𝑥 ∣ ((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})} = if((𝐴 ∈ V ∧ 𝐵 ∈ V), {{𝐴}, {𝐴, 𝐵}}, ∅)
161, 3, 153eqtri 2647 1 𝐴, 𝐵⟩ = if((𝐴 ∈ V ∧ 𝐵 ∈ V), {{𝐴}, {𝐴, 𝐵}}, ∅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wa 384  w3a 1036   = wceq 1480  wcel 1987  {cab 2607  Vcvv 3190  wss 3560  c0 3897  ifcif 4064  {csn 4155  {cpr 4157  cop 4161
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-v 3192  df-dif 3563  df-in 3567  df-ss 3574  df-nul 3898  df-if 4065  df-op 4162
This theorem is referenced by:  dfopg  4375  opeq1  4377  opeq2  4378  nfop  4393  csbopg  4395  opprc  4399  opex  4903
  Copyright terms: Public domain W3C validator