Theorem bj-ififc 37025

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 37023	. . 3 ⊢ if(𝜑, 𝐴, 𝐵) = {𝑥 ∣ if-(𝜑, 𝑥 ∈ 𝐴, 𝑥 ∈ 𝐵)}
2	1	eleq2i 2854	. 2 ⊢ (𝑋 ∈ if(𝜑, 𝐴, 𝐵) ↔ 𝑋 ∈ {𝑥 ∣ if-(𝜑, 𝑥 ∈ 𝐴, 𝑥 ∈ 𝐵)})
3		df-ifp 1075	. . . 4 ⊢ (if-(𝜑, 𝑋 ∈ 𝐴, 𝑋 ∈ 𝐵) ↔ ((𝜑 ∧ 𝑋 ∈ 𝐴) ∨ (¬ 𝜑 ∧ 𝑋 ∈ 𝐵)))
4		elex 3475	. . . . . 6 ⊢ (𝑋 ∈ 𝐴 → 𝑋 ∈ V)
5	4	adantl 485	. . . . 5 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → 𝑋 ∈ V)
6		elex 3475	. . . . . 6 ⊢ (𝑋 ∈ 𝐵 → 𝑋 ∈ V)
7	6	adantl 485	. . . . 5 ⊢ ((¬ 𝜑 ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ V)
8	5, 7	jaoi 868	. . . 4 ⊢ (((𝜑 ∧ 𝑋 ∈ 𝐴) ∨ (¬ 𝜑 ∧ 𝑋 ∈ 𝐵)) → 𝑋 ∈ V)
9	3, 8	sylbi 219	. . 3 ⊢ (if-(𝜑, 𝑋 ∈ 𝐴, 𝑋 ∈ 𝐵) → 𝑋 ∈ V)
10		eleq1 2850	. . . 4 ⊢ (𝑥 = 𝑋 → (𝑥 ∈ 𝐴 ↔ 𝑋 ∈ 𝐴))
11		eleq1 2850	. . . 4 ⊢ (𝑥 = 𝑋 → (𝑥 ∈ 𝐵 ↔ 𝑋 ∈ 𝐵))
12	10, 11	ifpbi23d 1091	. . 3 ⊢ (𝑥 = 𝑋 → (if-(𝜑, 𝑥 ∈ 𝐴, 𝑥 ∈ 𝐵) ↔ if-(𝜑, 𝑋 ∈ 𝐴, 𝑋 ∈ 𝐵)))
13	9, 12	elab3 3645	. 2 ⊢ (𝑋 ∈ {𝑥 ∣ if-(𝜑, 𝑥 ∈ 𝐴, 𝑥 ∈ 𝐵)} ↔ if-(𝜑, 𝑋 ∈ 𝐴, 𝑋 ∈ 𝐵))
14	2, 13	bitri 277	1 ⊢ (𝑋 ∈ if(𝜑, 𝐴, 𝐵) ↔ if-(𝜑, 𝑋 ∈ 𝐴, 𝑋 ∈ 𝐵))

Syntax hints:  ¬ wn 3   ↔ wb 208   ∧ wa 399   ∨ wo 858  if-wif 1074   = wceq 1560   ∈ wcel 2142  {cab 2740  Vcvv 3454  ifcif 4480

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-ext 2734

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-ifp 1075  df-tru 1563  df-ex 1800  df-sb 2091  df-clab 2741  df-cleq 2754  df-clel 2837  df-v 3456  df-if 4481

This theorem is referenced by: (None)