Theorem cdleme31fv 40347

Description: Part of proof of Lemma E in [Crawley] p. 113. (Contributed by NM, 10-Feb-2013.)

Hypotheses

Ref	Expression
cdleme31.o	⊢ 𝑂 = (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (𝑁 ∨ (𝑥 ∧ 𝑊))))
cdleme31.f	⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), 𝑂, 𝑥))
cdleme31.c	⊢ 𝐶 = (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → 𝑧 = (𝑁 ∨ (𝑋 ∧ 𝑊))))

Assertion

Ref	Expression
cdleme31fv	⊢ (𝑋 ∈ 𝐵 → (𝐹‘𝑋) = if((𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊), 𝐶, 𝑋))

Distinct variable groups:   𝑥,𝐵   𝑥,𝐶   𝑥, ≤   𝑥,𝑃   𝑥,𝑄   𝑥,𝑊   𝑥,𝑠,𝑧,𝑋

Allowed substitution hints:   𝐴(𝑥,𝑧,𝑠)   𝐵(𝑧,𝑠)   𝐶(𝑧,𝑠)   𝑃(𝑧,𝑠)   𝑄(𝑧,𝑠)   𝐹(𝑥,𝑧,𝑠)   ∨ (𝑥,𝑧,𝑠)   ≤ (𝑧,𝑠)   ∧ (𝑥,𝑧,𝑠)   𝑁(𝑥,𝑧,𝑠)   𝑂(𝑥,𝑧,𝑠)   𝑊(𝑧,𝑠)

Proof of Theorem cdleme31fv

Step	Hyp	Ref	Expression
1		cdleme31.c	. . . 4 ⊢ 𝐶 = (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → 𝑧 = (𝑁 ∨ (𝑋 ∧ 𝑊))))
2		riotaex 7408	. . . 4 ⊢ (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → 𝑧 = (𝑁 ∨ (𝑋 ∧ 𝑊)))) ∈ V
3	1, 2	eqeltri 2840	. . 3 ⊢ 𝐶 ∈ V
4		ifexg 4597	. . 3 ⊢ ((𝐶 ∈ V ∧ 𝑋 ∈ 𝐵) → if((𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊), 𝐶, 𝑋) ∈ V)
5	3, 4	mpan 689	. 2 ⊢ (𝑋 ∈ 𝐵 → if((𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊), 𝐶, 𝑋) ∈ V)
6		breq1 5169	. . . . . 6 ⊢ (𝑥 = 𝑋 → (𝑥 ≤ 𝑊 ↔ 𝑋 ≤ 𝑊))
7	6	notbid 318	. . . . 5 ⊢ (𝑥 = 𝑋 → (¬ 𝑥 ≤ 𝑊 ↔ ¬ 𝑋 ≤ 𝑊))
8	7	anbi2d 629	. . . 4 ⊢ (𝑥 = 𝑋 → ((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊) ↔ (𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊)))
9		oveq1 7455	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑋 → (𝑥 ∧ 𝑊) = (𝑋 ∧ 𝑊))
10	9	oveq2d 7464	. . . . . . . . . 10 ⊢ (𝑥 = 𝑋 → (𝑠 ∨ (𝑥 ∧ 𝑊)) = (𝑠 ∨ (𝑋 ∧ 𝑊)))
11		id 22	. . . . . . . . . 10 ⊢ (𝑥 = 𝑋 → 𝑥 = 𝑋)
12	10, 11	eqeq12d 2756	. . . . . . . . 9 ⊢ (𝑥 = 𝑋 → ((𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥 ↔ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋))
13	12	anbi2d 629	. . . . . . . 8 ⊢ (𝑥 = 𝑋 → ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) ↔ (¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋)))
14	9	oveq2d 7464	. . . . . . . . 9 ⊢ (𝑥 = 𝑋 → (𝑁 ∨ (𝑥 ∧ 𝑊)) = (𝑁 ∨ (𝑋 ∧ 𝑊)))
15	14	eqeq2d 2751	. . . . . . . 8 ⊢ (𝑥 = 𝑋 → (𝑧 = (𝑁 ∨ (𝑥 ∧ 𝑊)) ↔ 𝑧 = (𝑁 ∨ (𝑋 ∧ 𝑊))))
16	13, 15	imbi12d 344	. . . . . . 7 ⊢ (𝑥 = 𝑋 → (((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (𝑁 ∨ (𝑥 ∧ 𝑊))) ↔ ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → 𝑧 = (𝑁 ∨ (𝑋 ∧ 𝑊)))))
17	16	ralbidv 3184	. . . . . 6 ⊢ (𝑥 = 𝑋 → (∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (𝑁 ∨ (𝑥 ∧ 𝑊))) ↔ ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → 𝑧 = (𝑁 ∨ (𝑋 ∧ 𝑊)))))
18	17	riotabidv 7406	. . . . 5 ⊢ (𝑥 = 𝑋 → (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (𝑁 ∨ (𝑥 ∧ 𝑊)))) = (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → 𝑧 = (𝑁 ∨ (𝑋 ∧ 𝑊)))))
19		cdleme31.o	. . . . 5 ⊢ 𝑂 = (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (𝑁 ∨ (𝑥 ∧ 𝑊))))
20	18, 19, 1	3eqtr4g 2805	. . . 4 ⊢ (𝑥 = 𝑋 → 𝑂 = 𝐶)
21	8, 20, 11	ifbieq12d 4576	. . 3 ⊢ (𝑥 = 𝑋 → if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), 𝑂, 𝑥) = if((𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊), 𝐶, 𝑋))
22		cdleme31.f	. . 3 ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), 𝑂, 𝑥))
23	21, 22	fvmptg 7027	. 2 ⊢ ((𝑋 ∈ 𝐵 ∧ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊), 𝐶, 𝑋) ∈ V) → (𝐹‘𝑋) = if((𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊), 𝐶, 𝑋))
24	5, 23	mpdan 686	1 ⊢ (𝑋 ∈ 𝐵 → (𝐹‘𝑋) = if((𝑃 ≠ 𝑄 ∧ ¬ 𝑋 ≤ 𝑊), 𝐶, 𝑋))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   = wceq 1537   ∈ wcel 2108   ≠ wne 2946  ∀wral 3067  Vcvv 3488  ifcif 4548   class class class wbr 5166   ↦ cmpt 5249  ‘cfv 6573  ℩crio 7403  (class class class)co 7448

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-iota 6525  df-fun 6575  df-fv 6581  df-riota 7404  df-ov 7451

This theorem is referenced by:  cdleme31fv1  40348