Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > fodjumkvlemres | GIF version |
Description: Lemma for fodjumkv 7027. The final result with 𝑃 expressed as a local definition. (Contributed by Jim Kingdon, 25-Mar-2023.) |
Ref | Expression |
---|---|
fodjumkv.o | ⊢ (𝜑 → 𝑀 ∈ Markov) |
fodjumkv.fo | ⊢ (𝜑 → 𝐹:𝑀–onto→(𝐴 ⊔ 𝐵)) |
fodjumkv.p | ⊢ 𝑃 = (𝑦 ∈ 𝑀 ↦ if(∃𝑧 ∈ 𝐴 (𝐹‘𝑦) = (inl‘𝑧), ∅, 1o)) |
Ref | Expression |
---|---|
fodjumkvlemres | ⊢ (𝜑 → (𝐴 ≠ ∅ → ∃𝑥 𝑥 ∈ 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fodjumkv.fo | . . . . . 6 ⊢ (𝜑 → 𝐹:𝑀–onto→(𝐴 ⊔ 𝐵)) | |
2 | 1 | adantr 274 | . . . . 5 ⊢ ((𝜑 ∧ ∀𝑤 ∈ 𝑀 (𝑃‘𝑤) = 1o) → 𝐹:𝑀–onto→(𝐴 ⊔ 𝐵)) |
3 | fodjumkv.p | . . . . 5 ⊢ 𝑃 = (𝑦 ∈ 𝑀 ↦ if(∃𝑧 ∈ 𝐴 (𝐹‘𝑦) = (inl‘𝑧), ∅, 1o)) | |
4 | simpr 109 | . . . . 5 ⊢ ((𝜑 ∧ ∀𝑤 ∈ 𝑀 (𝑃‘𝑤) = 1o) → ∀𝑤 ∈ 𝑀 (𝑃‘𝑤) = 1o) | |
5 | 2, 3, 4 | fodju0 7012 | . . . 4 ⊢ ((𝜑 ∧ ∀𝑤 ∈ 𝑀 (𝑃‘𝑤) = 1o) → 𝐴 = ∅) |
6 | 5 | ex 114 | . . 3 ⊢ (𝜑 → (∀𝑤 ∈ 𝑀 (𝑃‘𝑤) = 1o → 𝐴 = ∅)) |
7 | 6 | necon3ad 2348 | . 2 ⊢ (𝜑 → (𝐴 ≠ ∅ → ¬ ∀𝑤 ∈ 𝑀 (𝑃‘𝑤) = 1o)) |
8 | fveq1 5413 | . . . . . . 7 ⊢ (𝑓 = 𝑃 → (𝑓‘𝑤) = (𝑃‘𝑤)) | |
9 | 8 | eqeq1d 2146 | . . . . . 6 ⊢ (𝑓 = 𝑃 → ((𝑓‘𝑤) = 1o ↔ (𝑃‘𝑤) = 1o)) |
10 | 9 | ralbidv 2435 | . . . . 5 ⊢ (𝑓 = 𝑃 → (∀𝑤 ∈ 𝑀 (𝑓‘𝑤) = 1o ↔ ∀𝑤 ∈ 𝑀 (𝑃‘𝑤) = 1o)) |
11 | 10 | notbid 656 | . . . 4 ⊢ (𝑓 = 𝑃 → (¬ ∀𝑤 ∈ 𝑀 (𝑓‘𝑤) = 1o ↔ ¬ ∀𝑤 ∈ 𝑀 (𝑃‘𝑤) = 1o)) |
12 | 8 | eqeq1d 2146 | . . . . 5 ⊢ (𝑓 = 𝑃 → ((𝑓‘𝑤) = ∅ ↔ (𝑃‘𝑤) = ∅)) |
13 | 12 | rexbidv 2436 | . . . 4 ⊢ (𝑓 = 𝑃 → (∃𝑤 ∈ 𝑀 (𝑓‘𝑤) = ∅ ↔ ∃𝑤 ∈ 𝑀 (𝑃‘𝑤) = ∅)) |
14 | 11, 13 | imbi12d 233 | . . 3 ⊢ (𝑓 = 𝑃 → ((¬ ∀𝑤 ∈ 𝑀 (𝑓‘𝑤) = 1o → ∃𝑤 ∈ 𝑀 (𝑓‘𝑤) = ∅) ↔ (¬ ∀𝑤 ∈ 𝑀 (𝑃‘𝑤) = 1o → ∃𝑤 ∈ 𝑀 (𝑃‘𝑤) = ∅))) |
15 | fodjumkv.o | . . . 4 ⊢ (𝜑 → 𝑀 ∈ Markov) | |
16 | ismkvmap 7021 | . . . . 5 ⊢ (𝑀 ∈ Markov → (𝑀 ∈ Markov ↔ ∀𝑓 ∈ (2o ↑𝑚 𝑀)(¬ ∀𝑤 ∈ 𝑀 (𝑓‘𝑤) = 1o → ∃𝑤 ∈ 𝑀 (𝑓‘𝑤) = ∅))) | |
17 | 16 | ibi 175 | . . . 4 ⊢ (𝑀 ∈ Markov → ∀𝑓 ∈ (2o ↑𝑚 𝑀)(¬ ∀𝑤 ∈ 𝑀 (𝑓‘𝑤) = 1o → ∃𝑤 ∈ 𝑀 (𝑓‘𝑤) = ∅)) |
18 | 15, 17 | syl 14 | . . 3 ⊢ (𝜑 → ∀𝑓 ∈ (2o ↑𝑚 𝑀)(¬ ∀𝑤 ∈ 𝑀 (𝑓‘𝑤) = 1o → ∃𝑤 ∈ 𝑀 (𝑓‘𝑤) = ∅)) |
19 | 1, 3, 15 | fodjuf 7010 | . . 3 ⊢ (𝜑 → 𝑃 ∈ (2o ↑𝑚 𝑀)) |
20 | 14, 18, 19 | rspcdva 2789 | . 2 ⊢ (𝜑 → (¬ ∀𝑤 ∈ 𝑀 (𝑃‘𝑤) = 1o → ∃𝑤 ∈ 𝑀 (𝑃‘𝑤) = ∅)) |
21 | 1 | adantr 274 | . . . 4 ⊢ ((𝜑 ∧ ∃𝑤 ∈ 𝑀 (𝑃‘𝑤) = ∅) → 𝐹:𝑀–onto→(𝐴 ⊔ 𝐵)) |
22 | simpr 109 | . . . . 5 ⊢ ((𝜑 ∧ ∃𝑤 ∈ 𝑀 (𝑃‘𝑤) = ∅) → ∃𝑤 ∈ 𝑀 (𝑃‘𝑤) = ∅) | |
23 | fveqeq2 5423 | . . . . . 6 ⊢ (𝑤 = 𝑣 → ((𝑃‘𝑤) = ∅ ↔ (𝑃‘𝑣) = ∅)) | |
24 | 23 | cbvrexv 2653 | . . . . 5 ⊢ (∃𝑤 ∈ 𝑀 (𝑃‘𝑤) = ∅ ↔ ∃𝑣 ∈ 𝑀 (𝑃‘𝑣) = ∅) |
25 | 22, 24 | sylib 121 | . . . 4 ⊢ ((𝜑 ∧ ∃𝑤 ∈ 𝑀 (𝑃‘𝑤) = ∅) → ∃𝑣 ∈ 𝑀 (𝑃‘𝑣) = ∅) |
26 | 21, 3, 25 | fodjum 7011 | . . 3 ⊢ ((𝜑 ∧ ∃𝑤 ∈ 𝑀 (𝑃‘𝑤) = ∅) → ∃𝑥 𝑥 ∈ 𝐴) |
27 | 26 | ex 114 | . 2 ⊢ (𝜑 → (∃𝑤 ∈ 𝑀 (𝑃‘𝑤) = ∅ → ∃𝑥 𝑥 ∈ 𝐴)) |
28 | 7, 20, 27 | 3syld 57 | 1 ⊢ (𝜑 → (𝐴 ≠ ∅ → ∃𝑥 𝑥 ∈ 𝐴)) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 103 = wceq 1331 ∃wex 1468 ∈ wcel 1480 ≠ wne 2306 ∀wral 2414 ∃wrex 2415 ∅c0 3358 ifcif 3469 ↦ cmpt 3984 –onto→wfo 5116 ‘cfv 5118 (class class class)co 5767 1oc1o 6299 2oc2o 6300 ↑𝑚 cmap 6535 ⊔ cdju 6915 inlcinl 6923 Markovcmarkov 7018 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2119 ax-sep 4041 ax-nul 4049 ax-pow 4093 ax-pr 4126 ax-un 4350 ax-setind 4447 |
This theorem depends on definitions: df-bi 116 df-dc 820 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2000 df-mo 2001 df-clab 2124 df-cleq 2130 df-clel 2133 df-nfc 2268 df-ne 2307 df-ral 2419 df-rex 2420 df-rab 2423 df-v 2683 df-sbc 2905 df-csb 2999 df-dif 3068 df-un 3070 df-in 3072 df-ss 3079 df-nul 3359 df-if 3470 df-pw 3507 df-sn 3528 df-pr 3529 df-op 3531 df-uni 3732 df-int 3767 df-br 3925 df-opab 3985 df-mpt 3986 df-tr 4022 df-id 4210 df-iord 4283 df-on 4285 df-suc 4288 df-iom 4500 df-xp 4540 df-rel 4541 df-cnv 4542 df-co 4543 df-dm 4544 df-rn 4545 df-res 4546 df-ima 4547 df-iota 5083 df-fun 5120 df-fn 5121 df-f 5122 df-f1 5123 df-fo 5124 df-f1o 5125 df-fv 5126 df-ov 5770 df-oprab 5771 df-mpo 5772 df-1st 6031 df-2nd 6032 df-1o 6306 df-2o 6307 df-map 6537 df-dju 6916 df-inl 6925 df-inr 6926 df-markov 7019 |
This theorem is referenced by: fodjumkv 7027 |
Copyright terms: Public domain | W3C validator |