Users' Mathboxes Mathbox for Thomas van Maaren < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  impprop Structured version   Visualization version   GIF version

Theorem impprop 38914
Description: The implication between two sentences of propositional calculus is a sentence of propositional calculus. (Contributed by Thomas van Maaren, 21-Aug-2026.)
Assertion
Ref Expression
impprop ((𝑥 ∈ PROP ∧ 𝑦 ∈ PROP) → (𝑥prop→𝑦) ∈ PROP)

Proof of Theorem impprop
Dummy variables 𝑤 𝑢 𝑣 𝑧 𝑛 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-prop 38910 . . 3 PROP = setrecs((𝑤 ∈ V ↦ {𝑧 ∣ (∃𝑣 ∈ 𝑤 (𝑧 = (prop¬‘𝑣) ∨ ∃𝑢 ∈ 𝑤 𝑧 = (𝑢prop→𝑣)) ∨ ∃𝑛 ∈ ℕ 𝑧 = (propvar ‘𝑛))}))
2 prex 5402 . . . 4 {𝑥, 𝑦} ∈ V
32a1i 11 . . 3 ((𝑥 ∈ PROP ∧ 𝑦 ∈ PROP) → {𝑥, 𝑦} ∈ V)
4 prssi 4781 . . 3 ((𝑥 ∈ PROP ∧ 𝑦 ∈ PROP) → {𝑥, 𝑦} ⊆ PROP)
51, 3, 4setrec1 10008 . 2 ((𝑥 ∈ PROP ∧ 𝑦 ∈ PROP) → ((𝑤 ∈ V ↦ {𝑧 ∣ (∃𝑣 ∈ 𝑤 (𝑧 = (prop¬‘𝑣) ∨ ∃𝑢 ∈ 𝑤 𝑧 = (𝑢prop→𝑣)) ∨ ∃𝑛 ∈ ℕ 𝑧 = (propvar ‘𝑛))})‘{𝑥, 𝑦}) ⊆ PROP)
6 vex 3457 . . . . . . . . . . . 12 𝑦 ∈ V
7 vex 3457 . . . . . . . . . . . 12 𝑥 ∈ V
8 oveq2 7458 . . . . . . . . . . . . 13 (𝑣 = 𝑦 → (𝑢prop→𝑣) = (𝑢prop→𝑦))
98eqeq2d 2777 . . . . . . . . . . . 12 (𝑣 = 𝑦 → (𝑧 = (𝑢prop→𝑣) ↔ 𝑧 = (𝑢prop→𝑦)))
10 oveq1 7457 . . . . . . . . . . . . 13 (𝑢 = 𝑥 → (𝑢prop→𝑦) = (𝑥prop→𝑦))
1110eqeq2d 2777 . . . . . . . . . . . 12 (𝑢 = 𝑥 → (𝑧 = (𝑢prop→𝑦) ↔ 𝑧 = (𝑥prop→𝑦)))
126, 7, 9, 11ceqsex2v 3504 . . . . . . . . . . 11 (∃𝑣∃𝑢(𝑣 = 𝑦 ∧ 𝑢 = 𝑥 ∧ 𝑧 = (𝑢prop→𝑣)) ↔ 𝑧 = (𝑥prop→𝑦))
1312bilanri 512 . . . . . . . . . 10 (((𝑥 ∈ PROP ∧ 𝑦 ∈ PROP) ∧ 𝑧 = (𝑥prop→𝑦)) → ∃𝑣∃𝑢(𝑣 = 𝑦 ∧ 𝑢 = 𝑥 ∧ 𝑧 = (𝑢prop→𝑣)))
14 3anass 1112 . . . . . . . . . . . . 13 ((𝑣 = 𝑦 ∧ 𝑢 = 𝑥 ∧ 𝑧 = (𝑢prop→𝑣)) ↔ (𝑣 = 𝑦 ∧ (𝑢 = 𝑥 ∧ 𝑧 = (𝑢prop→𝑣))))
1514exbii 1883 . . . . . . . . . . . 12 (∃𝑢(𝑣 = 𝑦 ∧ 𝑢 = 𝑥 ∧ 𝑧 = (𝑢prop→𝑣)) ↔ ∃𝑢(𝑣 = 𝑦 ∧ (𝑢 = 𝑥 ∧ 𝑧 = (𝑢prop→𝑣))))
16 19.42v 1990 . . . . . . . . . . . 12 (∃𝑢(𝑣 = 𝑦 ∧ (𝑢 = 𝑥 ∧ 𝑧 = (𝑢prop→𝑣))) ↔ (𝑣 = 𝑦 ∧ ∃𝑢(𝑢 = 𝑥 ∧ 𝑧 = (𝑢prop→𝑣))))
1715, 16bitri 278 . . . . . . . . . . 11 (∃𝑢(𝑣 = 𝑦 ∧ 𝑢 = 𝑥 ∧ 𝑧 = (𝑢prop→𝑣)) ↔ (𝑣 = 𝑦 ∧ ∃𝑢(𝑢 = 𝑥 ∧ 𝑧 = (𝑢prop→𝑣))))
1817exbii 1883 . . . . . . . . . 10 (∃𝑣∃𝑢(𝑣 = 𝑦 ∧ 𝑢 = 𝑥 ∧ 𝑧 = (𝑢prop→𝑣)) ↔ ∃𝑣(𝑣 = 𝑦 ∧ ∃𝑢(𝑢 = 𝑥 ∧ 𝑧 = (𝑢prop→𝑣))))
1913, 18sylib 221 . . . . . . . . 9 (((𝑥 ∈ PROP ∧ 𝑦 ∈ PROP) ∧ 𝑧 = (𝑥prop→𝑦)) → ∃𝑣(𝑣 = 𝑦 ∧ ∃𝑢(𝑢 = 𝑥 ∧ 𝑧 = (𝑢prop→𝑣))))
20 olc 882 . . . . . . . . . . . 12 (𝑣 = 𝑦 → (𝑣 = 𝑥 ∨ 𝑣 = 𝑦))
21 vex 3457 . . . . . . . . . . . . 13 𝑣 ∈ V
2221elpr 4608 . . . . . . . . . . . 12 (𝑣 ∈ {𝑥, 𝑦} ↔ (𝑣 = 𝑥 ∨ 𝑣 = 𝑦))
2320, 22sylibr 237 . . . . . . . . . . 11 (𝑣 = 𝑦 → 𝑣 ∈ {𝑥, 𝑦})
24 orc 881 . . . . . . . . . . . . . . . 16 (𝑢 = 𝑥 → (𝑢 = 𝑥 ∨ 𝑢 = 𝑦))
25 vex 3457 . . . . . . . . . . . . . . . . 17 𝑢 ∈ V
2625elpr 4608 . . . . . . . . . . . . . . . 16 (𝑢 ∈ {𝑥, 𝑦} ↔ (𝑢 = 𝑥 ∨ 𝑢 = 𝑦))
2724, 26sylibr 237 . . . . . . . . . . . . . . 15 (𝑢 = 𝑥 → 𝑢 ∈ {𝑥, 𝑦})
2827anim1i 627 . . . . . . . . . . . . . 14 ((𝑢 = 𝑥 ∧ 𝑧 = (𝑢prop→𝑣)) → (𝑢 ∈ {𝑥, 𝑦} ∧ 𝑧 = (𝑢prop→𝑣)))
2928eximi 1870 . . . . . . . . . . . . 13 (∃𝑢(𝑢 = 𝑥 ∧ 𝑧 = (𝑢prop→𝑣)) → ∃𝑢(𝑢 ∈ {𝑥, 𝑦} ∧ 𝑧 = (𝑢prop→𝑣)))
30 df-rex 3094 . . . . . . . . . . . . 13 (∃𝑢 ∈ {𝑥, 𝑦}𝑧 = (𝑢prop→𝑣) ↔ ∃𝑢(𝑢 ∈ {𝑥, 𝑦} ∧ 𝑧 = (𝑢prop→𝑣)))
3129, 30sylibr 237 . . . . . . . . . . . 12 (∃𝑢(𝑢 = 𝑥 ∧ 𝑧 = (𝑢prop→𝑣)) → ∃𝑢 ∈ {𝑥, 𝑦}𝑧 = (𝑢prop→𝑣))
3231olcd 888 . . . . . . . . . . 11 (∃𝑢(𝑢 = 𝑥 ∧ 𝑧 = (𝑢prop→𝑣)) → (𝑧 = (prop¬‘𝑣) ∨ ∃𝑢 ∈ {𝑥, 𝑦}𝑧 = (𝑢prop→𝑣)))
3323, 32anim12i 625 . . . . . . . . . 10 ((𝑣 = 𝑦 ∧ ∃𝑢(𝑢 = 𝑥 ∧ 𝑧 = (𝑢prop→𝑣))) → (𝑣 ∈ {𝑥, 𝑦} ∧ (𝑧 = (prop¬‘𝑣) ∨ ∃𝑢 ∈ {𝑥, 𝑦}𝑧 = (𝑢prop→𝑣))))
3433eximi 1870 . . . . . . . . 9 (∃𝑣(𝑣 = 𝑦 ∧ ∃𝑢(𝑢 = 𝑥 ∧ 𝑧 = (𝑢prop→𝑣))) → ∃𝑣(𝑣 ∈ {𝑥, 𝑦} ∧ (𝑧 = (prop¬‘𝑣) ∨ ∃𝑢 ∈ {𝑥, 𝑦}𝑧 = (𝑢prop→𝑣))))
3519, 34syl 18 . . . . . . . 8 (((𝑥 ∈ PROP ∧ 𝑦 ∈ PROP) ∧ 𝑧 = (𝑥prop→𝑦)) → ∃𝑣(𝑣 ∈ {𝑥, 𝑦} ∧ (𝑧 = (prop¬‘𝑣) ∨ ∃𝑢 ∈ {𝑥, 𝑦}𝑧 = (𝑢prop→𝑣))))
36 df-rex 3094 . . . . . . . 8 (∃𝑣 ∈ {𝑥, 𝑦} (𝑧 = (prop¬‘𝑣) ∨ ∃𝑢 ∈ {𝑥, 𝑦}𝑧 = (𝑢prop→𝑣)) ↔ ∃𝑣(𝑣 ∈ {𝑥, 𝑦} ∧ (𝑧 = (prop¬‘𝑣) ∨ ∃𝑢 ∈ {𝑥, 𝑦}𝑧 = (𝑢prop→𝑣))))
3735, 36sylibr 237 . . . . . . 7 (((𝑥 ∈ PROP ∧ 𝑦 ∈ PROP) ∧ 𝑧 = (𝑥prop→𝑦)) → ∃𝑣 ∈ {𝑥, 𝑦} (𝑧 = (prop¬‘𝑣) ∨ ∃𝑢 ∈ {𝑥, 𝑦}𝑧 = (𝑢prop→𝑣)))
3837orcd 887 . . . . . 6 (((𝑥 ∈ PROP ∧ 𝑦 ∈ PROP) ∧ 𝑧 = (𝑥prop→𝑦)) → (∃𝑣 ∈ {𝑥, 𝑦} (𝑧 = (prop¬‘𝑣) ∨ ∃𝑢 ∈ {𝑥, 𝑦}𝑧 = (𝑢prop→𝑣)) ∨ ∃𝑛 ∈ ℕ 𝑧 = (propvar ‘𝑛)))
3938ex 418 . . . . 5 ((𝑥 ∈ PROP ∧ 𝑦 ∈ PROP) → (𝑧 = (𝑥prop→𝑦) → (∃𝑣 ∈ {𝑥, 𝑦} (𝑧 = (prop¬‘𝑣) ∨ ∃𝑢 ∈ {𝑥, 𝑦}𝑧 = (𝑢prop→𝑣)) ∨ ∃𝑛 ∈ ℕ 𝑧 = (propvar ‘𝑛))))
4039alrimiv 1964 . . . 4 ((𝑥 ∈ PROP ∧ 𝑦 ∈ PROP) → ∀𝑧(𝑧 = (𝑥prop→𝑦) → (∃𝑣 ∈ {𝑥, 𝑦} (𝑧 = (prop¬‘𝑣) ∨ ∃𝑢 ∈ {𝑥, 𝑦}𝑧 = (𝑢prop→𝑣)) ∨ ∃𝑛 ∈ ℕ 𝑧 = (propvar ‘𝑛))))
41 ovex 7483 . . . . 5 (𝑥prop→𝑦) ∈ V
42 elab6g 3625 . . . . 5 ((𝑥prop→𝑦) ∈ V → ((𝑥prop→𝑦) ∈ {𝑧 ∣ (∃𝑣 ∈ {𝑥, 𝑦} (𝑧 = (prop¬‘𝑣) ∨ ∃𝑢 ∈ {𝑥, 𝑦}𝑧 = (𝑢prop→𝑣)) ∨ ∃𝑛 ∈ ℕ 𝑧 = (propvar ‘𝑛))} ↔ ∀𝑧(𝑧 = (𝑥prop→𝑦) → (∃𝑣 ∈ {𝑥, 𝑦} (𝑧 = (prop¬‘𝑣) ∨ ∃𝑢 ∈ {𝑥, 𝑦}𝑧 = (𝑢prop→𝑣)) ∨ ∃𝑛 ∈ ℕ 𝑧 = (propvar ‘𝑛)))))
4341, 42ax-mp 5 . . . 4 ((𝑥prop→𝑦) ∈ {𝑧 ∣ (∃𝑣 ∈ {𝑥, 𝑦} (𝑧 = (prop¬‘𝑣) ∨ ∃𝑢 ∈ {𝑥, 𝑦}𝑧 = (𝑢prop→𝑣)) ∨ ∃𝑛 ∈ ℕ 𝑧 = (propvar ‘𝑛))} ↔ ∀𝑧(𝑧 = (𝑥prop→𝑦) → (∃𝑣 ∈ {𝑥, 𝑦} (𝑧 = (prop¬‘𝑣) ∨ ∃𝑢 ∈ {𝑥, 𝑦}𝑧 = (𝑢prop→𝑣)) ∨ ∃𝑛 ∈ ℕ 𝑧 = (propvar ‘𝑛))))
4440, 43sylibr 237 . . 3 ((𝑥 ∈ PROP ∧ 𝑦 ∈ PROP) → (𝑥prop→𝑦) ∈ {𝑧 ∣ (∃𝑣 ∈ {𝑥, 𝑦} (𝑧 = (prop¬‘𝑣) ∨ ∃𝑢 ∈ {𝑥, 𝑦}𝑧 = (𝑢prop→𝑣)) ∨ ∃𝑛 ∈ ℕ 𝑧 = (propvar ‘𝑛))})
45 rexeq 3319 . . . . . . . . 9 (𝑤 = {𝑥, 𝑦} → (∃𝑢 ∈ 𝑤 𝑧 = (𝑢prop→𝑣) ↔ ∃𝑢 ∈ {𝑥, 𝑦}𝑧 = (𝑢prop→𝑣)))
4645orbi2d 929 . . . . . . . 8 (𝑤 = {𝑥, 𝑦} → ((𝑧 = (prop¬‘𝑣) ∨ ∃𝑢 ∈ 𝑤 𝑧 = (𝑢prop→𝑣)) ↔ (𝑧 = (prop¬‘𝑣) ∨ ∃𝑢 ∈ {𝑥, 𝑦}𝑧 = (𝑢prop→𝑣))))
4746rexeqbi1dv 3334 . . . . . . 7 (𝑤 = {𝑥, 𝑦} → (∃𝑣 ∈ 𝑤 (𝑧 = (prop¬‘𝑣) ∨ ∃𝑢 ∈ 𝑤 𝑧 = (𝑢prop→𝑣)) ↔ ∃𝑣 ∈ {𝑥, 𝑦} (𝑧 = (prop¬‘𝑣) ∨ ∃𝑢 ∈ {𝑥, 𝑦}𝑧 = (𝑢prop→𝑣))))
4847orbi1d 930 . . . . . 6 (𝑤 = {𝑥, 𝑦} → ((∃𝑣 ∈ 𝑤 (𝑧 = (prop¬‘𝑣) ∨ ∃𝑢 ∈ 𝑤 𝑧 = (𝑢prop→𝑣)) ∨ ∃𝑛 ∈ ℕ 𝑧 = (propvar ‘𝑛)) ↔ (∃𝑣 ∈ {𝑥, 𝑦} (𝑧 = (prop¬‘𝑣) ∨ ∃𝑢 ∈ {𝑥, 𝑦}𝑧 = (𝑢prop→𝑣)) ∨ ∃𝑛 ∈ ℕ 𝑧 = (propvar ‘𝑛))))
4948abbidv 2832 . . . . 5 (𝑤 = {𝑥, 𝑦} → {𝑧 ∣ (∃𝑣 ∈ 𝑤 (𝑧 = (prop¬‘𝑣) ∨ ∃𝑢 ∈ 𝑤 𝑧 = (𝑢prop→𝑣)) ∨ ∃𝑛 ∈ ℕ 𝑧 = (propvar ‘𝑛))} = {𝑧 ∣ (∃𝑣 ∈ {𝑥, 𝑦} (𝑧 = (prop¬‘𝑣) ∨ ∃𝑢 ∈ {𝑥, 𝑦}𝑧 = (𝑢prop→𝑣)) ∨ ∃𝑛 ∈ ℕ 𝑧 = (propvar ‘𝑛))})
50 eqid 2766 . . . . 5 (𝑤 ∈ V ↦ {𝑧 ∣ (∃𝑣 ∈ 𝑤 (𝑧 = (prop¬‘𝑣) ∨ ∃𝑢 ∈ 𝑤 𝑧 = (𝑢prop→𝑣)) ∨ ∃𝑛 ∈ ℕ 𝑧 = (propvar ‘𝑛))}) = (𝑤 ∈ V ↦ {𝑧 ∣ (∃𝑣 ∈ 𝑤 (𝑧 = (prop¬‘𝑣) ∨ ∃𝑢 ∈ 𝑤 𝑧 = (𝑢prop→𝑣)) ∨ ∃𝑛 ∈ ℕ 𝑧 = (propvar ‘𝑛))})
512dfproplem 38911 . . . . 5 {𝑧 ∣ (∃𝑣 ∈ {𝑥, 𝑦} (𝑧 = (prop¬‘𝑣) ∨ ∃𝑢 ∈ {𝑥, 𝑦}𝑧 = (𝑢prop→𝑣)) ∨ ∃𝑛 ∈ ℕ 𝑧 = (propvar ‘𝑛))} ∈ V
5249, 50, 51fvmpt 7023 . . . 4 ({𝑥, 𝑦} ∈ V → ((𝑤 ∈ V ↦ {𝑧 ∣ (∃𝑣 ∈ 𝑤 (𝑧 = (prop¬‘𝑣) ∨ ∃𝑢 ∈ 𝑤 𝑧 = (𝑢prop→𝑣)) ∨ ∃𝑛 ∈ ℕ 𝑧 = (propvar ‘𝑛))})‘{𝑥, 𝑦}) = {𝑧 ∣ (∃𝑣 ∈ {𝑥, 𝑦} (𝑧 = (prop¬‘𝑣) ∨ ∃𝑢 ∈ {𝑥, 𝑦}𝑧 = (𝑢prop→𝑣)) ∨ ∃𝑛 ∈ ℕ 𝑧 = (propvar ‘𝑛))})
532, 52ax-mp 5 . . 3 ((𝑤 ∈ V ↦ {𝑧 ∣ (∃𝑣 ∈ 𝑤 (𝑧 = (prop¬‘𝑣) ∨ ∃𝑢 ∈ 𝑤 𝑧 = (𝑢prop→𝑣)) ∨ ∃𝑛 ∈ ℕ 𝑧 = (propvar ‘𝑛))})‘{𝑥, 𝑦}) = {𝑧 ∣ (∃𝑣 ∈ {𝑥, 𝑦} (𝑧 = (prop¬‘𝑣) ∨ ∃𝑢 ∈ {𝑥, 𝑦}𝑧 = (𝑢prop→𝑣)) ∨ ∃𝑛 ∈ ℕ 𝑧 = (propvar ‘𝑛))}
5444, 53eleqtrrdi 2878 . 2 ((𝑥 ∈ PROP ∧ 𝑦 ∈ PROP) → (𝑥prop→𝑦) ∈ ((𝑤 ∈ V ↦ {𝑧 ∣ (∃𝑣 ∈ 𝑤 (𝑧 = (prop¬‘𝑣) ∨ ∃𝑢 ∈ 𝑤 𝑧 = (𝑢prop→𝑣)) ∨ ∃𝑛 ∈ ℕ 𝑧 = (propvar ‘𝑛))})‘{𝑥, 𝑦}))
555, 54sseldd 3913 1 ((𝑥 ∈ PROP ∧ 𝑦 ∈ PROP) → (𝑥prop→𝑦) ∈ PROP)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∧ w3a 1104  ∀wal 1570   = wceq 1572  ∃wex 1814   ∈ wcel 2150  {cab 2744  ∃wrex 3093  Vcvv 3453  {cpr 4589   ↦ cmpt 5191  ‘cfv 6565  (class class class)co 7450  ℕcn 12374  propvar cpropvar 38903  prop¬cpropneg 38904  prop→cpropimp 38905  PROPcprop 38909
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782  ax-reg 9622  ax-inf2 9678  ax-cnex 11294  ax-1cn 11296  ax-addcl 11298
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-int 4912  df-iun 4957  df-iin 4958  df-br 5108  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-pred 6329  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-ov 7453  df-om 7911  df-2nd 8035  df-frecs 8336  df-wrecs 8367  df-recs 8416  df-rdg 8455  df-r1 9804  df-rank 9805  df-scott 9965  df-setrecs 10001  df-nn 12375  df-prop 38910
This theorem is used by:  dfprop1  38915
  Copyright terms: Public domain W3C validator