Proof of Theorem suppssrst
| Step | Hyp | Ref
| Expression |
| 1 | | eldif 3210 |
. 2
⊢ (𝑋 ∈ (𝐴 ∖ 𝑊) ↔ (𝑋 ∈ 𝐴 ∧ ¬ 𝑋 ∈ 𝑊)) |
| 2 | | df-ne 2404 |
. . . . . 6
⊢ ((𝐹‘𝑋) ≠ 𝑍 ↔ ¬ (𝐹‘𝑋) = 𝑍) |
| 3 | | suppssr.f |
. . . . . . . . . . 11
⊢ (𝜑 → 𝐹:𝐴⟶𝐵) |
| 4 | | suppssr.a |
. . . . . . . . . . 11
⊢ (𝜑 → 𝐴 ∈ 𝑉) |
| 5 | 3, 4 | fexd 5894 |
. . . . . . . . . 10
⊢ (𝜑 → 𝐹 ∈ V) |
| 6 | | fvexg 5667 |
. . . . . . . . . 10
⊢ ((𝐹 ∈ V ∧ 𝑋 ∈ 𝐴) → (𝐹‘𝑋) ∈ V) |
| 7 | 5, 6 | sylan 283 |
. . . . . . . . 9
⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → (𝐹‘𝑋) ∈ V) |
| 8 | 7 | biantrurd 305 |
. . . . . . . 8
⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → ((𝐹‘𝑋) ≠ 𝑍 ↔ ((𝐹‘𝑋) ∈ V ∧ (𝐹‘𝑋) ≠ 𝑍))) |
| 9 | | eldifsn 3804 |
. . . . . . . 8
⊢ ((𝐹‘𝑋) ∈ (V ∖ {𝑍}) ↔ ((𝐹‘𝑋) ∈ V ∧ (𝐹‘𝑋) ≠ 𝑍)) |
| 10 | 8, 9 | bitr4di 198 |
. . . . . . 7
⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → ((𝐹‘𝑋) ≠ 𝑍 ↔ (𝐹‘𝑋) ∈ (V ∖ {𝑍}))) |
| 11 | 3 | ffnd 5490 |
. . . . . . . . . . 11
⊢ (𝜑 → 𝐹 Fn 𝐴) |
| 12 | | suppssrst.z |
. . . . . . . . . . 11
⊢ (𝜑 → 𝑍 ∈ 𝐵) |
| 13 | | elsuppfn 6421 |
. . . . . . . . . . 11
⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉 ∧ 𝑍 ∈ 𝐵) → (𝑋 ∈ (𝐹 supp 𝑍) ↔ (𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) ≠ 𝑍))) |
| 14 | 11, 4, 12, 13 | syl3anc 1274 |
. . . . . . . . . 10
⊢ (𝜑 → (𝑋 ∈ (𝐹 supp 𝑍) ↔ (𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) ≠ 𝑍))) |
| 15 | 10 | pm5.32da 452 |
. . . . . . . . . 10
⊢ (𝜑 → ((𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) ≠ 𝑍) ↔ (𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) ∈ (V ∖ {𝑍})))) |
| 16 | 14, 15 | bitrd 188 |
. . . . . . . . 9
⊢ (𝜑 → (𝑋 ∈ (𝐹 supp 𝑍) ↔ (𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) ∈ (V ∖ {𝑍})))) |
| 17 | | suppssr.n |
. . . . . . . . . 10
⊢ (𝜑 → (𝐹 supp 𝑍) ⊆ 𝑊) |
| 18 | 17 | sseld 3227 |
. . . . . . . . 9
⊢ (𝜑 → (𝑋 ∈ (𝐹 supp 𝑍) → 𝑋 ∈ 𝑊)) |
| 19 | 16, 18 | sylbird 170 |
. . . . . . . 8
⊢ (𝜑 → ((𝑋 ∈ 𝐴 ∧ (𝐹‘𝑋) ∈ (V ∖ {𝑍})) → 𝑋 ∈ 𝑊)) |
| 20 | 19 | expdimp 259 |
. . . . . . 7
⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → ((𝐹‘𝑋) ∈ (V ∖ {𝑍}) → 𝑋 ∈ 𝑊)) |
| 21 | 10, 20 | sylbid 150 |
. . . . . 6
⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → ((𝐹‘𝑋) ≠ 𝑍 → 𝑋 ∈ 𝑊)) |
| 22 | 2, 21 | biimtrrid 153 |
. . . . 5
⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → (¬ (𝐹‘𝑋) = 𝑍 → 𝑋 ∈ 𝑊)) |
| 23 | 22 | con3d 636 |
. . . 4
⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → (¬ 𝑋 ∈ 𝑊 → ¬ ¬ (𝐹‘𝑋) = 𝑍)) |
| 24 | | eqeq2 2241 |
. . . . . . 7
⊢ (𝑣 = 𝑍 → ((𝐹‘𝑋) = 𝑣 ↔ (𝐹‘𝑋) = 𝑍)) |
| 25 | 24 | stbid 840 |
. . . . . 6
⊢ (𝑣 = 𝑍 → (STAB (𝐹‘𝑋) = 𝑣 ↔ STAB (𝐹‘𝑋) = 𝑍)) |
| 26 | | eqeq1 2238 |
. . . . . . . . 9
⊢ (𝑢 = (𝐹‘𝑋) → (𝑢 = 𝑣 ↔ (𝐹‘𝑋) = 𝑣)) |
| 27 | 26 | stbid 840 |
. . . . . . . 8
⊢ (𝑢 = (𝐹‘𝑋) → (STAB 𝑢 = 𝑣 ↔ STAB (𝐹‘𝑋) = 𝑣)) |
| 28 | 27 | ralbidv 2533 |
. . . . . . 7
⊢ (𝑢 = (𝐹‘𝑋) → (∀𝑣 ∈ 𝐵 STAB 𝑢 = 𝑣 ↔ ∀𝑣 ∈ 𝐵 STAB (𝐹‘𝑋) = 𝑣)) |
| 29 | | suppssrst.st |
. . . . . . . 8
⊢ (𝜑 → ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 STAB 𝑢 = 𝑣) |
| 30 | 29 | adantr 276 |
. . . . . . 7
⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 STAB 𝑢 = 𝑣) |
| 31 | 3 | ffvelcdmda 5790 |
. . . . . . 7
⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → (𝐹‘𝑋) ∈ 𝐵) |
| 32 | 28, 30, 31 | rspcdva 2916 |
. . . . . 6
⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → ∀𝑣 ∈ 𝐵 STAB (𝐹‘𝑋) = 𝑣) |
| 33 | 12 | adantr 276 |
. . . . . 6
⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → 𝑍 ∈ 𝐵) |
| 34 | 25, 32, 33 | rspcdva 2916 |
. . . . 5
⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → STAB (𝐹‘𝑋) = 𝑍) |
| 35 | | df-stab 839 |
. . . . 5
⊢
(STAB (𝐹‘𝑋) = 𝑍 ↔ (¬ ¬ (𝐹‘𝑋) = 𝑍 → (𝐹‘𝑋) = 𝑍)) |
| 36 | 34, 35 | sylib 122 |
. . . 4
⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → (¬ ¬ (𝐹‘𝑋) = 𝑍 → (𝐹‘𝑋) = 𝑍)) |
| 37 | 23, 36 | syld 45 |
. . 3
⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → (¬ 𝑋 ∈ 𝑊 → (𝐹‘𝑋) = 𝑍)) |
| 38 | 37 | impr 379 |
. 2
⊢ ((𝜑 ∧ (𝑋 ∈ 𝐴 ∧ ¬ 𝑋 ∈ 𝑊)) → (𝐹‘𝑋) = 𝑍) |
| 39 | 1, 38 | sylan2b 287 |
1
⊢ ((𝜑 ∧ 𝑋 ∈ (𝐴 ∖ 𝑊)) → (𝐹‘𝑋) = 𝑍) |