Theorem bj-ififc 35459

Description: A biconditional connecting the conditional operator for propositions and the conditional operator for classes. Note that there is no sethood hypothesis on 𝑋: it is implied by either side. (Contributed by BJ, 24-Sep-2019.) Generalize statement from setvar 𝑥 to class 𝑋. (Revised by BJ, 26-Dec-2023.)

Assertion

Ref	Expression
bj-ififc	⊢ (𝑋 ∈ if(𝜑, 𝐴, 𝐵) ↔ if-(𝜑, 𝑋 ∈ 𝐴, 𝑋 ∈ 𝐵))

Proof of Theorem bj-ififc

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		bj-df-ifc 35457	. . 3 ⊢ if(𝜑, 𝐴, 𝐵) = {𝑥 ∣ if-(𝜑, 𝑥 ∈ 𝐴, 𝑥 ∈ 𝐵)}
2	1	eleq2i 2826	. 2 ⊢ (𝑋 ∈ if(𝜑, 𝐴, 𝐵) ↔ 𝑋 ∈ {𝑥 ∣ if-(𝜑, 𝑥 ∈ 𝐴, 𝑥 ∈ 𝐵)})
3		df-ifp 1063	. . . 4 ⊢ (if-(𝜑, 𝑋 ∈ 𝐴, 𝑋 ∈ 𝐵) ↔ ((𝜑 ∧ 𝑋 ∈ 𝐴) ∨ (¬ 𝜑 ∧ 𝑋 ∈ 𝐵)))
4		elex 3493	. . . . . 6 ⊢ (𝑋 ∈ 𝐴 → 𝑋 ∈ V)
5	4	adantl 483	. . . . 5 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → 𝑋 ∈ V)
6		elex 3493	. . . . . 6 ⊢ (𝑋 ∈ 𝐵 → 𝑋 ∈ V)
7	6	adantl 483	. . . . 5 ⊢ ((¬ 𝜑 ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ V)
8	5, 7	jaoi 856	. . . 4 ⊢ (((𝜑 ∧ 𝑋 ∈ 𝐴) ∨ (¬ 𝜑 ∧ 𝑋 ∈ 𝐵)) → 𝑋 ∈ V)
9	3, 8	sylbi 216	. . 3 ⊢ (if-(𝜑, 𝑋 ∈ 𝐴, 𝑋 ∈ 𝐵) → 𝑋 ∈ V)
10		eleq1 2822	. . . 4 ⊢ (𝑥 = 𝑋 → (𝑥 ∈ 𝐴 ↔ 𝑋 ∈ 𝐴))
11		eleq1 2822	. . . 4 ⊢ (𝑥 = 𝑋 → (𝑥 ∈ 𝐵 ↔ 𝑋 ∈ 𝐵))
12	10, 11	ifpbi23d 1081	. . 3 ⊢ (𝑥 = 𝑋 → (if-(𝜑, 𝑥 ∈ 𝐴, 𝑥 ∈ 𝐵) ↔ if-(𝜑, 𝑋 ∈ 𝐴, 𝑋 ∈ 𝐵)))
13	9, 12	elab3 3677	. 2 ⊢ (𝑋 ∈ {𝑥 ∣ if-(𝜑, 𝑥 ∈ 𝐴, 𝑥 ∈ 𝐵)} ↔ if-(𝜑, 𝑋 ∈ 𝐴, 𝑋 ∈ 𝐵))
14	2, 13	bitri 275	1 ⊢ (𝑋 ∈ if(𝜑, 𝐴, 𝐵) ↔ if-(𝜑, 𝑋 ∈ 𝐴, 𝑋 ∈ 𝐵))

Syntax hints:  ¬ wn 3   ↔ wb 205   ∧ wa 397   ∨ wo 846  if-wif 1062   = wceq 1542   ∈ wcel 2107  {cab 2710  Vcvv 3475  ifcif 4529

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-ext 2704

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-ifp 1063  df-tru 1545  df-ex 1783  df-sb 2069  df-clab 2711  df-cleq 2725  df-clel 2811  df-v 3477  df-if 4530

This theorem is referenced by: (None)