Theorem reusv2lem5 5399

Description: Lemma for reusv2 5400. (Contributed by NM, 4-Jan-2013.) (Proof shortened by Mario Carneiro, 19-Nov-2016.)

Assertion

Ref	Expression
reusv2lem5	⊢ ((∀𝑦 ∈ 𝐵 𝐶 ∈ 𝐴 ∧ 𝐵 ≠ ∅) → (∃!𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 = 𝐶 ↔ ∃!𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 = 𝐶))

Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝐶

Allowed substitution hint:   𝐶(𝑦)

Proof of Theorem reusv2lem5

Step	Hyp	Ref	Expression
1		tru 1543	. . . . . . . . 9 ⊢ ⊤
2		biimt 359	. . . . . . . . 9 ⊢ ((𝐶 ∈ 𝐴 ∧ ⊤) → (𝑥 = 𝐶 ↔ ((𝐶 ∈ 𝐴 ∧ ⊤) → 𝑥 = 𝐶)))
3	1, 2	mpan2 687	. . . . . . . 8 ⊢ (𝐶 ∈ 𝐴 → (𝑥 = 𝐶 ↔ ((𝐶 ∈ 𝐴 ∧ ⊤) → 𝑥 = 𝐶)))
4		ibar 527	. . . . . . . 8 ⊢ (𝐶 ∈ 𝐴 → (𝑥 = 𝐶 ↔ (𝐶 ∈ 𝐴 ∧ 𝑥 = 𝐶)))
5	3, 4	bitr3d 280	. . . . . . 7 ⊢ (𝐶 ∈ 𝐴 → (((𝐶 ∈ 𝐴 ∧ ⊤) → 𝑥 = 𝐶) ↔ (𝐶 ∈ 𝐴 ∧ 𝑥 = 𝐶)))
6		eleq1 2819	. . . . . . . 8 ⊢ (𝑥 = 𝐶 → (𝑥 ∈ 𝐴 ↔ 𝐶 ∈ 𝐴))
7	6	pm5.32ri 574	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑥 = 𝐶) ↔ (𝐶 ∈ 𝐴 ∧ 𝑥 = 𝐶))
8	5, 7	bitr4di 288	. . . . . 6 ⊢ (𝐶 ∈ 𝐴 → (((𝐶 ∈ 𝐴 ∧ ⊤) → 𝑥 = 𝐶) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 = 𝐶)))
9	8	ralimi 3081	. . . . 5 ⊢ (∀𝑦 ∈ 𝐵 𝐶 ∈ 𝐴 → ∀𝑦 ∈ 𝐵 (((𝐶 ∈ 𝐴 ∧ ⊤) → 𝑥 = 𝐶) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 = 𝐶)))
10		ralbi 3101	. . . . 5 ⊢ (∀𝑦 ∈ 𝐵 (((𝐶 ∈ 𝐴 ∧ ⊤) → 𝑥 = 𝐶) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 = 𝐶)) → (∀𝑦 ∈ 𝐵 ((𝐶 ∈ 𝐴 ∧ ⊤) → 𝑥 = 𝐶) ↔ ∀𝑦 ∈ 𝐵 (𝑥 ∈ 𝐴 ∧ 𝑥 = 𝐶)))
11	9, 10	syl 17	. . . 4 ⊢ (∀𝑦 ∈ 𝐵 𝐶 ∈ 𝐴 → (∀𝑦 ∈ 𝐵 ((𝐶 ∈ 𝐴 ∧ ⊤) → 𝑥 = 𝐶) ↔ ∀𝑦 ∈ 𝐵 (𝑥 ∈ 𝐴 ∧ 𝑥 = 𝐶)))
12	11	eubidv 2578	. . 3 ⊢ (∀𝑦 ∈ 𝐵 𝐶 ∈ 𝐴 → (∃!𝑥∀𝑦 ∈ 𝐵 ((𝐶 ∈ 𝐴 ∧ ⊤) → 𝑥 = 𝐶) ↔ ∃!𝑥∀𝑦 ∈ 𝐵 (𝑥 ∈ 𝐴 ∧ 𝑥 = 𝐶)))
13		r19.28zv 4499	. . . 4 ⊢ (𝐵 ≠ ∅ → (∀𝑦 ∈ 𝐵 (𝑥 ∈ 𝐴 ∧ 𝑥 = 𝐶) ↔ (𝑥 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐵 𝑥 = 𝐶)))
14	13	eubidv 2578	. . 3 ⊢ (𝐵 ≠ ∅ → (∃!𝑥∀𝑦 ∈ 𝐵 (𝑥 ∈ 𝐴 ∧ 𝑥 = 𝐶) ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐵 𝑥 = 𝐶)))
15	12, 14	sylan9bb 508	. 2 ⊢ ((∀𝑦 ∈ 𝐵 𝐶 ∈ 𝐴 ∧ 𝐵 ≠ ∅) → (∃!𝑥∀𝑦 ∈ 𝐵 ((𝐶 ∈ 𝐴 ∧ ⊤) → 𝑥 = 𝐶) ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐵 𝑥 = 𝐶)))
16	1	biantrur 529	. . . . 5 ⊢ (𝑥 = 𝐶 ↔ (⊤ ∧ 𝑥 = 𝐶))
17	16	rexbii 3092	. . . 4 ⊢ (∃𝑦 ∈ 𝐵 𝑥 = 𝐶 ↔ ∃𝑦 ∈ 𝐵 (⊤ ∧ 𝑥 = 𝐶))
18	17	reubii 3383	. . 3 ⊢ (∃!𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 = 𝐶 ↔ ∃!𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (⊤ ∧ 𝑥 = 𝐶))
19		reusv2lem4 5398	. . 3 ⊢ (∃!𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (⊤ ∧ 𝑥 = 𝐶) ↔ ∃!𝑥∀𝑦 ∈ 𝐵 ((𝐶 ∈ 𝐴 ∧ ⊤) → 𝑥 = 𝐶))
20	18, 19	bitri 274	. 2 ⊢ (∃!𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 = 𝐶 ↔ ∃!𝑥∀𝑦 ∈ 𝐵 ((𝐶 ∈ 𝐴 ∧ ⊤) → 𝑥 = 𝐶))
21		df-reu 3375	. 2 ⊢ (∃!𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 = 𝐶 ↔ ∃!𝑥(𝑥 ∈ 𝐴 ∧ ∀𝑦 ∈ 𝐵 𝑥 = 𝐶))
22	15, 20, 21	3bitr4g 313	1 ⊢ ((∀𝑦 ∈ 𝐵 𝐶 ∈ 𝐴 ∧ 𝐵 ≠ ∅) → (∃!𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥 = 𝐶 ↔ ∃!𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑥 = 𝐶))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 394   = wceq 1539  ⊤wtru 1540   ∈ wcel 2104  ∃!weu 2560   ≠ wne 2938  ∀wral 3059  ∃wrex 3068  ∃!wreu 3372  ∅c0 4321

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-10 2135  ax-11 2152  ax-12 2169  ax-ext 2701  ax-nul 5305  ax-pow 5362

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 844  df-tru 1542  df-fal 1552  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2532  df-eu 2561  df-clab 2708  df-cleq 2722  df-clel 2808  df-nfc 2883  df-ne 2939  df-ral 3060  df-rex 3069  df-reu 3375  df-rab 3431  df-v 3474  df-sbc 3777  df-csb 3893  df-dif 3950  df-nul 4322

This theorem is referenced by:  reusv2  5400