Mathbox for Stefan O'Rear |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > fnwe2lem1 | Structured version Visualization version GIF version |
Description: Lemma for fnwe2 40916. Substitution in well-ordering hypothesis. (Contributed by Stefan O'Rear, 19-Jan-2015.) |
Ref | Expression |
---|---|
fnwe2.su | ⊢ (𝑧 = (𝐹‘𝑥) → 𝑆 = 𝑈) |
fnwe2.t | ⊢ 𝑇 = {〈𝑥, 𝑦〉 ∣ ((𝐹‘𝑥)𝑅(𝐹‘𝑦) ∨ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥𝑈𝑦))} |
fnwe2.s | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑈 We {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) = (𝐹‘𝑥)}) |
Ref | Expression |
---|---|
fnwe2lem1 | ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → ⦋(𝐹‘𝑎) / 𝑧⦌𝑆 We {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) = (𝐹‘𝑎)}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fnwe2.s | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑈 We {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) = (𝐹‘𝑥)}) | |
2 | 1 | ralrimiva 3140 | . . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝑈 We {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) = (𝐹‘𝑥)}) |
3 | fveq2 6804 | . . . . . . 7 ⊢ (𝑎 = 𝑥 → (𝐹‘𝑎) = (𝐹‘𝑥)) | |
4 | 3 | csbeq1d 3841 | . . . . . 6 ⊢ (𝑎 = 𝑥 → ⦋(𝐹‘𝑎) / 𝑧⦌𝑆 = ⦋(𝐹‘𝑥) / 𝑧⦌𝑆) |
5 | fvex 6817 | . . . . . . 7 ⊢ (𝐹‘𝑥) ∈ V | |
6 | fnwe2.su | . . . . . . 7 ⊢ (𝑧 = (𝐹‘𝑥) → 𝑆 = 𝑈) | |
7 | 5, 6 | csbie 3873 | . . . . . 6 ⊢ ⦋(𝐹‘𝑥) / 𝑧⦌𝑆 = 𝑈 |
8 | 4, 7 | eqtrdi 2792 | . . . . 5 ⊢ (𝑎 = 𝑥 → ⦋(𝐹‘𝑎) / 𝑧⦌𝑆 = 𝑈) |
9 | 3 | eqeq2d 2747 | . . . . . 6 ⊢ (𝑎 = 𝑥 → ((𝐹‘𝑦) = (𝐹‘𝑎) ↔ (𝐹‘𝑦) = (𝐹‘𝑥))) |
10 | 9 | rabbidv 3421 | . . . . 5 ⊢ (𝑎 = 𝑥 → {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) = (𝐹‘𝑎)} = {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) = (𝐹‘𝑥)}) |
11 | 8, 10 | weeq12d 40903 | . . . 4 ⊢ (𝑎 = 𝑥 → (⦋(𝐹‘𝑎) / 𝑧⦌𝑆 We {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) = (𝐹‘𝑎)} ↔ 𝑈 We {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) = (𝐹‘𝑥)})) |
12 | 11 | cbvralvw 3222 | . . 3 ⊢ (∀𝑎 ∈ 𝐴 ⦋(𝐹‘𝑎) / 𝑧⦌𝑆 We {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) = (𝐹‘𝑎)} ↔ ∀𝑥 ∈ 𝐴 𝑈 We {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) = (𝐹‘𝑥)}) |
13 | 2, 12 | sylibr 233 | . 2 ⊢ (𝜑 → ∀𝑎 ∈ 𝐴 ⦋(𝐹‘𝑎) / 𝑧⦌𝑆 We {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) = (𝐹‘𝑎)}) |
14 | 13 | r19.21bi 3231 | 1 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → ⦋(𝐹‘𝑎) / 𝑧⦌𝑆 We {𝑦 ∈ 𝐴 ∣ (𝐹‘𝑦) = (𝐹‘𝑎)}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 397 ∨ wo 845 = wceq 1539 ∈ wcel 2104 ∀wral 3062 {crab 3284 ⦋csb 3837 class class class wbr 5081 {copab 5143 We wwe 5554 ‘cfv 6458 |
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-12 2169 ax-ext 2707 ax-nul 5239 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 846 df-3or 1088 df-3an 1089 df-tru 1542 df-fal 1552 df-ex 1780 df-sb 2066 df-clab 2714 df-cleq 2728 df-clel 2814 df-ne 2942 df-ral 3063 df-rex 3072 df-rab 3287 df-v 3439 df-sbc 3722 df-csb 3838 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-nul 4263 df-if 4466 df-sn 4566 df-pr 4568 df-op 4572 df-uni 4845 df-br 5082 df-po 5514 df-so 5515 df-fr 5555 df-we 5557 df-iota 6410 df-fv 6466 |
This theorem is referenced by: fnwe2lem2 40914 fnwe2lem3 40915 |
Copyright terms: Public domain | W3C validator |