Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > zorn2lem3 | Structured version Visualization version GIF version |
Description: Lemma for zorn2 10193. (Contributed by NM, 3-Apr-1997.) (Revised by Mario Carneiro, 9-May-2015.) |
Ref | Expression |
---|---|
zorn2lem.3 | ⊢ 𝐹 = recs((𝑓 ∈ V ↦ (℩𝑣 ∈ 𝐶 ∀𝑢 ∈ 𝐶 ¬ 𝑢𝑤𝑣))) |
zorn2lem.4 | ⊢ 𝐶 = {𝑧 ∈ 𝐴 ∣ ∀𝑔 ∈ ran 𝑓 𝑔𝑅𝑧} |
zorn2lem.5 | ⊢ 𝐷 = {𝑧 ∈ 𝐴 ∣ ∀𝑔 ∈ (𝐹 “ 𝑥)𝑔𝑅𝑧} |
Ref | Expression |
---|---|
zorn2lem3 | ⊢ ((𝑅 Po 𝐴 ∧ (𝑥 ∈ On ∧ (𝑤 We 𝐴 ∧ 𝐷 ≠ ∅))) → (𝑦 ∈ 𝑥 → ¬ (𝐹‘𝑥) = (𝐹‘𝑦))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | zorn2lem.3 | . . . 4 ⊢ 𝐹 = recs((𝑓 ∈ V ↦ (℩𝑣 ∈ 𝐶 ∀𝑢 ∈ 𝐶 ¬ 𝑢𝑤𝑣))) | |
2 | zorn2lem.4 | . . . 4 ⊢ 𝐶 = {𝑧 ∈ 𝐴 ∣ ∀𝑔 ∈ ran 𝑓 𝑔𝑅𝑧} | |
3 | zorn2lem.5 | . . . 4 ⊢ 𝐷 = {𝑧 ∈ 𝐴 ∣ ∀𝑔 ∈ (𝐹 “ 𝑥)𝑔𝑅𝑧} | |
4 | 1, 2, 3 | zorn2lem2 10184 | . . 3 ⊢ ((𝑥 ∈ On ∧ (𝑤 We 𝐴 ∧ 𝐷 ≠ ∅)) → (𝑦 ∈ 𝑥 → (𝐹‘𝑦)𝑅(𝐹‘𝑥))) |
5 | 4 | adantl 481 | . 2 ⊢ ((𝑅 Po 𝐴 ∧ (𝑥 ∈ On ∧ (𝑤 We 𝐴 ∧ 𝐷 ≠ ∅))) → (𝑦 ∈ 𝑥 → (𝐹‘𝑦)𝑅(𝐹‘𝑥))) |
6 | 3 | ssrab3 4011 | . . . 4 ⊢ 𝐷 ⊆ 𝐴 |
7 | 1, 2, 3 | zorn2lem1 10183 | . . . 4 ⊢ ((𝑥 ∈ On ∧ (𝑤 We 𝐴 ∧ 𝐷 ≠ ∅)) → (𝐹‘𝑥) ∈ 𝐷) |
8 | 6, 7 | sselid 3915 | . . 3 ⊢ ((𝑥 ∈ On ∧ (𝑤 We 𝐴 ∧ 𝐷 ≠ ∅)) → (𝐹‘𝑥) ∈ 𝐴) |
9 | breq1 5073 | . . . . . 6 ⊢ ((𝐹‘𝑥) = (𝐹‘𝑦) → ((𝐹‘𝑥)𝑅(𝐹‘𝑥) ↔ (𝐹‘𝑦)𝑅(𝐹‘𝑥))) | |
10 | 9 | biimprcd 249 | . . . . 5 ⊢ ((𝐹‘𝑦)𝑅(𝐹‘𝑥) → ((𝐹‘𝑥) = (𝐹‘𝑦) → (𝐹‘𝑥)𝑅(𝐹‘𝑥))) |
11 | poirr 5506 | . . . . 5 ⊢ ((𝑅 Po 𝐴 ∧ (𝐹‘𝑥) ∈ 𝐴) → ¬ (𝐹‘𝑥)𝑅(𝐹‘𝑥)) | |
12 | 10, 11 | nsyli 157 | . . . 4 ⊢ ((𝐹‘𝑦)𝑅(𝐹‘𝑥) → ((𝑅 Po 𝐴 ∧ (𝐹‘𝑥) ∈ 𝐴) → ¬ (𝐹‘𝑥) = (𝐹‘𝑦))) |
13 | 12 | com12 32 | . . 3 ⊢ ((𝑅 Po 𝐴 ∧ (𝐹‘𝑥) ∈ 𝐴) → ((𝐹‘𝑦)𝑅(𝐹‘𝑥) → ¬ (𝐹‘𝑥) = (𝐹‘𝑦))) |
14 | 8, 13 | sylan2 592 | . 2 ⊢ ((𝑅 Po 𝐴 ∧ (𝑥 ∈ On ∧ (𝑤 We 𝐴 ∧ 𝐷 ≠ ∅))) → ((𝐹‘𝑦)𝑅(𝐹‘𝑥) → ¬ (𝐹‘𝑥) = (𝐹‘𝑦))) |
15 | 5, 14 | syld 47 | 1 ⊢ ((𝑅 Po 𝐴 ∧ (𝑥 ∈ On ∧ (𝑤 We 𝐴 ∧ 𝐷 ≠ ∅))) → (𝑦 ∈ 𝑥 → ¬ (𝐹‘𝑥) = (𝐹‘𝑦))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1539 ∈ wcel 2108 ≠ wne 2942 ∀wral 3063 {crab 3067 Vcvv 3422 ∅c0 4253 class class class wbr 5070 ↦ cmpt 5153 Po wpo 5492 We wwe 5534 ran crn 5581 “ cima 5583 Oncon0 6251 ‘cfv 6418 ℩crio 7211 recscrecs 8172 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pr 5347 ax-un 7566 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 |
This theorem is referenced by: zorn2lem4 10186 |
Copyright terms: Public domain | W3C validator |