Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > nfopd | GIF version |
Description: Deduction version of bound-variable hypothesis builder nfop 3759. This shows how the deduction version of a not-free theorem such as nfop 3759 can be created from the corresponding not-free inference theorem. (Contributed by NM, 4-Feb-2008.) |
Ref | Expression |
---|---|
nfopd.2 | ⊢ (𝜑 → Ⅎ𝑥𝐴) |
nfopd.3 | ⊢ (𝜑 → Ⅎ𝑥𝐵) |
Ref | Expression |
---|---|
nfopd | ⊢ (𝜑 → Ⅎ𝑥〈𝐴, 𝐵〉) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfaba1 2305 | . . 3 ⊢ Ⅎ𝑥{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴} | |
2 | nfaba1 2305 | . . 3 ⊢ Ⅎ𝑥{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵} | |
3 | 1, 2 | nfop 3759 | . 2 ⊢ Ⅎ𝑥〈{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}, {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}〉 |
4 | nfopd.2 | . . 3 ⊢ (𝜑 → Ⅎ𝑥𝐴) | |
5 | nfopd.3 | . . 3 ⊢ (𝜑 → Ⅎ𝑥𝐵) | |
6 | nfnfc1 2302 | . . . . 5 ⊢ Ⅎ𝑥Ⅎ𝑥𝐴 | |
7 | nfnfc1 2302 | . . . . 5 ⊢ Ⅎ𝑥Ⅎ𝑥𝐵 | |
8 | 6, 7 | nfan 1545 | . . . 4 ⊢ Ⅎ𝑥(Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) |
9 | abidnf 2880 | . . . . . 6 ⊢ (Ⅎ𝑥𝐴 → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴} = 𝐴) | |
10 | 9 | adantr 274 | . . . . 5 ⊢ ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴} = 𝐴) |
11 | abidnf 2880 | . . . . . 6 ⊢ (Ⅎ𝑥𝐵 → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵} = 𝐵) | |
12 | 11 | adantl 275 | . . . . 5 ⊢ ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵} = 𝐵) |
13 | 10, 12 | opeq12d 3751 | . . . 4 ⊢ ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) → 〈{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}, {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}〉 = 〈𝐴, 𝐵〉) |
14 | 8, 13 | nfceqdf 2298 | . . 3 ⊢ ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) → (Ⅎ𝑥〈{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}, {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}〉 ↔ Ⅎ𝑥〈𝐴, 𝐵〉)) |
15 | 4, 5, 14 | syl2anc 409 | . 2 ⊢ (𝜑 → (Ⅎ𝑥〈{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}, {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}〉 ↔ Ⅎ𝑥〈𝐴, 𝐵〉)) |
16 | 3, 15 | mpbii 147 | 1 ⊢ (𝜑 → Ⅎ𝑥〈𝐴, 𝐵〉) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 ∀wal 1333 = wceq 1335 ∈ wcel 2128 {cab 2143 Ⅎwnfc 2286 〈cop 3564 |
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-io 699 ax-5 1427 ax-7 1428 ax-gen 1429 ax-ie1 1473 ax-ie2 1474 ax-8 1484 ax-10 1485 ax-11 1486 ax-i12 1487 ax-bndl 1489 ax-4 1490 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2139 |
This theorem depends on definitions: df-bi 116 df-3an 965 df-tru 1338 df-nf 1441 df-sb 1743 df-clab 2144 df-cleq 2150 df-clel 2153 df-nfc 2288 df-v 2714 df-un 3106 df-sn 3567 df-pr 3568 df-op 3570 |
This theorem is referenced by: nfbrd 4011 nfovd 5852 |
Copyright terms: Public domain | W3C validator |